Skip to main content
SpringerLink
Log in

Consistency of a λ-theory withn-tuples and easy term

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

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 Ω.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Baeten, J., Boerboom, B.: Ω can be anything it should not be. Indag. Math.41, 111–120 (1979)

    Google Scholar 

  2. Barendregt, H.P.: Pairing without conventional restraints. Z. Math. Logik Grundlag. Math20, 289–306 (1974)

    Google Scholar 

  3. Barendregt, H.P.: The lambda-calculus, its syntax and semantics. Stud. Logic Found. Math. vol. 103, revised ed. Amsterdam: North Holland 1984

    Google Scholar 

  4. Intrigila, B.: A problem on easy terms in Λ-calculus. Fund. Inform.15, 99–106 (1991)

    Google Scholar 

  5. Jacopini, G.: A condition for identifying two elements of whatever model of combinatory logic. In: Böhm, C. (ed.) Λ-calculus and computer science theory (Lect. Notes. Comput. Sci., vol. 37, pp. 213–219). Berlin Heidelberg New York: Springer 1975

    Google Scholar 

  6. Jacopini, G., Venturini-Zilli, M.: Easy terms in the Λ-calculus. Fund. Inform.8, 225–233 (Ann. Soc. Math. Pol., Ser. 4) (1985)

    Google Scholar 

  7. Jiang, Y.: Consistance et inconsistance de théories de lambda-calculs étendus — via l'étude des modèles de Scott et des modèles cohérents. Ph. D. Thesis (1993)

  8. Klop, J.W.: Combinatory reduction systems, doctoral dissertation, Rijksuniversiteit te Utrecht (1980)

  9. Krivine, J.L.: Lambda-calculus, types and models. Hermel Hempstead: Ellis Horwood 1993

    Google Scholar 

  10. Pottinger, G.: The Church-Rosser theorem for the type λ-calculus with surjective pairing. Notre Dame J. Formal Log.22, 264–268 (1981)

    Google Scholar 

  11. Zylberajch, C.: Syntaxe et sémantique de la facilité en λ-calcul. Ph. D. Thesis (1991)

Download references

Author information

Author notes

  1. Ying Jiang

    Present address: Institute of Software, Academia Sinica, P.O. Box 8718, Beijing, People's Republic of China

Authors and Affiliations

  1. Equipe de Logique Mathématique, Université Paris VII, U.F.R. de Mathématiques, 2 place Jussieu, F-75251, Paris Cedex 05, France

    Ying Jiang

Authors
  1. Ying Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jiang, Y. Consistency of a λ-theory withn-tuples and easy term. Arch Math Logic 34, 79–96 (1995). https://doi.org/10.1007/BF01270389

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01270389

Keywords

Search

Navigation