Switch to: Citations

Add references

You must login to add references.
  1. The structure of multiplicatives.Vincent Danos & Laurent Regnier - 1989 - Archive for Mathematical Logic 28 (3):181-203.
    Investigating Girard's new propositionnal calculus which aims at a large scale study of computation, we stumble quickly on that question: What is a multiplicative connective? We give here a detailed answer together with our motivations and expectations.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • The relative efficiency of propositional proof systems.Stephen A. Cook & Robert A. Reckhow - 1979 - Journal of Symbolic Logic 44 (1):36-50.
    Download  
     
    Export citation  
     
    Bookmark   73 citations  
  • Locality for Classical Logic.Kai Brünnler - 2006 - Notre Dame Journal of Formal Logic 47 (4):557-580.
    In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. Unlike sequent systems, they drop the restriction that rules only apply to the main connective of a formula: their rules apply anywhere deeply inside a formula. This allows to observe very clearly the symmetry between identity axiom and the cut rule. This symmetry allows to reduce the cut rule to atomic (...)
    Download  
     
    Export citation  
     
    Bookmark   2 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