Switch to: Citations

Add references

You must login to add references.
  1. A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Wtt-degrees and t-degrees of R.e. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
    We use some simple facts about the wtt-degrees of r.e. sets together with a construction to answer some questions concerning the join and meet operators in the r.e. degrees. The construction is that of an r.e. Turing degree a with just one wtt-degree in a such that a is the join of a minimal pair of r.e. degrees. We hope to illustrate the usefulness of studying the stronger reducibility orderings of r.e. sets for providing information about Turing reducibility.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Controlling the dependence degree of a recursive enumerable vector space.Richard A. Shore - 1978 - Journal of Symbolic Logic 43 (1):13-22.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Decidable subspaces and recursively enumerable subspaces.C. J. Ash & R. G. Downey - 1984 - Journal of Symbolic Logic 49 (4):1137-1145.
    A subspace V of an infinite dimensional fully effective vector space V ∞ is called decidable if V is r.e. and there exists an r.e. W such that $V \oplus W = V_\infty$ . These subspaces of V ∞ are natural analogues of recursive subsets of ω. The set of r.e. subspaces forms a lattice L(V ∞ ) and the set of decidable subspaces forms a lower semilattice S(V ∞ ). We analyse S(V ∞ ) and its relationship with L(V (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Recursively enumerable vector spaces.G. Metakides - 1977 - Annals of Mathematical Logic 11 (2):147.
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • The weak truth table degrees of recursively enumerable sets.R. E. Ladner - 1975 - Annals of Mathematical Logic 8 (4):429.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Structural interactions of the recursively enumerable T- and W-degrees.R. G. Downey & M. Stob - 1986 - Annals of Pure and Applied Logic 31:205-236.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • The universal splitting property. II.M. Lerman & J. B. Remmel - 1984 - Journal of Symbolic Logic 49 (1):137-150.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Bounding minimal pairs.A. H. Lachlan - 1979 - Journal of Symbolic Logic 44 (4):626-642.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Gerald E. Sacks. The recursively enumerable degrees are dense. Annals of mathematics, ser. 2 vol. 80 (1964), pp. 300–312. [REVIEW]Gerald E. Sacks - 1969 - Journal of Symbolic Logic 34 (2):294-295.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • Splitting properties of R. E. sets and degrees.R. G. Downey & L. V. Welch - 1986 - Journal of Symbolic Logic 51 (1):88-109.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Countable vector spaces with recursive operations Part I1.J. C. E. Dekker - 1969 - Journal of Symbolic Logic 34 (3):363-387.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Countable vector spaces with recursive operations Part II.J. C. E. Dekker - 1971 - Journal of Symbolic Logic 36 (3):477-493.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A survey of lattices of re substructures.Anil Nerode & Jeffrey Remmel - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion theory. Providence, R.I.: American Mathematical Society. pp. 42--323.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • On R.e. And CO-R.E. Vector spaces with nonextendible bases.J. Remmel - 1980 - Journal of Symbolic Logic 45 (1):20-34.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Recursion theory on algebraic structures with independent sets.J. B. Remmel - 1980 - Annals of Mathematical Logic 18 (2):153.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Anti‐Mitotic Recursively Enumerable Sets.Klaus Ambos-Spies - 1985 - Mathematical Logic Quarterly 31 (29-30):461-477.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (1 other version)The Priority Method I.A. H. Lachlans - 1967 - Mathematical Logic Quarterly 13 (1‐2):1-10.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Co-immune subspaces and complementation in V∞.R. Downey - 1984 - Journal of Symbolic Logic 49 (2):528 - 538.
    We examine the multiplicity of complementation amongst subspaces of V ∞ . A subspace V is a complement of a subspace W if V ∩ W = {0} and (V ∪ W) * = V ∞ . A subspace is called fully co-r.e. if it is generated by a co-r.e. subset of a recursive basis of V ∞ . We observe that every r.e. subspace has a fully co-r.e. complement. Theorem. If S is any fully co-r.e. subspace then S has (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • First-order theories of abstract dependence relations.John T. Baldwin - 1984 - Annals of Pure and Applied Logic 26 (3):215-243.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • The universal complementation property.R. G. Downey & J. B. Remmel - 1984 - Journal of Symbolic Logic 49 (4):1125-1136.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Direct Summands of Recursively Enumerable Vector Spaces.Allen Retzlaff - 1979 - Mathematical Logic Quarterly 25 (19-24):363-372.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The weak truth table degrees of recursively enumerable sets.Richard E. Ladner & Leonard P. Sasso - 1975 - Annals of Mathematical Logic 8 (4):429-448.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Completely mitotic R.E. degrees.R. G. Downey & T. A. Slaman - 1989 - Annals of Pure and Applied Logic 41 (2):119-152.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Mitotic recursively enumerable sets.Richard E. Ladner - 1973 - Journal of Symbolic Logic 38 (2):199-211.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • (1 other version)The Priority Method I.A. H. Lachlans - 1967 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (1-2):1-10.
    Download  
     
    Export citation  
     
    Bookmark   12 citations