David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Symbolic Logic 35 (3):401-409 (1970)
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
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Giuseppa Longo (1976). On the Problem of Deciding Equality in Partial Combinatory Algebras and in a Formal System. Studia Logica 35 (4):363 - 375.
Similar books and articles
Eric Gerhardt Wagner (1963). Uniformly Reflexive Structures: Towards an Abstract Theory of Computability. S.N.].
Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight & Robert I. Soare (2004). Bounding Prime Models. Journal of Symbolic Logic 69 (4):1117 - 1142.
John T. Baldwin & Kitty Holland (2000). Constructing Ω-Stable Structures: Rank 2 Fields. Journal of Symbolic Logic 65 (1):371-391.
Bruno Scarpellini (2003). Comments on `Two Undecidable Problems of Analysis'. Minds and Machines 13 (1):79-85.
Nigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.
Michael Rathjen (1992). A Proof-Theoretic Characterization of the Primitive Recursive Set Functions. Journal of Symbolic Logic 57 (3):954-969.
M. Randall Holmes (1995). The Equivalence of NF-Style Set Theories with "Tangled" Theories; the Construction of Ω-Models of Predicative NF (and More). Journal of Symbolic Logic 60 (1):178-190.
T. A. Slaman (1986). ∑1 Definitions with Parameters. Journal of Symbolic Logic 51 (2):453 - 461.
Added to index2009-01-28
Total downloads5 ( #264,553 of 1,692,205 )
Recent downloads (6 months)1 ( #184,284 of 1,692,205 )
How can I increase my downloads?