28 found
Order:
  1.  20
    Recursive Isomorphism Types of Recursive Boolean Algebras.J. B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):572-594.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  2.  23
    Classifications of Degree Classes Associated with R.E. Subspaces.R. G. Downey & J. B. Remmel - 1989 - Annals of Pure and Applied Logic 42 (2):105-124.
    In this article we show that it is possible to completely classify the degrees of r.e. bases of r.e. vector spaces in terms of weak truth table degrees. The ideas extend to classify the degrees of complements and splittings. Several ramifications of the classification are discussed, together with an analysis of the structure of the degrees of pairs of r.e. summands of r.e. spaces.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  3.  83
    Π01-Classes and Rado's Selection Principle.C. G. Jockusch, A. Lewis & J. B. Remmel - 1991 - Journal of Symbolic Logic 56 (2):684 - 693.
  4. Recursion Theory on Orderings. II.J. B. Remmel - 1980 - Journal of Symbolic Logic 45 (2):317-333.
  5.  25
    Maximal and Cohesive Vector Spaces.J. B. Remmel - 1977 - Journal of Symbolic Logic 42 (3):400-418.
  6.  8
    Complexity-Theoretic Algebra II: Boolean Algebras.A. Nerode & J. B. Remmel - 1989 - Annals of Pure and Applied Logic 44 (1-2):71-99.
  7.  16
    Degrees of Recursively Enumerable Topological Spaces.Iraj Kalantari & J. B. Remmel - 1983 - Journal of Symbolic Logic 48 (3):610-622.
  8.  1
    $\Pi^0_1$-Classes And Rado's Selection Principle.C. G. Jockusch, A. Lewis & J. B. Remmel - 1991 - Journal of Symbolic Logic 56 (2):684-693.
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  9.  10
    Quasi-Simple Relations in Copies of a Given Recursive Structure.C. J. Ash, J. F. Knight & J. B. Remmel - 1997 - Annals of Pure and Applied Logic 86 (3):203-218.
  10.  4
    Graph Colorings and Recursively Bounded Π10-Classes.J. B. Remmel - 1986 - Annals of Pure and Applied Logic 32 (2):185-194.
  11.  30
    The Universal Complementation Property.R. G. Downey & J. B. Remmel - 1984 - Journal of Symbolic Logic 49 (4):1125-1136.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  12.  7
    The Universal Splitting Property. II.M. Lerman & J. B. Remmel - 1984 - Journal of Symbolic Logic 49 (1):137-150.
  13.  15
    Effectively Nowhere Simple Sets.D. Miller & J. B. Remmel - 1984 - Journal of Symbolic Logic 49 (1):129-136.
  14.  6
    R-Maximal Boolean Algebras.J. B. Remmel - 1979 - Journal of Symbolic Logic 44 (4):533-548.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  15.  13
    Co-Hypersimple Structures.J. B. Remmel - 1976 - Journal of Symbolic Logic 41 (3):611-625.
  16.  26
    Recursion Theory on Orderings. I. A Model Theoretic Setting.G. Metakides & J. B. Remmel - 1979 - Journal of Symbolic Logic 44 (3):383-402.
  17.  3
    Graph Colorings and Recursively Bounded< I> Π_< Sub> 1< Sup> 0-Classes.J. B. Remmel - 1986 - Annals of Pure and Applied Logic 32:185-194.
  18.  24
    Automorphisms and Recursive Structures.R. G. Downey & J. B. Remmel - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (4):339-345.
  19.  11
    A Context for Belief Revision: Forward Chaining-Normal Nonmonotomic Rule Systems.V. W. Marek, A. Nerode & J. B. Remmel - 1994 - Annals of Pure and Applied Logic 67 (1-3):269-323.
    A number of nonmonotonic reasoning formalisms have been introduced to model the set of beliefs of an agent. These include the extensions of a default logic, the stable models of a general logic program, and the extensions of a truth maintenance system among others. In [13] and [16], the authors introduced nonmonotomic rule systems as a nonlogical generalization of all essential features of such formulisms so that theorems applying to all could be proven once and for all. In this paper, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20.  1
    Indiscernibles and Decidable Models.H. A. Kierstead & J. B. Remmel - 1983 - Journal of Symbolic Logic 48 (1):21-32.
  21.  9
    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  
  22.  7
    Logic Programs, Well-Orderings and Forward Chaining.V. W. Marek, A. Nerode & J. B. Remmel - 1999 - Annals of Pure and Applied Logic 96 (1-3):231-276.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  23.  5
    Generic Objects in Recursion Theory II: Operations on Recursive Approximation Spaces.A. Nerode & J. B. Remmel - 1986 - Annals of Pure and Applied Logic 31 (2):257-288.
  24.  5
    Cancellation Laws for Polynomial-Time P-Isolated Sets.John N. Crossley & J. B. Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):147-172.
    A universal Horn sentence in the language of polynomial-time computable combinatorial functions of natural numbers is true for the natural numbers if, and only if, it is true for PETs of p-time p-isolated sets with functions induced by fully p-time combinatorial operators.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  25.  2
    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  
  26. Kagan, V., Nerode, A. And Subrahmanian, VS., Computing Definite Logic.M. A. da ArchangelskyTaitslin, S. Artemov, F. A. Bluerle, J. B. Remmel, R. Harper, D. Sannella & A. Tarlecki - 1994 - Annals of Pure and Applied Logic 67:349.
  27.  10
    Recursively Enumerable Boolean Algebras.J. B. Remmel - 1978 - Annals of Pure and Applied Logic 15 (1):75.
  28.  5
    Recursion Theory on Algebraic Structures with Independent Sets.J. B. Remmel - 1980 - Annals of Pure and Applied Logic 18 (2):153.