Finite type structures within combinatory algebras

Annals of Pure and Applied Logic 55 (2):101-123 (1991)
  Copy   BIBTEX

Abstract

Inside a combinatory algebra, there are ‘internal’ versions of the finite type structure over ω, which form models of various systems of finite type arithmetic. This paper compares internal representations of the intensional and extensional functionals. If these classes coincide, the algebra is called ft-extensional. Some criteria for ft-extensionality are given and a number of well-known ca's are shown to be ft-extensional, regardless of the particular choice of representation for ω. In particular, DA, Pω, Tω, Hω and certain D∞-models all share the property of ft-extensionality. It is also shown that ft-extensionality is by no means an intrinsic property of ca's i.e., that there exists a very concrete class of ca's—the class of reflexive coherence spaces—no member of which has this property. This leads to a comparison of ft-extensionality with the well-studied notions of extensionality and weak extensionality. Ft-extensionality turns out to be completely independent

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

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

EM + Ext− + ACint is equivalent to ACext.Jesper Carlström - 2004 - Mathematical Logic Quarterly 50 (3):236-240.
EM + Ext_ + AC~i~n~t is equivalent to AC~e~x~t.Jesper Carlström - 2004 - Mathematical Logic Quarterly 50 (3):236.
A note on Spector's quantifier-free rule of extensionality.Ulrich Kohlenbach - 2001 - Archive for Mathematical Logic 40 (2):89-92.
On Quantification and Extensionality.Kai F. Wehmeier - 2024 - Review of Symbolic Logic 17 (2):343-365.
Extensionality of Proper Part Containment.Shieva Kleinschmidt - 2017 - Philosophical Quarterly 67 (269):835-844.
On uniform weak König's lemma.Ulrich Kohlenbach - 2002 - Annals of Pure and Applied Logic 114 (1-3):103-116.
Extensionality Versus Constructivity.Silvio Valentini - 2002 - Mathematical Logic Quarterly 48 (2):179-187.

Analytics

Added to PP
2014-01-16

Downloads
20 (#760,329)

6 months
9 (#436,380)

Historical graph of downloads
How can I increase my downloads?

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 - 1981 - New York, N.Y.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co..
Models of the Lambda Calculus.Giuseppe Longo - 1987 - Journal of Symbolic Logic 52 (1):284-285.
Reducibilities in two models for combinatory logic.Luis E. Sanchis - 1979 - Journal of Symbolic Logic 44 (2):221-234.

Add more references