Search results

Remmel J. B [1976] Co-hypersimple structures J. Symbolic Logic, 41, № 3, 611-625 77.04.85 77.07.41 article Вернуться к поиску

Remmel J. B [1981] Recursive isomorphism types of recursive Boolean algebras J. Symbolic Logic, 46, № 3, 572-594 82.04.72 G article Вернуться к поиску

Remmel J. B [1987] Recursively rigid Boolean algebras Ann. Pure Appl. Logic, 36, № 1, 39-52 88.05.82 G article Вернуться к поиску

Remmel J. B [1981] Recursively categorical linear orderings Proc. Amer. Math.Soc., 83, № 2, 387-391 82.04.73 G article Вернуться к поиску

Remmel J. B [1981] Recursive Boolean algebras with recursive atoms J. Symbolic Logic, 46, № 3, 595-616 82.05.43; G article Вернуться к поиску

Remmel J. B [1989] Recursive Boolean algebras Handbook of Boolean Algebras, 3, 1097-1166, North-Holland ? G article Вернуться к поиску

Remmel J. B [1993] Polynomial-time categoricity and linear orderings Progr. Comput. Sci. Appl. Logic, 12, 713-746 ? article Вернуться к поиску

Remmel J.B. [1979] R -maximal Boolean algebras J. Symbolic Logic, 44, № 4, 533-548 80.08.30 article Вернуться к поиску

Remmel J.B. [1980] Recursion theory on orderings, II J. Symbolic Logic, 45, № 2, 317-333 81.02.50 G article Вернуться к поиску

Remmel J.B. [1978] Recursively enumerable Boolean algebra Ann. Math. Logic, 15, № 1, 75-107 79.04.133 SG article Вернуться к поиску

Remmel J.B. [1977] Maximal and cohesive vector spaces J. Symbolic Logic, 42, № 3, 400-418 78.12.67 article Вернуться к поиску

Remmel J.B. (ed.) [1989] Handbook of Boolean Algebras, 3 North-Holland ? S book Вернуться к поиску

Cenzer D.,Remmel J.B. [1998] Complexity and categoricity Inform and Comput., 140, № 1, 2-25 98.ВН11.96 article Вернуться к поиску

Miller D., Remmel J.B. [1984] Effectively nowhere simple sets J. Symbolic Logic, 49, № 1, 129-136 85.01.59 OS article Вернуться к поиску

Lerman M., Remmel J. [1984] The universal splitting properties, II J. Symbolic Logic, 49, № 1, 137-150 84.12.47 S article Вернуться к поиску

Lerman M., Remmel J. [1982] The universal splitting properties, I Logic Coll.’80, North-Holland, 181-208 ? S article Вернуться к поиску

Cenzer D., Remmel J. B. [1998] Π 1 0 - classes in mathematics Handbook of Recursive Mathematics, v.2, 623-821, Elsevier ? article Вернуться к поиску

Cenzer D., Remmel J. B. [1998] Complexity theoretical model theory and algebra Handbook of Recursive Mathematics, v.2, 381-513, Elsevier ? article Вернуться к поиску

Downey R. G., Remmel J.B. [1984] The universal complementation property J. Symbolic Logic, 49, № 4, 1125-1136 85.08.56 article Вернуться к поиску

Downey R. G., Remmel J.B., [1994] Effectively and noneffectively nowhere simple subspaces Logical Methods, Birkhauser, 314-351 ? article Вернуться к поиску

Remmel J.B. [1980] On r.e. and co-r.e. vector spaces with nonextendible bases J. Symbolic Logic, 45, № 1, 20-34 81.02.47 article Вернуться к поиску

Remmel J.B. [1978] Realizing partial orderings by classes of co-simple sets Pacif. J. Math., 76, № 1, 169-184 79.01.70 article Вернуться к поиску

Cenzer D., Remmel J. B. [1991] Polynominal-time versus recursive models Ann. Pure Appl. Logic, 54, № 1, 17-58 82.03.87 article Вернуться к поиску

Nerode A., Remmel J.B. [1989] Complexity theoretic algebra, II: Boolean algebras Ann. Pure Appl. Logic, 44, № 1-2, 71-99 ? G article Вернуться к поиску

Cenzer D., Remmel J.B. [1991] Polynomial-time versus recursive models Ann. Pure Appl. Logic, 54, № 1, 17-58 92.03.87 G article Вернуться к поиску

Kalantari J., Remmel J. B. [1983] Degrees of recursively enumerable topological spaces J. Symbolic Logic, 48, № 3, 610-622 84.07.57 S article Вернуться к поиску

Downey R. G., Remmel J.B. [1998] Computable algebras and closure systems: coding properties Handbook of Recursive Mathematics, v.2, 977-1039, Elsevier ? article Вернуться к поиску

