Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Conjunto recursivamente enumerable")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 87

  • Page / 4
Export

Selection :

  • and

Two theorems on truth table degreesDOWNEY, R. G.Proceedings of the American Mathematical Society. 1988, Vol 103, Num 1, pp 281-287, issn 0002-9939Article

The leastα for which E (α) is inadmissibleHOOLE, M.R.R; ASH, C.J.Journal of the Australian Mathematical Society. Series A, Pure mathematics. 1986, Vol 41, Num 2, pp 143-151, issn 0334-3316Article

On the power of the splicing operationPAUN, G.International journal of computer mathematics. 1995, Vol 59, Num 1-2, pp 27-35, issn 0020-7160Article

Effective model theory vs. recursive model theoryCHISHOLM, J.The Journal of symbolic logic. 1990, Vol 55, Num 3, pp 1168-1191, issn 0022-4812, 24 p.Article

A note on direct sums of FriedbergnumberingsKUMMER, M.The Journal of symbolic logic. 1989, Vol 54, Num 3, pp 1009-1010, issn 0022-4812Article

Complementation in the Turing degreesSLAMAN, T. A; STEEL, J. R.The Journal of symbolic logic. 1989, Vol 54, Num 1, pp 160-176, issn 0022-4812Article

Litteral shuffleBERARD, B.Theoretical computer science. 1987, Vol 51, Num 3, pp 281-299, issn 0304-3975Article

Subsets of hypersimple setsDOWNEY, R. G.Pacific journal of mathematics. 1987, Vol 127, Num 2, pp 299-319, issn 0030-8730Article

Morphisms and partitions of V-setsSTATMAN, R.Lecture notes in computer science. 1999, pp 313-322, issn 0302-9743, isbn 3-540-65922-6Conference Paper

Infima of recursively enumerable truth table degreesFEJER, P. A; SHORE, R. A.Notre Dame journal of formal logic. 1988, Vol 29, Num 3, pp 420-437, issn 0029-4527Article

On quasi-minimal e-degrees and total e-degreesSORBI, A.Proceedings of the American Mathematical Society. 1988, Vol 102, Num 4, pp 1005-1008, issn 0002-9939Article

Partially generic formulas in arithmeticLINDSTROM, P.Notre Dame journal of formal logic. 1988, Vol 29, Num 2, pp 185-192, issn 0029-4527Article

Tissue P systems with minimal symport/antiportVERLAN, Sergey.Lecture notes in computer science. 2004, pp 418-429, issn 0302-9743, isbn 3-540-24014-4, 12 p.Conference Paper

On the Cantor-Bendixon rank of recursively enumerable setsCHOLAK, P; DOWNEY, R.The Journal of symbolic logic. 1993, Vol 58, Num 2, pp 629-640, issn 0022-4812Conference Paper

1-reducibility inside an m-degree with a maximal setHERRMANN, E.The Journal of symbolic logic. 1992, Vol 57, Num 3, pp 1046-1056, issn 0022-4812Article

Automorphisms of the lattice of recursively enumerable sets : promptly simple setsCHOLAK, P; DOWNEY, R; STOB, M et al.Transactions of the American Mathematical Society. 1992, Vol 332, Num 2, pp 555-570, issn 0002-9947Article

A remark on pseudo-jump operatorsLACHLAN, A. H; YI, X.Proceedings of the American Mathematical Society. 1989, Vol 106, Num 2, pp 489-491, issn 0002-9939Article

1-Genericity in the enumeration degreesCOPESTAKE, K.The Journal of symbolic logic. 1988, Vol 53, Num 3, pp 878-887, issn 0022-4812Article

Ordinal notations based on a hierarchy of inacessible cardinalsPOHLERS, W.Annals of pure and applied logic. 1987, Vol 33, Num 2, pp 157-179, issn 0168-0072Article

On varieties of cylindric algebras with applications to logicNEMETI, I.Annals of pure and applied logic. 1987, Vol 36, Num 3, pp 235-277, issn 0168-0072Article

The undecidability of the lattice of R.E. closed subsets of an effective topological spaceSILIBOVSKY BRADY, S; REMMEL, J. B.Annals of pure and applied logic. 1987, Vol 35, Num 2, pp 193-203, issn 0168-0072Article

Undecidability of L(F∞) and other lattices of R.E. substructuresDOWNEY, R. G.Annals of pure and applied logic. 1986, Vol 32, Num 1, pp 17-26, issn 0168-0072Article

Tissue P systems with antiport rules and small numbers of symbols and cellsALHAZOV, Artiom; FREUND, Rudolf; OSWALD, Marion et al.Lecture notes in computer science. 2005, pp 100-111, issn 0302-9743, isbn 3-540-26546-5, 12 p.Conference Paper

Computability on subsets of Euclidean space I : closed and compact subsetsBRATTKA, V; WEIHRAUCH, K.Theoretical computer science. 1999, Vol 219, Num 1-2, pp 65-93, issn 0304-3975Article

Intervals and sublattices of the R.E. weak truth table degrees. I: densityDOWNEY, R. G.Annals of pure and applied logic. 1989, Vol 41, Num 1, pp 1-26, issn 0168-0072Article

  • Page / 4