Techniques of admissible recursion theoryCHONG, C. T.Lecture notes in mathematics. 1984, Vol 1106, issn 0075-8434, IX-214 pSerial Issue

Regressive isols and the relation ya≤ybBARBACK, J.Journal of the London Mathematical Society. 1990, Vol 41, Num 1, pp 1-9, issn 0024-6107, 9 p.Article

Tabular degrees in α-recursion theoryBAILEY, C; DOWNEY, R.Annals of pure and applied logic. 1992, Vol 55, Num 3, pp 205-236, issn 0168-0072Article

SCHUR RECURSIONS, ERROR FORMULAS, AND CONVERGENCE OF RATIONAL ESTIMATORS FOR STATIONARY STOCHASTIC SEQUENCESDEWILDE P; DYM H.1981; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1981; VOL. 27; NO 4; PP. 446-461; BIBL. 22 REF.Article

BANACH-MAZUR GAMES, COMEAGER SETS AND DEGREES OF UNSOLVABILITY.YATES CEM.1976; MATH. PROC. CAMBRIDGE PHILOS. SOC.; G.B.; DA. 1976; VOL. 79; NO 2; PP. 195-220; BIBL. 19 REF.Article

RECURSIVENESS IN PI ₁¹ PATHS THROUGH THETAFRIEDMAN H.1976; PROC. AMER. MATH. SOC.; U.S.A.; DA. 1976; VOL. 54; PP. 311-315; BIBL. 7 REF.Article

UNIFORM INDUCTIVE DEFINABILITY AND INFINITARY LANGUAGES.NYBERG AM.1976; J. SYMBOL. LOGIC; U.S.A.; DA. 1976; VOL. 41; NO 1; PP. 109-120; BIBL. 18 REF.Article

TREES AND ISOLS II.MCLAUGHLIN TG.1976; Z. MATH. LOGIK GRUNDL. MATH.; DTSCH.; DA. 1976; VOL. 22; NO 1; PP. 45-78; BIBL. 32 REF.Article

BOREL SETS IN PW: 1.TANG A.1975; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1975; NO 137; PP. 1-57; ABS. FR.; BIBL. 6 REF.Serial Issue

ON THE COVERING OF LEFT RECURSIVE GRAMMARS.NIJHOLT A.1977; IN: ACM SYMP. PRINC. PROGRAM. LANG. 4; LOS ANGELES; 1977; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1977; PP. 86-96; BIBL. 3 REF.Conference Paper

AN ABSTRACT SOFTWARE SPECIFICATION TECHNIQUE BASED ON STRUCTURAL RECURSIONKLAEREN HA.1980; SIGPLAN NOT.; USA; DA. 1980; VOL. 15; NO 3; PP. 28-34; BIBL. 13 REF.Article

HYPERHYPERSIMPLE SUPERSETS IN ADMISSIBLE RECURSION THEORYCHONG CT.1983; JOURNAL OF SYMBOLIC LOGIC; ISSN 0022-4812; USA; DA. 1983; VOL. 48; NO 1; PP. 185-192; BIBL. 13 REF.Article

RECURSION THEORY ON MATROIDSNERODE A; REMMEL J.1982; STUD. LOG. FOUND. MATH.; ISSN 0049-237X; NLD; DA. 1982; VOL. 109; PP. 41-65; BIBL. 16 REF.Conference Paper

A REPRESENTATION APPROACH TO THE TOWER OF HANOI PROBLEMER MC.1982; COMPUTER JOURNAL; ISSN 0010-4620; GBR; DA. 1982; VOL. 25; NO 4; PP. 442-447; BIBL. 7 REF.Article

BACK-AND-FORTH INSIDE A RECURSIVELY SATURATED MODEL OF ARITHMETICSMORYNSKI C.1982; STUD. LOG. FOUND. MATH.; ISSN 0049-237X; NLD; DA. 1982; VOL. 108; PP. 273-278; BIBL. 6 REF.Conference Paper

ON RECURSIVE LINEAR ORDERINGSLERMAN M.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; VOL. 859; PP. 132-142; BIBL. 2 REF.Article

ON THE GRILLIOT-HARRINGTON-MACQUEEN THEOREMMOSCHOVAKIS YN.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; VOL. 859; PP. 246-267; BIBL. 7 REF.Article

RECURSIVE BOOLEAN ALGEBRAS WITH RECURSIVE ATOMSREMMEL JB.1981; J. SYMB. LOGIC; ISSN 0022-4812; USA; DA. 1981; VOL. 46; NO 3; PP. 595-616; BIBL. 15 REF.Article

RECURSION AND NONMONOTONE INDUCTION IN A QUANTIFIERKOLAITIS PG.1980; STUD. LOGIC FOUND. MATH.; NLD; DA. 1980; VOL. 101; PP. 367-389; BIBL. 2 P.Conference Paper

RECURSIVELY SATURATED MODELS OF SET THEORYSCHLIPF JS.1980; PROC. AM. MATH. SOC.; USA; DA. 1980; VOL. 80; NO 1; PP. 135-142; BIBL. 14 REF.Article

THE RECURSION THEORY OF THE CONTINUOUS FUNCTIONALSNORMAN D.1980; LONDON MATH. SOC. LECTURE NOTE SER.; GBR; DA. 1980; NO 45; PP. 171-183; BIBL. 21 REF.Conference Paper

TWO SPLITTING THEOREMS FOR BETA-RECURSION THEORYHOMER S.1980; ANN. MATH. LOGIC; NLD; DA. 1980; VOL. 18; NO 2; PP. 137-151; BIBL. 17 REF.Article

ON ELEMENTARY THEORIES OF SOME LATTICES OF ALPHA -RECURSIVELY ENUMERABLE SETS.LERMAN M.1978; ANN. MATH. LOGIC; NLD; DA. 1978; VOL. 14; NO 3; PP. 227-272; BIBL. 16 REF.Article

CO-HYPERSIMPLE STRUCTURES.REMMEL JB.1976; J. SYMBOL. LOGIC; U.S.A.; DA. 1976; VOL. 41; NO 3; PP. 611-625; BIBL. 8 REF.Article

IDEALS OF GENERALIZED FINITE SETS IN LATTICER OF ALPHA -RECURSIVELY ENUMERABLE SETS.LERMAN M.1976; Z. MATH. LOGIK GRUNDL. MATH.; DTSCH.; DA. 1976; VOL. 22; NO 4; PP. 347-352; BIBL. 4 REF.Article