Movatterモバイル変換


[0]ホーム

URL:


PhilPapersPhilPeoplePhilArchivePhilEventsPhilJobs

Consistency of a $\lambda$ -theory with $n$ -tuples and easy term

Archive for Mathematical Logic 34 (2):79-96 (1995)
  Copy   BIBTEX

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 Ω

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-11-23

Downloads
40 (#625,976)

6 months
1 (#1,599,047)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

The lambda calculus: its syntax and semantics.Hendrik Pieter Barendregt -1984 - New York, N.Y.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co..
Pairing Without Conventional Restraints.Henk Barendregt -1974 -Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (19-22):289-306.

Add more references


[8]ページ先頭

©2009-2025 Movatter.jp