Switch to: References

Add citations

You must login to add citations.
  1. Typed Lambda Calculus.Henk P. Barendregt, Wil Dekkers & Richard Statman - 1977 - In Jon Barwise & H. Jerome Keisler (eds.), Handbook of Mathematical Logic. North-Holland Pub. Co.. pp. 1091--1132.
  • Consistency of a $\lambda$ -Theory with $N$ -Tuples and Easy Term.Ying Jiang - 1995 - Archive for Mathematical Logic 34 (2):79-96.
    We give here a model-theoretical solution to the problem, raised by J.L: Krivine, of the consistency of λβη+U(G)+Ω=t, wheret is an arbitrary λ-term,G an arbitrary finite group of order, sayn, andU(G) the theory which expresses the existence of a surjectiven-tuple notion, such that each element ofG behaves simultaneously as a permutation of the components of then-tuple and as an automorphism of the model. This provides in particular a semantic proof of the βη-easiness of the λ-term Ω.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Retracts of Numerations.Akira Kanda - 1989 - Annals of Pure and Applied Logic 42 (3):225-242.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Representation and Duality of the Untyped Λ-Calculus in Nominal Lattice and Topological Semantics, with a Proof of Topological Completeness.Murdoch J. Gabbay & Michael Gabbay - 2017 - Annals of Pure and Applied Logic 168 (3):501-621.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  • The Analytic Conception of Truth and the Foundations of Arithmetic.Peter Apostoli - 2000 - Journal of Symbolic Logic 65 (1):33-102.