Switch to: References

Add citations

You must login to add citations.
  1. Recursively Enumerable Boolean Algebras.J. B. Remmel - 1978 - Annals of Pure and Applied Logic 15 (1):75.
  • Recursion Theory on Algebraic Structures with Independent Sets.J. B. Remmel - 1980 - Annals of Pure and Applied Logic 18 (2):153.
  • Foundations of Recursive Model Theory.Terrence S. Millar - 1978 - Annals of Pure and Applied Logic 13 (1):45.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  • Recursively Enumerable Vector Spaces.G. Metakides - 1977 - Annals of Pure and Applied Logic 11 (2):147.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   50 citations  
  • A Note on R-Maximal Subspaces of V[Infinity].David R. Guichard - 1984 - Annals of Pure and Applied Logic 26 (1):1.
  • Undecidability of L(F∞) and Other Lattices of R.E. Substructures.R. G. Downey - 1986 - Annals of Pure and Applied Logic 32 (1):17-26.
  • Recursive Properties of Relations on Models.Geoffrey R. Hird - 1993 - Annals of Pure and Applied Logic 63 (3):241-269.
    Hird, G.R., Recursive properties of relations on models, Annals of Pure and Applied Logic 63 241–269. We prove general existence theorems for recursive models on which various relations have specified recursive properties. These capture common features of results in the literature for particular algebraic structures. For a useful class of models with new relations R, S, where S is r.e., we characterize those for which there is a recursive model isomorphic to on which the relation corresponding to S remains r.e., (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Degrees of Convex Dependence in Recursively Enumerable Vector Spaces.Thomas A. Nevins - 1993 - Annals of Pure and Applied Logic 60 (1):31-47.
    Let W be a recursively enumerable vector space over a recursive ordered field. We show the Turing equivalence of the following sets: the set of all tuples of vectors in W which are linearly dependent; the set of all tuples of vectors in W whose convex closures contain the zero vector; and the set of all pairs of tuples in W such that the convex closure of X intersects the convex closure of Y. We also form the analogous sets consisting (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Complexity-Theoretic Algebra II: Boolean Algebras.A. Nerode & J. B. Remmel - 1989 - Annals of Pure and Applied Logic 44 (1-2):71-99.
  • On the Lattices of NP-Subspaces of a Polynomial Time Vector Space Over a Finite Field.Anil Nerode & J. B. Remmel - 1996 - Annals of Pure and Applied Logic 81 (1-3):125-170.
    In this paper, we study the lower semilattice of NP-subspaces of both the standard polynomial time representation and the tally polynomial time representation of a countably infinite dimensional vector space V∞ over a finite field F. We show that for both the standard and tally representation of V∞, there exists polynomial time subspaces U and W such that U + V is not recursive. We also study the NP analogues of simple and maximal subspaces. We show that the existence of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Computable Isomorphisms, Degree Spectra of Relations, and Scott Families.Bakhadyr Khoussainov & Richard A. Shore - 1998 - Annals of Pure and Applied Logic 93 (1-3):153-193.
    The spectrum of a relation on a computable structure is the set of Turing degrees of the image of R under all isomorphisms between and any other computable structure . The relation is intrinsically computably enumerable if its image under all such isomorphisms is c.e. We prove that any computable partially ordered set is isomorphic to the spectrum of an intrinsically c.e. relation on a computable structure. Moreover, the isomorphism can be constructed in such a way that the image of (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  • Automorphisms of Substructure Lattices in Recursive Algebra.David R. Guichard - 1983 - Annals of Pure and Applied Logic 25 (1):47-58.
  • The Undecidability of the Lattice of R.E. Closed Subsets of an Effective Topological Space.Sheryl Silibovsky Brady & Jeffrey B. Remmel - 1987 - Annals of Pure and Applied Logic 35 (2):193-203.
    The first-order theory of the lattice of recursively enumerable closed subsets of an effective topological space is proved undecidable using the undecidability of the first-order theory of the lattice of recursively enumerable sets. In particular, the first-order theory of the lattice of recursively enumerable closed subsets of Euclidean n -space, for all n , is undecidable. A more direct proof of the undecidability of the lattice of recursively enumerable closed subsets of Euclidean n -space, n ⩾ 2, is provided using (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Recursion Theory and Ordered Groups.R. G. Downey & Stuart A. Kurtz - 1986 - Annals of Pure and Applied Logic 32 (2):137-151.
  • Maximal Theories.R. G. Downey - 1987 - Annals of Pure and Applied Logic 33 (3):245-282.
  • Automorphisms and Recursive Structures.R. G. Downey & J. B. Remmel - 1987 - Mathematical Logic Quarterly 33 (4):339-345.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Automorphisms and Recursive Structures.R. G. Downey & J. B. Remmel - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (4):339-345.