Cristopher John Ash 1945-1995
暂无分享,去创建一个
[1] R. Shore. The recursively enumerable α-degrees are dense , 1976 .
[2] Rodney G. Downey,et al. Decidable subspaces and recursively enumerable subspaces , 1984, Journal of Symbolic Logic.
[3] John J. Thurber,et al. Recursive and r.e. quotient Boolean algebras , 1994, Arch. Math. Log..
[4] Jeffrey B. Remmel,et al. Quasi-Simple Relations in Copies of a Given Recursive Structure , 1997, Ann. Pure Appl. Log..
[5] C. Ash. On countablen-valued post algebras , 1972 .
[6] Valentina S. Harizanov. Some Effects of Ash-Nerode and Other Decidability Conditions on Degree Spectra , 1991, Ann. Pure Appl. Log..
[7] Christopher J. Ash. A Construction for Recursive Linear Orderings , 1991, J. Symb. Log..
[8] P. J. Cohen. Set Theory and the Continuum Hypothesis , 1966 .
[9] Saharon Shelah. End Extensions and Numbers of Countable Models , 1978, J. Symb. Log..
[10] A. Seidenberg. A NEW DECISION METHOD FOR ELEMENTARY ALGEBRA , 1954 .
[11] R. Friedberg,et al. TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944). , 1957, Proceedings of the National Academy of Sciences of the United States of America.
[12] T. E. Hall,et al. Finite semigroups with commuting idempotents , 1987, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.
[13] Bjarni Jónsson,et al. Homogeneous Universal Relational Systems. , 1960 .
[14] L. Duysens. Preprints , 1966, Nature.
[15] Model - Theoretic Forms of the Axiom of Choice , 1983 .
[16] The partially ordered set of allJ-classes of a finite semigroup , 1973 .
[17] Manuel Lerman,et al. A General Framework for Priority Arguments , 1995, Bulletin of Symbolic Logic.
[18] Alan D. Vlach. Hyperarithmetical Relations in Expansions of Recursive Structures , 1994, Ann. Pure Appl. Log..
[19] Julia F. Knight,et al. Generic Copies of Countable Structures , 1989, Ann. Pure Appl. Log..
[20] Karsten Henckell,et al. Ash's Type II Theorem, Profinite Topology and Malcev Products: Part I , 1991, Int. J. Algebra Comput..
[21] J. R. Shoenfield. Undecidable and creative theories , 1961 .
[22] Christopher J. Ash. On Countable Fractions from an Elementary Class , 1994, J. Symb. Log..
[23] Julia Robinson,et al. Definability and decision problems in arithmetic , 1949, Journal of Symbolic Logic.
[24] M. Rabin. Decidability of second-order theories and automata on infinite trees , 1968 .
[25] Christopher J. Ash,et al. Recursive Structures and Ershov's Hierarchy , 1996, Math. Log. Q..
[26] Christopher J. Ash,et al. Labelling Systems and r.e. Structures , 1990, Ann. Pure Appl. Log..
[27] Christopher J. Ash,et al. A Conjecture Concerning the Spectrum of a Sentence , 1994, Math. Log. Q..
[28] Julia F. Knight,et al. A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas , 1994, Math. Log. Q..
[29] John W. Rosenthal,et al. Some Theories Associated with Algebraically Closed Fields , 1980, J. Symb. Log..
[30] C. J. Ash,et al. Persistently finite, persistently arithmetic theories , 1983 .
[31] Functorial properties of algebraic closure and Skolemization , 1981 .
[32] C. J Ash. Pseudovarieties, generalized varieties and similarly described classes , 1985 .
[33] The lattice of ideals of a semigroup , 1980 .
[34] David Marker. Degrees of Models of True Arithmetic , 1982 .
[35] Manuel Lerman,et al. Priority arguments using iterated trees of strategies , 1990 .
[36] Geoffrey R. Hird. Recursive Properties of Relations on Models , 1993, Ann. Pure Appl. Log..
[37] Julia F. Knight,et al. Possible Degrees in Recursive Copies II , 1997, Ann. Pure Appl. Log..
[38] G. Higman,et al. Embedding Theorems for Groups , 1949 .
[39] N. R. REILLYf. CONGRUENCE-FREE INVERSE SEMIGROUPS , 1974 .
[40] John Love. Stability among r.e. Quotient Algebras , 1993, Ann. Pure Appl. Log..
[41] S. S. Goncharov,et al. Autostability and computable families of constructivizations , 1975 .
[42] M. Morley. Categoricity in power , 1965 .
[43] Theodore A. Slaman,et al. Relatively recursive expansions II , 1992 .
[44] G. Birkhoff,et al. On the Structure of Abstract Algebras , 1935 .
[45] Richard Watnick. Constructive and recursive scattered order types , 1981 .
[46] S. Kleene. On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper) , 1955 .
[47] Kevin J. Davey. Inseparability in Recursive Copies , 1994, Ann. Pure Appl. Log..
[48] W. Markwald. Zur Theorie der konstruktiven Wohlordnungen , 1954 .
[49] Julia A. Knight. Effective Construction of Models , 1986 .
[50] Christopher J. Ash. Generalizations of Enumeration Reducibility Using Recursive Infinitary Propositional Sentences , 1992, Ann. Pure Appl. Log..
[51] John L. Bell,et al. Models and Ultraproducts: An Introduction. , 1969 .
[52] Erwin Engeler,et al. Languages with expressions of infinite length , 1966 .
[53] Christopher J. Ash. Stability of recursive structures in arithmetical degrees , 1986, Ann. Pure Appl. Log..
[54] John Chisholm,et al. Effective model theory vs. recursive model theory , 1990, Journal of Symbolic Logic.
[55] A. Tarski. A Decision Method for Elementary Algebra and Geometry , 2023 .
[56] R. Vaught,et al. Homogeneous Universal Models , 1962 .
[57] Christopher J. Ash,et al. Inevitable Graphs: a Proof of the Type II Conjecture and some Related Decision Procedures , 1991, Int. J. Algebra Comput..
[58] Kelleen R. Hurlburt. Sufficiency Conditions for Theories with Recursive Models , 1992, Ann. Pure Appl. Log..
[59] Uniform labelled semilattices , 1979 .
[60] Jean-Éric Pin,et al. On the Varieties of Languages Associated with Some Varieties of Finite Monoids with Commuting Idempotents , 1990, Inf. Comput..
[61] John W. Rosenthal,et al. Intersections of algebraically closed fields , 1986, Ann. Pure Appl. Log..
[62] Lawrence Feiner,et al. Hierarchies of Boolean algebras , 1970, Journal of Symbolic Logic.
[63] 阿部 浩一,et al. Fundamenta Mathematicae私抄 : 退任の辞に代えて , 1987 .