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.
Construction of Models for Algebraically Generalized Recursive Function Theory
H. R. Strong
The Journal of Symbolic Logic
Vol. 35, No. 3 (Sep., 1970), pp. 401-409
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/2270697
Page Count: 9
You can always find the topics here!Topics: Recursive functions, Boolean algebras, Algebra, Axioms, Mathematical functions, Eigenfunctions, Mathematical theorems, Natural numbers, Abstract algebraic logic, Communication theory
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 Uniformly Reflexive Structure was introduced by E. G. Wagner who showed that the theory of such structures generalized much of recursive function theory. In this paper Uniformly Reflexive Structures are constructed as factor algebras of Free nonassociative algebras. Wagner's question about the existence of a model with no computable splinter ("successor set") is answered in the affirmative by the construction of a model whose only computable sets are the finite sets and their complements. Finally, for each countable Boolean algebra R of subsets of a countable set which contains the finite subsets, a model is constructed with R as its family of computable sets.
The Journal of Symbolic Logic © 1970 Association for Symbolic Logic