Downey R. G., Remmel J.B. [2000] Questions in computable algebra and combinatorics Contemporary Math., 257, 95-125 03.12.265 article Вернуться к поиску

Downey R. G., Remmel J.B. [1989] Classification of degree classes associated with r.e. subspaces Ann. Pure Appl. Logic, 42, № 2, 105-125 ? article Вернуться к поиску

Remmel J. B [1980] Complementation in the lattice of subalgebras of a Boolean algebra Algebra Universalis, 10, № 1, 48-64 80.10.221 G article Вернуться к поиску

Metakides G., Remmel J.B. [1979] Recursion theory on orderings, I. A Model theoretic setting J. Symbolic Logic, 44, № 3, 383-402 80.05.53 S article Вернуться к поиску

Crossley J. N., Remmel J.B. [1983] Undecidability and recursive equivalence, I Proc. South. Asian Conf. on Logic, (Singapore, 1981), North-Holland, 37-53 ? G article Вернуться к поиску

Downey R. G., Remmel J.B. [1987] Automorphisms and recursive structures Z. math. Logik und Grundl. Math., 33, № 4, 339-345 88.05.51 G article Вернуться к поиску

Remmel J. B [1980] Recursion theory on algebraic structures with independent set Ann. Math. Logic, 18, № 2, 153-191 81.02.44 SG article Вернуться к поиску

Nerode A., Remmel J.B. [1985] Generic objects in recursion theory Lect. Notes in Math., 1141, 271-314, Springer-Verlag 86.04.48 S article Вернуться к поиску

Nerode A., Remmel J.B. [1983] Recursive theory on matroids, II Proc. South. Asian Conf. on Logic, (Singapore, 1981), North-Holland, 133-184 ? G article Вернуться к поиску

Crossley J. N., Remmel J.B. [1984] Undecidability and recursive equivalence, II Lect. Notes in Math., 1104, 79-100, Springer-Verlag 85.09.31 G article Вернуться к поиску

Remmel J.B. [1978] An r -maximal vector space not contained in any maximal vector space J. Symbolic Logic, 43, № 3, 430-441 79.06.61 article Вернуться к поиску

Cenzer D., Remmel J. [2006] On the complexity of inductive definitions Math. Struc. Comp. Sci., 16, № 5, 763-788 BH08.11.105 article Вернуться к поиску

Bäurle F.A., Remmel J.B. [1994] On speedable and levelable vector spaces Ann. Pure Appl. Logic, 67, № 1-3, 61-112 94.12.41 article Вернуться к поиску

Cenzer D.,Remmel J.B. [2002] Effectively closed sets and graphs of computable real functions Theor. Comp. Sci., 284, № 2, 279-318 04. ВН1.174 article Вернуться к поиску

Nerode A., Remmel J.B. [1990] Complexity theoretic algebra: vector space bases, I: vector spaces over finite fields Progr. Comput. Sci. Appl. Logic, 9, 293-319 ? G article Вернуться к поиску

Nerode A., Remmel J.B. [1982] Recursive theory on matroids Proc. Patras Logic Symp. (Patras, Greece, 1980), North-Holland, 41-65 84.04.54 SG article Вернуться к поиску

Eisenberg E.F., Remmel J.B. [1982] Effective isomorphisms of algebraic structures Proc. Patras Logic Symp. (Patras, Greece, 1980), North-Holland, 95-122 84.03.421 G article Вернуться к поиску

Jockusch C.G. Jr., Lewis A., Remmel J.B. [1991] Π 1 0 classes and Rado’s selection principle J. Symbolic Logic, 56, № 2, 684-693 92.08.51 article Вернуться к поиску

Remmel J. B [1981] Effective structures not contained in recursively enumerable structures Aspects of Effective Algebra, 206-225, Upside Down a Book Co., Yarra Glen, Vic. ? G article Вернуться к поиску

Nerode A., Remmel J.B. [1986] Generic objects in recursion theory, II: Operations on recursive approximation spaces Ann. Pure Appl. Logic, 31, № 2-3, 257-288 ? S article Вернуться к поиску

Manaster A. B., Remmel J. B. [1981] Some decision problems for subtheories of two-dimensional partial orderings Lect. Notes in Math., 859, 202-214, Springer-Verlag 81.12.87 article Вернуться к поиску

Silibovski S., Remmel J.B. [1987] The undecidability of the lattice of r.e. closed subsets of r.e. effective topological space Ann. Pure Appl. Logic, 35, № 2 , 193-203. 87.12.34 article Вернуться к поиску

Downey R. G., Remmel J.B., Welch L.V. [1987] Degrees of splitting and bases of recursively enumerable subspaces Trans. Amer. Math. Soc., 302, № 2, 683-714 88.05.53. article Вернуться к поиску