Chapter 2 Elementary theories and their constructive models
暂无分享,去创建一个
[1] P. Halmos. Lectures on Boolean Algebras , 1963 .
[2] M. G. Peretyat'kin. On complete theories with a finite number of denumerable models , 1973 .
[3] V. D. Dzgoev. Constructive enumeration of Boolean lattices , 1988 .
[4] Jeffrey B. Remmel,et al. R-maximal Boolean algebras , 1979, Journal of Symbolic Logic.
[5] S. S. Goncharov,et al. Constructive models of complete solvable theories , 1973 .
[6] S. S. Goncharov,et al. Constructivizability of superatomic Boolean algebras , 1973 .
[7] Rodney G. Downey. Every Recursive Boolean Algebra is Isomorphic to One with Incomplete Atoms , 1993, Ann. Pure Appl. Log..
[8] A. I. Mal'tsev. CONSTRUCTIVE ALGEBRAS I , 1961 .
[9] A. Nerode,et al. Recursion theory and algebra , 1975 .
[10] Jeffrey B. Remmel. Recursively categorical linear orderings , 1981 .
[11] Robert C. Reed. A Decidable Ehrenfeucht Theory with Exactly Two Hyperarithmetic Models , 1991, Ann. Pure Appl. Log..
[12] Benjamin Franklin Wells,et al. The Mathematics of Algebraic Systems, Collected Papers 1936-1967 , 1975 .
[13] V. Dzgoev. Constructive Boolean algebras , 1988 .
[14] S. S. Goncharov. Restricted theories of constructive Boolean algebras , 1976 .
[15] S. S. Goncharov,et al. A totally transcendental decidable theory without constructivizable homogeneous models , 1980 .
[16] Jeffrey B. Remmel,et al. Recursive Boolean algebras with recursive atoms , 1981, Journal of Symbolic Logic.
[17] J. Remmel. Recursively enumerable Boolean algebras , 1978 .
[18] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[19] Ю.Л. Ершов,et al. Разрешимость элементарной теории дистрибутивных структур с относительными дополнениями и теории фильтров , 1964 .
[20] Countable homogeneous Boolean algebras , 1982 .
[21] Jeffrey B. Remmel,et al. Recursive isomorphism types of recursive Boolean algebras , 1981, Journal of Symbolic Logic.
[23] A. T. Nurtazin,et al. Strong and weak constructivization and computable families , 1974 .
[24] J. B. Remmel,et al. Complementation in the lattice of subalgebras of a Boolean algebra , 1980 .
[25] Haskell B. Curry,et al. Foundations of Mathematical Logic , 1964 .
[26] Michael Moses. Recursive linear orders with recursive successivities , 1984, Ann. Pure Appl. Log..
[27] Chen C. Chang,et al. Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .
[28] S. S. Goncharov,et al. Autostability of models , 1980 .
[29] S. S. Goncharov. Computable classes of constructivizations for models of finite computability type , 1993 .
[30] Jeffrey B. Remmel. Recursively rigid Boolean algebras , 1987, Ann. Pure Appl. Log..
[31] B. N. Drobotun. Enumerations of simple models , 1977 .
[32] S. S. Goncharov. Strong constructivizability of homogeneous models , 1978 .
[33] S. S. Goncharov. Totally transcendental theory with a nonconstructivizable prime model , 1980 .
[34] V. L. Selivanov,et al. Arithmetic Hierarchy and ideals of enumerated Boolean algebras , 1989 .
[35] Donald A. Martin,et al. Axiomatizable Theories with Few Axiomatizable Extensions , 1970, J. Symb. Log..
[36] M. Stone. The theory of representations for Boolean algebras , 1936 .
[37] John J. Thurber,et al. Recursive and r.e. quotient Boolean algebras , 1994, Arch. Math. Log..
[38] Peter Hilton,et al. Introduction to the Theory of Categories and Functors , 1968 .
[40] Leo Harrington. Recursively Presentable Prime Models , 1974, J. Symb. Log..
[41] Leo F. Boron,et al. Algorithms and recursive functions , 1970 .
[42] R. Goodstein. Boolean algebra , 1963 .
[43] С.С. Гончаров,et al. Конструктивные модели полных разрешимых теорий. , 1973 .
[44] J. Remmel. Recursion theory on algebraic structures with independent sets , 1980 .
[45] Robert I. Soare,et al. Recursively enumerable sets and degrees - a study of computable functions and computability generated sets , 1987, Perspectives in mathematical logic.
[46] Hans Dobbertin,et al. On Vaught's criterion for isomorphisms of countable Boolean algebras , 1982 .
[47] Terrence Millar. Foundations of recursive model theory , 1978 .
[48] Sabine Koppelberg,et al. Handbook of Boolean Algebras , 1989 .
[49] A. S. Morozov,et al. Strong constructivizability of countable saturated Boolean algebras , 1982 .
[50] M. G. Peretyat'kin. Strongly constructive models and numerations of the Boolean algebra of recursive sets , 1971 .
[51] Effective Isomorphisms of Algebraic Structures , 1982 .
[52] M. G. Peretyat'kin. Criterion for strong constructivizability of a homogeneous model , 1978 .
[53] S. Odintsov. Lattice of recursively enumerable subalgebras of a recursive boolean algebra , 1986 .
[54] S. Goncharov. Non-self-equivalent constructivization of atomic Boolean algebras , 1976 .
[55] S. S. Goncharov,et al. Autostability and computable families of constructivizations , 1975 .
[56] S. S. Goncharov,et al. Some properties of the constructivization of Boolean algebras , 1975 .
[57] M. G. Peretyat'kin. Turing machine computations in finitely axiomatizable theories , 1982 .
[58] G. Day,et al. Superatomic Boolean algebras , 1967 .
[59] S. S. Goncharov,et al. Numerations of saturated and homogeneous models , 1980 .
[60] Carl G. Jockusch,et al. Every low Boolean algebra is isomorphic to a recursive one , 1994 .
[61] S. S. Goncharov. Effectively infinite classes of weak constructivizations of models , 1993 .
[62] A. Nerode,et al. Recursively enumerable vector spaces , 1977 .