Switch to: Citations

References in:

Proof Theory and Complexity

Synthese 62 (2):173-189 (1985)

Add references

You must login to add references.
  1. Natural deduction: a proof-theoretical study.Dag Prawitz - 1965 - Mineola, N.Y.: Dover Publications.
    This volume examines the notion of an analytic proof as a natural deduction, suggesting that the proof's value may be understood as its normal form--a concept with significant implications to proof-theoretic semantics.
    Download  
     
    Export citation  
     
    Bookmark   349 citations  
  • (1 other version)The formulae-as-types notion of construction.William Alvin Howard - 1980 - In Haskell Curry, Hindley B., Seldin J. Roger & P. Jonathan (eds.), To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism. Academic Press.
    Download  
     
    Export citation  
     
    Bookmark   95 citations  
  • Computers and Intractability. A Guide to the Theory of NP-Completeness.Michael R. Garey & David S. Johnson - 1983 - Journal of Symbolic Logic 48 (2):498-500.
    Download  
     
    Export citation  
     
    Bookmark   223 citations  
  • Zur Deutung der intuitionistischen Logik.A. N. Kolmogorov - 1932 - Mathematische Zeitschrift 35:58-65.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Popular lectures on mathematical logic.Hao Wang - 1981 - New York: Dover Publications.
    Noted logician and philosopher addresses various forms of mathematical logic, discussing both theoretical underpinnings and practical applications. After historical survey, lucid treatment of set theory, model theory, recursion theory and constructivism and proof theory. Place of problems in development of theories of logic, logic’s relationship to computer science, more. Suitable for readers at many levels of mathematical sophistication. 3 appendixes. Bibliography. 1981 edition.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)The correspondence between cut-elimination and normalization.J. Zucker - 1974 - Annals of Mathematical Logic 7 (1):1-112.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Structural Complexity of Proofs.Richard Statman - 1974 - Dissertation, Stanford University
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • The correspondence between cut-elimination and normalization II.J. Zucker - 1974 - Annals of Mathematical Logic 7 (2):113.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Some Classes of Recursive Functions.Andrzej Grzegorczyk - 1955 - Journal of Symbolic Logic 20 (1):71-72.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Bounds for proof-search and speed-up in the predicate calculus.Richard Statman - 1978 - Annals of Mathematical Logic 15 (3):225.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • (1 other version)Proof Theory and Logical Complexity. [REVIEW]Helmut Pfeifer - 1991 - Annals of Pure and Applied Logic 53 (4):197.
    Download  
     
    Export citation  
     
    Bookmark   39 citations