Results 21 to 30 of about 12,135 (97)
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
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
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
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
Integrable Renormalization I: the Ladder Case
, 2004 In recent years a Hopf algebraic structure underlying the process of renormalization in quantum field theory was found. It led to a Birkhoff factorization for (regularized) Hopf algebra characters, i.e. for Feynman rules.
Ebrahimi-Fard, Kurusch +2 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 +2 more sources
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
Semantics and Proof Theory of the Epsilon Calculus
, 2016 The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. The application of this undervalued formalism has been hampered by the absence of well-behaved proof systems on the one hand, and accessible ...
A Blass +15 more
core +1 more source
Algebraic proof theory for LE-logics
, 2018 In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics).
Greco, Giuseppe +4 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