Co-hypersimple structures

Journal of Symbolic Logic 41 (3):611-625 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272039

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,612

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: J. C. E. Dekker, A Theorem on Hypersimple Sets. [REVIEW]Norman Shapiro - 1956 - Journal of Symbolic Logic 21 (1):100-100.
Splittings of effectively speedable sets and effectively levelable sets.Roland S. H. Omanadze - 2004 - Journal of Symbolic Logic 69 (1):143-158.
The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees.George Barmpalias & Andrew E. M. Lewis - 2006 - Notre Dame Journal of Formal Logic 47 (3):361-370.
G. Metakides and A. Nerode. Recursion theory and algebra. Algebra and logic, Papers from the 1974 Summer Research Institute of the Australian Mathematical Society, Monash University, Australia, edited by J. N. Crossley, Lecture notes in mathematics, vol. 450, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 209–219. - Iraj Kalantari and Allen Retzlaff. Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces. The journal of symbolic logic, vol. 42 no. 4 , pp. 481–491. - Iraj Kalantari. Major subspaces of recursively enumerable vector spaces. The journal of symbolic logic, vol. 43 , pp. 293–303. - J. Remmel. A r-maximal vector space not contained in any maximal vector space. The journal of symbolic logic, vol. 43 , pp. 430–441. - Allen Retzlaff. Simple and hyperhypersimple vector spaces. The journal of symbolic logic, vol. 43 , pp. 260–269. - J. B. Remmel. Maximal and cohesive vector spaces. The journal of symbolic logic, vol. 42 no. 3. [REVIEW]Henry A. Kierstead - 1986 - Journal of Symbolic Logic 51 (1):229-232.
A Theorem on Hypersimple Sets.J. C. E. Dekker - 1956 - Journal of Symbolic Logic 21 (1):100-100.
Post's Problem and His Hypersimple Set.Carl G. Jockusch & Robert I. Soare - 1973 - Journal of Symbolic Logic 38 (3):446 - 452.
Donald A. Martin. A theorem on hyper hypersimple sets. The journal of symbolic logic, vol. 28 no. 4 , pp. 273–278.Marian Boykan Pour-El - 1966 - Journal of Symbolic Logic 31 (1):139-139.
S. S. Goncharov. Autostability and computable families of constructivizations. Algebra and Logic, vol. 14 (1975), no. 6, pp. 392–409. - S. S. Goncharov. The quantity of nonautoequivalent constructivizations. Algebra and Logic, vol. 16 (1977), no. 3, pp. 169–185. - S. S. Goncharov and V. D. Dzgoev. Autostability of models. Algebra and Logic, vol. 19 (1980), no. 1, pp. 28–37. - J. B. Remmel. Recursively categorical linear orderings. Proceedings of the American Mathematical Society, vol. 83 (1981), no. 2, pp. 387–391. - Terrence Millar. Recursive categoricity and persistence. The Journal of Symbolic Logic, vol. 51 (1986), no. 2, pp. 430–434. - Peter Cholak, Segey Goncharov, Bakhadyr Khoussainov and Richard A. Shore. Computably categorical structures and expansions by constants. The Journal of Symbolic Logic, vol. 64 (1999), no. 1, pp. 13–137. - Peter Cholak, Richard A. Shore and Reed Solomon. A computably stable structure with no Scott family of finitary formulas. Archive for Mathematical. [REVIEW]Daniel Turetsky - 2012 - Bulletin of Symbolic Logic 18 (1):131-134.
O'Donnell, MJ, see Lipton, J. 187-239 Remmel, JB, see Nerode, A. 125-170.S. Feferman - 1996 - Annals of Pure and Applied Logic 81:241.
S. S. Goncharov. Autostability and computable families of constructivizations. Algebra and Logic, vol. 14 , no. 6, pp. 392–409. - S. S. Goncharov. The quantity of nonautoequivalent constructivizations. Algebra and Logic, vol. 16 , no. 3, pp. 169–185. - S. S. Goncharov and V. D. Dzgoev. Autostability of models. Algebra and Logic, vol. 19 , no. 1, pp. 28–37. - J. B. Remmel. Recursively categorical linear orderings. Proceedings of the American Mathematical Society, vol. 83 , no. 2, pp. 387–391. - Terrence Millar. Recursive categoricity and persistence. The Journal of Symbolic Logic, vol. 51 , no. 2, pp. 430–434. - Peter Cholak, Segey Goncharov, Bakhadyr Khoussainov and Richard A. Shore. Computably categorical structures and expansions by constants. The Journal of Symbolic Logic, vol. 64 , no. 1, pp. 13–137. - Peter Cholak, Richard A. Shore and Reed Solomon. A computably stable structure with no Scott family of finitary formulas. Archive for Mathematical Logic, vol. 45 , no. 5, pp. 519–538. [REVIEW]Daniel Turetsky - 2012 - Bulletin of Symbolic Logic 18 (1):131-134.

Analytics

Added to PP
2009-01-28

Downloads
25 (#150,191)

6 months
11 (#1,140,922)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Recursion theory on algebraic structures with independent sets.J. B. Remmel - 1980 - Annals of Mathematical Logic 18 (2):153.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references