Characterizations for Computable Structures

Characterizations for Computable Structures (2000)

Cached

Download Links

[www.math.cornell.edu]

by Walker McMillan White

Venue:	CORNELL UNIVERSITY
Citations:	4 - 0 self

BibTeX

@TECHREPORT{White00characterizationsfor,
    author = {Walker McMillan White},
    title = {Characterizations for Computable Structures},
    institution = {CORNELL UNIVERSITY},
    year = {2000}
}

Bookmark

OpenURL

Abstract

Citations

411	Recursively Enumerable Sets and Degrees - Soare - 1987
160	Classification theory and the number of non-isomorphic models - Shelah - 1978
146	Applications of games to the completeness problem for formalized theories - Ehrenfeucht - 1961
86	Higher recursion theory - Sacks - 1990
51	The independence of the continuum hypothesis - Cohen - 1963
49	Complete Theories - Robinson - 1956
42	A Borel reducibility theory for classes of countable structures - Friedman, Stanley
38	Computable structures and the hyperarithmetical hierarchy - Ash, Knight
30	The completeness of the first-order functional calculus - Henkin - 1949
26	Recursively Presentable Prime Models - Harrington - 1974
26	Building models by games - Hodges - 1985
25	Zum entscheidungsproblem der mathematischen logik - Bernays, Schonfinkel - 1928
21	Computable Isomorphisms, Degree Spectra of Relations and Scott Families, Annals of Pure and Applied Logic 93 - Khoussainov, Shore - 1998
19	Foundations of recursive model theory - Millar - 1978
15	Complexity of quantifier elimination in the theory of algebraically closed fields - Chistov, Grigor'ev - 1984
15	Descriptive set theory and the structure of sets of uniqueness - Kechris, Louveau - 1987
14	Recursive pseudo well-orderings - Harrison
14	Arithmetical predicates and function quantifiers - Kleene - 1955
13	Intrisically recursive relations, Aspects of Effective Algebra - Ash, Nerode - 1981
13	Autostability and computable families of constructivations, Algebra and Logic 14 - Goncharov - 1975
11	An autostable 1-decidable model without a computable Scott family of 9-formulas, Algebra and Logic 35 - Kudinov - 1996
10	Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees - Ash - 1986
10	Pure computable model theory, Handbook of Recursive Mathematics - Harizanov - 1999
10	Homogeneous universal models - Morley, Vaught - 1962
6	Denumerable models of complete theories, Infinitistic methods - Vaught - 1961
5	Completing theories by forcing - Barwise, Robinson - 1970
4	Elementary theories and their constructive models, Handbook of Recursive Mathematics - Ershov, Goncharov - 1999
4	Nurtazin, Constructive models of complete solvable theories, Algebra and Logic 12 - Goncharov, T - 1973
3	Nonstandard models and independence of the induction axiom - Rabin - 1962
2	Algebraically prime models - Baldwin, Kueker - 1981
2	Die Vollst"andigkeit der Axiome des logischen Funktionenkalk"uls, Monashefte f"ur - Godel - 1930
2	formal unentscheidbare S"atze der Principia Mathemtaica und verwandter System I, Monashefte f"ur - Uber - 1931
2	Forcing and the omitting types theorem, Studies in Model Theory - Keisler - 1973
2	On model-completeness, Theoria 30 - Lindstrom - 1964
2	Finitely axiomatizable theories, Siberian School of Algebra and Logic - Peretyat'kin - 1997
1	Uber rekursive strukturen, Inventiones math - Baur - 1974
1	Omitting types: application ot recursion theory - Grilliot - 1972
1	Definability and fast qauntifier elimination in algebraically closed fields - Heintz - 1983
1	Degree spectra of computable structures - Hirschfeldt - 1999
1	theory, Encyclopedia of Math - Model - 1993
1	Universal relational systems - J'onnson - 1956
1	Mod`ele universel d'une th'eorie n-compl`ete - Pouzet - 1972
1	Algebraische theorie der k"orper - Steinitz - 1910