Results 11 to 20 of about 2,879,484 (330)
Cut-Elimination for the Modal Grzegorczyk Logic via Non-well-founded Proofs [PDF]
Workshop on Logic, Language, Information and Computation, 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.
Yury Savateev, Daniyar S. Shamkanov
semanticscholar +3 more sources
Cut Elimination for Extended Sequent Calculi
Bulletin of the Section of Logic, 2023 We present a syntactical cut-elimination proof for an extended sequent calculus covering the classical modal logics in the \(\mathsf{K}\), \(\mathsf{D}\), \(\mathsf{T}\), \(\mathsf{K4}\), \(\mathsf{D4}\) and \(\mathsf{S4}\) spectrum.
Simone Martini +2 more
doaj +4 more sources
Elimination of Cuts in First-order Finite-valued Logics [PDF]
, 1993 A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established.
Baaz, Matthias +2 more
core +5 more sources
The Structure of Differential Invariants and Differential Cut Elimination [PDF]
Logical Methods in Computer Science, 2012 The biggest challenge in hybrid systems verification is the handling of differential equations. Because computable closed-form solutions only exist for very simple differential equations, proof certificates have been proposed for more scalable ...
Andre Platzer
doaj +5 more sources
Cut Elimination in Multifocused Linear Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We study cut elimination for a multifocused variant of full linear logic in the sequent calculus. The multifocused normal form of proofs yields problems that do not appear in a standard focused system, related to the constraints in grouping rule ...
Taus Brock-Nannestad, Nicolas Guenot
doaj +6 more sources
Free Definite Description Theory – Sequent Calculi and Cut Elimination
Logic and Logical Philosophy, 2020 We provide an application of a sequent calculus framework to the formalization of definite descriptions. It is a continuation of research undertaken in [20, 22].
Andrzej Indrzejczak
semanticscholar +3 more sources
Full Cut Elimination and Interpolation for Intuitionistic Logic with Existence Predicate
Bulletin of the Section of Logic, 2019 In previous work by Baaz and Iemhoff, a Gentzen calculus for intuitionistic logic with existence predicate is presented that satisfies partial cut elimination and Craig's interpolation property; it is also conjectured that interpolation fails for the ...
Paolo Maffezioli, E. Orlandelli
semanticscholar +3 more sources
Generating facets for the cut polytope of a graph by triangular elimination [PDF]
, 2006 The cut polytope of a graph arises in many fields. Although much is known about facets of the cut polytope of the complete graph, very little is known for general graphs. The study of Bell inequalities in quantum information science requires knowledge of
Avis, David +2 more
core +5 more sources
Cut Elimination, Identity Elimination, and Interpolation in Super-Belnap Logics [PDF]
Studia Logica, 2017 We develop a Gentzen-style proof theory for super-Belnap logics (extensions of the four-valued Dunn–Belnap logic), expanding on an approach initiated by Pynko.
Adam Přenosil
semanticscholar +5 more sources
Semantic A-translations and Super-Consistency Entail Classical Cut Elimination [PDF]
Logic Programming and Automated Reasoning, 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.
L. Allali, O. Hermant
semanticscholar +7 more sources