Switch to: Citations

Add references

You must login to add references.
  1. Cut normal forms and proof complexity.Matthias Baaz & Alexander Leitsch - 1999 - Annals of Pure and Applied Logic 97 (1-3):127-177.
    Statman and Orevkov independently proved that cut-elimination is of nonelementary complexity. Although their worst-case sequences are mathematically different the syntax of the corresponding cut formulas is of striking similarity. This leads to the main question of this paper: to what extent is it possible to restrict the syntax of formulas and — at the same time—keep their power as cut formulas in a proof? We give a detailed analysis of this problem for negation normal form , prenex normal form and (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A compact representation of proofs.Dale A. Miller - 1987 - Studia Logica 46 (4):347 - 370.
    A structure which generalizes formulas by including substitution terms is used to represent proofs in classical logic. These structures, called expansion trees, can be most easily understood as describing a tautologous substitution instance of a theorem. They also provide a computationally useful representation of classical proofs as first-class values. As values they are compact and can easily be manipulated and transformed. For example, we present an explicit transformations between expansion tree proofs and cut-free sequential proofs. A theorem prover which represents (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • (1 other version)Eliminating definitions and Skolem functions in first-order logic.Jeremy Avigad - unknown
    When working with a first-order theory, it is often convenient to use definitions. That is, if ϕ(x) is a first-order formula with the free variables shown, one can introduce a new relation symbol R to abbreviate ϕ, with defining axiom ∀x (R(x) ↔ ϕ(x)). Of course, this definition can later be eliminated from a proof, simply by replacing every instance of R by ϕ. But suppose the proof involves nested definitions, with a sequence of relation symbols R0, . . . (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations