Results 11 to 20 of about 12,179 (98)
A System of Interaction and Structure
, 2007 This paper introduces a logical system, called BV, which extends multiplicative linear logic by a non-commutative self-dual logical operator. This extension is particularly challenging for the sequent calculus, and so far it is not achieved therein.
Alessio Guglielmi +8 more
core +1 more source
, 2011 We consider two styles of proof calculi for a family of tense logics, presented in a formalism based on nested sequents. A nested sequent can be seen as a tree of traditional single-sided sequents.
Alwen Tiu +13 more
core +1 more source
Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics [PDF]
, 2019 This work provides proof-search algorithms and automated counter-model extraction for a class of STIT logics. With this, we answer an open problem concerning syntactic decision procedures and cut-free calculi for STIT logics.
A Ciabattoni +15 more
core +2 more sources
Collection analysis for Horn clause programs [PDF]
, 2006 We consider approximating data structures with collections of the items that they contain. For examples, lists, binary trees, tuples, etc, can be approximated by sets or multisets of the items within them.
Miller, Dale
core +4 more sources
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
Fast Cut-Elimination using Proof Terms: An Empirical Study
, 2018 Urban and Bierman introduced a calculus of proof terms for the sequent calculus LK with a strongly normalizing reduction relation. We extend this calculus to simply-typed higher-order logic with inferences for induction and equality, albeit without ...
Ebner, Gabriel
core +2 more sources
Inducing syntactic cut-elimination for indexed nested sequents
, 2018 The key to the proof-theoretic study of a logic is a proof calculus with a subformula property. Many different proof formalisms have been introduced (e.g. sequent, nested sequent, labelled sequent formalisms) in order to provide such calculi for the many
Ramanayake, Revantha
core +1 more source
Integrating a Global Induction Mechanism into a Sequent Calculus
, 2017 Most interesting proofs in mathematics contain an inductive argument which requires an extension of the LK-calculus to formalize. The most commonly used calculi for induction contain a separate rule or axiom which reduces the valid proof theoretic ...
C Dunchev +19 more
core +1 more source
Proof-graphs for Minimal Implicational Logic
, 2014 It is well-known that the size of propositional classical proofs can be huge. Proof theoretical studies discovered exponential gaps between normal or cut free proofs and their respective non-normal proofs.
Gordeev, Lew +2 more
core +4 more sources