Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("SOARE RI")

Results 1 to 8 of 8

  • Page / 1

Export

Selection :

  • and

COMPUTATIONAL COMPLEXITY OF RECURSIVELY ENUMERABLE SETSSOARE RI.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 1; PP. 8-18; BIBL. 2 P.Article

AUTOMORPHISMS OF THE LATTICE OF RECURSIVELY ENUMERABLE SETS. II: LOW SETSSOARE RI.1982; ANN. MATH. LOGIC; ISSN 0003-4843; NLD; DA. 1982; VOL. 22; NO 1; PP. 69-108; BIBL. 37 REF.Article

FUNDAMENTAL METHODS FOR CONSTRUCTING RECURSIVELY ENUMERABLE DEGREESSOARE RI.1980; LONDON MATH. SOC. LECTURE NOTE SER.; GBR; DA. 1980; NO 45; PP. 1-51; BIBL. 3 P.Conference Paper

THE INFINITE IN JURY PRIORITY METHOD.SOARE RI.1976; J. SYMBOL. LOGIC; U.S.A.; DA. 1976; VOL. 41; NO 2; PP. 513-530; BIBL. 26 REF.Article

THE PLUS-CUPPING THEOREM FOR THE RECURSIVELY ENUMERABLE DEGREESFEJER PA; SOARE RI.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; VOL. 859; PP. 49-62; BIBL. 16 REF.Article

RELATIVE RECURSIVE ENUMERABILITYSOARE RI; STOB M.1982; STUD. LOG. FOUND. MATH.; ISSN 0049-237X; NLD; DA. 1982; VOL. 107; PP. 299-324; BIBL. 8 REF.Conference Paper

SOME LOWNESS PROPERTIES AND COMPUTATIONAL COMPLEXITY SEQUENCES.BENNISON VL; SOARE RI.1978; THEOR. COMPUTER SCI.; NETHERL.; DA. 1978; VOL. 6; NO 8; PP. 233-254; BIBL. 24 REF.Article

A DECIDABLE FRAGMENT OF THE ELEMENTARY THEORY OF THE LATTICE OF RECURSIVELY ENUMERABLE SETSLERMAN M; SOARE RI.1980; TRANS. AMER. MATH. SOC.; USA; DA. 1980; VOL. 257; NO 1; PP. 1-37; BIBL. 15 REF.Article

  • Page / 1