You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
On the Existence of Extensional Partial Combinatory Algebras
The Journal of Symbolic Logic
Vol. 52, No. 3 (Sep., 1987), pp. 819-833
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/2274368
Page Count: 15
You can always find the topics here!Topics: Algebra, Induced substructures, Extensionality, Induction assumption, Partially ordered sets, Applicative theories, Computer algebra systems, Axioms
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
The principal aim of this paper is to present a construction method for nontotal extensional combinatory algebras. This is done in
$\S2$. In $\S0$ we give definitions of some basic notions for partial combinatory algebras from which the corresponding notions for (total) combinatory algebras are obtained as specializations. In $\S1$ we discuss some properties of nontotal extensional combinatory algebras in general. $\S2$ describes a "partial" variant of reflexive complete partial orders yielding nontotal extensional combinatory algebras. Finally, $\S3$ deals with properties of the models constructed in $\S2$, such as incompletability, having no total submodel and the pathological behaviour with respect to the interpretation of unsolvable λ-terms.
The Journal of Symbolic Logic © 1987 Association for Symbolic Logic