Switch to: References

Add citations

You must login to add citations.
  1. Efficient elimination of Skolem functions in $$\text {LK}^\text {h}$$ LK h.Ján Komara - 2022 - Archive for Mathematical Logic 61 (3):503-534.
    We present a sequent calculus with the Henkin constants in the place of the free variables. By disposing of the eigenvariable condition, we obtained a proof system with a strong locality property—the validity of each inference step depends only on its active formulas, not its context. Our major outcomes are: the cut elimination via a non-Gentzen-style algorithm without resorting to regularization and the elimination of Skolem functions with linear increase in the proof length for a subclass of derivations with cuts.
    Download  
     
    Export citation  
     
    Bookmark  
  • Induction and Skolemization in saturation theorem proving.Stefan Hetzl & Jannik Vierling - 2023 - Annals of Pure and Applied Logic 174 (1):103167.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Simplified Proof of the Epsilon Theorems.Stefan Hetzl - forthcoming - Review of Symbolic Logic:1-16.
    We formulate Hilbert’s epsilon calculus in the context of expansion proofs. This leads to a simplified proof of the epsilon theorems by disposing of the need for prenexification, Skolemisation, and their respective inverse transformations. We observe that the natural notion of cut in the epsilon calculus is associative.
    Download  
     
    Export citation  
     
    Bookmark  
  • Skolemization in intermediate logics with the finite model property.Matthias Baaz & Rosalie Iemhoff - 2016 - Logic Journal of the IGPL 24 (3):224-237.
    Download  
     
    Export citation  
     
    Bookmark  
  • Cut-Elimination: Syntax and Semantics.M. Baaz & A. Leitsch - 2014 - Studia Logica 102 (6):1217-1244.
    In this paper we first give a survey of reductive cut-elimination methods in classical logic. In particular we describe the methods of Gentzen and Schütte-Tait from the abstract point of view of proof reduction. We also present the method CERES which we classify as a semi-semantic method. In a further section we describe the so-called semantic methods. In the second part of the paper we carry the proof analysis further by generalizing the CERES method to CERESD . In the generalized (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations