论文信息 - Undecidability of L(F∞) and other lattices of r.e. substructures

Undecidability of L(F∞) and other lattices of r.e. substructures

Etude du treillis L(M) des sous-structures recursivement enumerables d'un modele effectif M. Indecidabilite des theories du premier ordre d'une classe etendue de tels treillis

Rodney G. Downey

[1] A. Nerode,et al. Recursion Theory on Fields and Abstract Dependence , 1980 .

[2] A. Nerode,et al. Recursion Theory on Matroids II , 1983 .

[3] Lawrence Feiner,et al. Hierarchies of Boolean algebras , 1970, Journal of Symbolic Logic.

[4] A. Nerode,et al. Recursion theory and algebra , 1975 .

[5] R. W. Robinson,et al. Monotone and 1–1 sets , 1982 .

[6] Rod Downey. On a Question of a. Retzlaff , 1983, Math. Log. Q..

[7] W. Magnus,et al. Combinatorial Group Theory: COMBINATORIAL GROUP THEORY , 1967 .

[8] John T. Baldwin,et al. First-order theories of abstract dependence relations , 1984, Ann. Pure Appl. Log..

[9] J. Remmel. Recursion theory on algebraic structures with independent sets , 1980 .

[10] A. Nerode,et al. Recursively enumerable vector spaces , 1977 .

[11] Rodney G. Downey,et al. Decidable subspaces and recursively enumerable subspaces , 1984, Journal of Symbolic Logic.

[12] Rodney G. Downey. Some Remarks on a Theorem of Iraj Kalantari Concerning convexity and Recursion Theory , 1984, Math. Log. Q..

[13] J. Remmel. Recursively enumerable Boolean algebras , 1978 .