Journal of Symbolic Logic

Construction of Models for Algebraically Generalized Recursive Function Theory

H. R. Strong

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

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.

Article information

Source
J. Symbolic Logic, Volume 35, Issue 3 (1970), 401-409.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183737264

Mathematical Reviews number (MathSciNet)
MR294128

Zentralblatt MATH identifier
0218.02035

JSTOR
links.jstor.org

Citation

Strong, H. R. Construction of Models for Algebraically Generalized Recursive Function Theory. J. Symbolic Logic 35 (1970), no. 3, 401--409. https://projecteuclid.org/euclid.jsl/1183737264


Export citation