Results 11 to 20 of about 41,558 (198)
The Basics of Display Calculi [PDF]
, 2017 The aim of this paper is to introduce and explain display calculi for a variety of logics. We provide a survey of key results concerning such calculi, though we focus mainly on the global cut elimination theorem.
Eckhardt, Timo +3 more
core +2 more sources
Semantic A-translation and Super-consistency entail Classical Cut Elimination [PDF]
, 2013 We show that if a theory R defined by a rewrite system is super-consistent, the classical sequent calculus modulo R enjoys the cut elimination property, which was an open question.
Lisa Allali +2 more
core +5 more sources
A Cut-Free Sequential System for the Propositional Modal Logic of Finite Chains [PDF]
, 1983 The main purpose of this paper is to give a cut-free Gentzen-type sequential system for K4.3G of finite chains.
Nishimura Hirokazu, 西村 泰一
core +1 more source
Cut-elimination and a permutation-free sequent calculus for intuitionistic logic [PDF]
, 1998 We describe a sequent calculus, based on work of Herbelin's, of which the cut-free derivations are in 1-1 correspondence with normal natural deduction proofs of intuitionistic logic.
Dyckhoff, Roy, Pinto, Luís F.
core +3 more sources
Reverse mathematics and well-ordering principles [PDF]
, 2011 The paper is concerned with generally Pi^1_2 sentences of the form 'if X is well ordered then f(X) is well ordered', where f is a standard proof theoretic function from ordinals to ordinals.
Rathjen, Michael, Weiermann, Andreas
core +1 more source
Cut-elimination for the modal Grzegorczyk logic via non-well-founded proofs
, 2017 We present a sequent calculus for the modal Grzegorczyk logic Grz allowing non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs.Comment: WOLLIC'17, 12 pages, 1 ...
A Avron +5 more
core +1 more source
A Cut-Free Sequent Calculus for Defeasible Erotetic Inferences [PDF]
, 2018 In recent years, the effort to formalize erotetic inferences (i.e., inferences to and from questions) has become a central concern for those working in erotetic logic. However, few have sought to formulate a proof theory for
Millson, Jared
core +3 more sources
Dual-Context Calculi for Modal Logic [PDF]
, 2020 We present natural deduction systems and associated modal lambda calculi for the necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in the dual-context style: they feature two distinct zones of assumptions, one of which
Kavvos, G. A.
core +4 more sources
A New Linear Logic for Deadlock-Free Session-Typed Processes [PDF]
, 2018 The π -calculus, viewed as a core concurrent programming language, has been used as the target of much research on type systems for concurrency. In this paper we propose a new type system for deadlock-free session-typed π -calculus processes, by ...
G Bellin +28 more
core +1 more source
Algorithmic Introduction of Quantified Cuts
, 2014 We describe a method for inverting Gentzen's cut-elimination in classical first-order logic. Our algorithm is based on first computign a compressed representation of the terms present in the cut-free proof and then cut-formulas that realize such a ...
Hetzl, Stefan +3 more
core +2 more sources