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)|
References found in this work BETA
No references found.
Citations of this work BETA
On the Problem of Deciding Equality in Partial Combinatory Algebras and in a Formal System.Giuseppa Longo - 1976 - Studia Logica 35 (4):363 - 375.
Similar books and articles
Computable Structures and the Hyperarithmetical Hierarchy.C. J. Ash - 2000 - Elsevier.
The Equivalence of NF-Style Set Theories with "Tangled" Theories; the Construction of Ω-Models of Predicative NF (and More).M. Randall Holmes - 1995 - Journal of Symbolic Logic 60 (1):178-190.
A Proof-Theoretic Characterization of the Primitive Recursive Set Functions.Michael Rathjen - 1992 - Journal of Symbolic Logic 57 (3):954-969.
Computability, an Introduction to Recursive Function Theory.Nigel Cutland - 1980 - Cambridge University Press.
Comments on `Two Undecidable Problems of Analysis'.Bruno Scarpellini - 2003 - Minds and Machines 13 (1):79-85.
Constructing Ω-Stable Structures: Rank 2 Fields.John T. Baldwin & Kitty Holland - 2000 - Journal of Symbolic Logic 65 (1):371-391.
Bounding Prime Models.Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight & Robert I. Soare - 2004 - Journal of Symbolic Logic 69 (4):1117 - 1142.
Uniformly Reflexive Structures: Towards an Abstract Theory of Computability.Eric Gerhardt Wagner - 1963 - [S.N.].
A Proof of Completeness for Continuous First-Order Logic.Arthur Paul Pedersen & Itai Ben Yaacov - unknown
Added to index2009-01-28
Total downloads12 ( #380,702 of 2,177,988 )
Recent downloads (6 months)1 ( #317,698 of 2,177,988 )
How can I increase my downloads?