Switch to: Citations

Add references

You must login to add references.
  1. Propositional and predicate calculuses based on combinatory logic.M. W. Bunder - 1974 - Notre Dame Journal of Formal Logic 15 (1):25-34.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • (2 other versions)The Lambda Calculus. Its Syntax and Semantics.E. Engeler - 1984 - Journal of Symbolic Logic 49 (1):301-303.
    Download  
     
    Export citation  
     
    Bookmark   72 citations  
  • Introduction to Combinators and λ-Calculus.J. Roger Hindley & Jonathan P. Seldin - 1988 - Journal of Symbolic Logic 53 (3):985-986.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • A deduction theorem for restricted generality.M. W. Bunder - 1973 - Notre Dame Journal of Formal Logic 14 (3):341-346.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)The Calculi of Lambda-Conversion.Barkley Rosser - 1941 - Journal of Symbolic Logic 6 (4):171-171.
    Download  
     
    Export citation  
     
    Bookmark   56 citations  
  • (1 other version)Set Theory based on Combinatory Logic.Jonathan P. Seldin & Maarten Wicher Visser Bunder - 1970 - Journal of Symbolic Logic 35 (1):147.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Predicate calculus of arbitrarily high finite order.M. W. Bunder - 1983 - Archive for Mathematical Logic 23 (1):1-10.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A one axiom set theory based on higher order predicate calculus.M. W. Bunder - 1983 - Archive for Mathematical Logic 23 (1):99-107.
    Download  
     
    Export citation  
     
    Bookmark   3 citations