FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

This page contains an index consisting of author-provided keywords.

A
admissible rules	Admissible tools in the kitchen of intuitionistic logic
B
bi-intuitionistic logic	Towards a Dualized Sequent Calculus with Canonicity
C
classical logic	Some ideas on cut-elimination for cyclic arithmetic proofs
Classical sequent calculus	Herbrand's Theorem as Higher-Order Recursion
Consistency proofs	Some ideas on cut-elimination for cyclic arithmetic proofs
Continuous computation	Some ideas on cut-elimination for cyclic arithmetic proofs
Curry-Howard	On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains
cut-elimination	Some ideas on cut-elimination for cyclic arithmetic proofs Fast cut-elimination using proof terms: an empirical study
cyclic induction	Validating Back-links of FOL-ID Cyclic Pre-proofs
Cyclic proofs	Some ideas on cut-elimination for cyclic arithmetic proofs
D
denotational semantics	A Denotational Model of the Typed Lambda-Mu Calculus
dualized proof system	Towards a Dualized Sequent Calculus with Canonicity
E
expansion proofs	Fast cut-elimination using proof terms: an empirical study
F
fibred category theory	The “duality of computation” from a fibrational perspective
first-order logic with inductive definitions	Validating Back-links of FOL-ID Cyclic Pre-proofs
H
Herbrand's theorem	Herbrand's Theorem as Higher-Order Recursion Fast cut-elimination using proof terms: an empirical study
Higher order recursion schemes	Herbrand's Theorem as Higher-Order Recursion
I
induction reasoning	Validating Back-links of FOL-ID Cyclic Pre-proofs
Infinite computation	Some ideas on cut-elimination for cyclic arithmetic proofs
Infinitely nested Boolean structure	A Denotational Model of the Typed Lambda-Mu Calculus
Intuitionistic logic	Admissible tools in the kitchen of intuitionistic logic
Intuitionistic logic of constant domains	On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains
M
mechanical reasoning	Validating Back-links of FOL-ID Cyclic Pre-proofs
mu-mutilde-calculus	The “duality of computation” from a fibrational perspective
N
Natural deduction	On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains
Non-wellfounded proofs	Some ideas on cut-elimination for cyclic arithmetic proofs
P
Peano arithmetic	Some ideas on cut-elimination for cyclic arithmetic proofs
proof terms	Fast cut-elimination using proof terms: an empirical study
Proof theory	Some ideas on cut-elimination for cyclic arithmetic proofs Admissible tools in the kitchen of intuitionistic logic
proofs-as-programs-as-morphisms	The “duality of computation” from a fibrational perspective
propositional logic	Admissible tools in the kitchen of intuitionistic logic
R
Reductive cut elimination	Herbrand's Theorem as Higher-Order Recursion
S
sequent calculus	Towards a Dualized Sequent Calculus with Canonicity
T
Type reduction	A Denotational Model of the Typed Lambda-Mu Calculus
Typed lambda-mu calculus	A Denotational Model of the Typed Lambda-Mu Calculus

Disclaimer | Powered by EasyChair Smart Program