Orbits of creative subspaces

Downey, R. G.

doi:10.1090/S0002-9939-1987-0866455-7

Orbits of creative subspaces
HTML articles powered by AMS MathViewer

by R. G. Downey PDF

Proc. Amer. Math. Soc. 99 (1987), 163-170 Request permission

Abstract:

It is shown that the creative r.e. subspaces fall into infinitely many distinct elementary classes. The techniques also extend to give some new results about orbits of creative subspaces and subfields in ${L^*}({V_\infty })$ and ${L^*}({F_\infty })$ respectively. Finally within each of these new elementary classes we construct infinitely many further orbits in the automorphism group of $L({V_\infty })$.

References

C. J. Ash and R. G. Downey, Decidable subspaces and recursively enumerable subspaces, J. Symbolic Logic 49 (1984), no. 4, 1137–1145. MR 771782, DOI 10.2307/2274266
John T. Baldwin, First-order theories of abstract dependence relations, Ann. Pure Appl. Logic 26 (1984), no. 3, 215–243. MR 747685, DOI 10.1016/0168-0072(84)90004-6
R. G. Downey, Bases of supermaximal subspaces and Steinitz systems. II, Z. Math. Logik Grundlag. Math. 32 (1986), no. 3, 203–210. MR 847235, DOI 10.1002/malq.19860321304
R. G. Downey and G. R. Hird, Automorphisms of supermaximal subspaces, J. Symbolic Logic 50 (1985), no. 1, 1–9. MR 780519, DOI 10.2307/2273783
David R. Guichard, Automorphisms of substructure lattices in recursive algebra, Ann. Pure Appl. Logic 25 (1983), no. 1, 47–58. MR 722168, DOI 10.1016/0168-0072(83)90053-2
Iraj Kalantari and Allen Retzlaff, Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces, J. Symbolic Logic 42 (1977), no. 4, 481–491. MR 505385, DOI 10.2307/2271869
G. Metakides and A. Nerode, Recursively enumerable vector spaces, Ann. Math. Logic 11 (1977), no. 2, 147–171. MR 446936, DOI 10.1016/0003-4843(77)90015-8
G. Metakides and A. Nerode, Recursion theory on fields and abstract dependence, J. Algebra 65 (1980), no. 1, 36–59. MR 578794, DOI 10.1016/0021-8693(80)90237-9
John Myhill, Creative sets, Z. Math. Logik Grundlagen Math. 1 (1955), 97–108. MR 71379, DOI 10.1002/malq.19550010205
A. Nerode and J. Remmel, Recursion theory on matroids, Patras Logic Symposion (Patras, 1980) Stud. Logic Found. Math., vol. 109, North-Holland, Amsterdam, 1982, pp. 41–65. MR 694252, DOI 10.1016/S0049-237X(08)71356-9
Chi Tat Chong and Malcolm John Wicks (eds.), Southeast Asian conference on logic, Studies in Logic and the Foundations of Mathematics, vol. 111, North-Holland Publishing Co., Amsterdam-New York, 1983. MR 723328
A. Nerode and J. Remmel, A survey of lattices of r.e. substructures, Recursion theory (Ithaca, N.Y., 1982) Proc. Sympos. Pure Math., vol. 42, Amer. Math. Soc., Providence, RI, 1985, pp. 323–375. MR 791067, DOI 10.1090/pspum/042/791067
Robert I. Soare, Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1987. A study of computable functions and computably generated sets. MR 882921, DOI 10.1007/978-3-662-02460-7