DECOMPOSITION OF RECURSIVELY ENUMERABLE DEGREESLACHLAN AH.1980; PROC. AMER. MATH. SOC.; USA; DA. 1980; VOL. 79; NO 4; PP. 629-634; BIBL. 6 REF.Article

ON DEGREES OF UNSOLVABILITY AND COMPLEXITY PROPERTIES.MARQUES I.1975; J. SYMBOL. LOGIC; U.S.A.; DA. 1975; VOL. 40; NO 4; PP. 529-540; BIBL. 8 REF.Article

CALCULS FREQUENTIELS DES PREDICATS RECURSIFS ET ENUMERATION FREQUENTIELLE D'ENSEMBLESKINBER EB.1972; DOKL. AKAD. NAUK S.S.S.R.; S.S.S.R.; DA. 1972; VOL. 205; NO 1; PP. 23-25; BIBL. 4 REF.Serial Issue

NOWHERE SIMPLE SETS AND THE LATTICE OF RECURSIVELY ENUMERABLE SETS.SHORE RA.1978; J. SYMBOL. LOGIC; USA; DA. 1978; VOL. 43; NO 2; PP. 322-330; BIBL. 10 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

SOME LOWENHEIM-SKOLEM RESULTS FOR ADMISSIBLE SETSNADEL M.1972; ISRAEL J. MATH.; ISRAEL; DA. 1972; VOL. 12; NO 4; PP. 427-432; BIBL. 3 REF.Serial Issue

DETERMINING AUTOMORPHISMS OF THE RECURSIVELEY ENUMERABLE SETS.SHORE RA.1977; PROC. AMER. MATH. SOC.; U.S.A.; DA. 1977; VOL. 65; NO 2; PP. 318-325; BIBL. 11 REF.Article

CODAGE DES ELEMENTS D'UN GROUPE SYMETRIQUESHISHIGIN MI.1975; SOOBSHCH. AKAD. NAUK GRUZ. S.S.R.; S.S.S.R.; DA. 1975; VOL. 78; NO 1; PP. 69-71; ABS. GEORG. ANGL.; BIBL. 2 REF.Article

L* (K) AND OTHER LATTICES OF RECURSIVELY ENUMERABLE SETSSHORE RA.1980; PROC. AM. MATH. SOC.; USA; DA. 1980; VOL. 80; NO 1; PP. 143-146; BIBL. 10 REF.Article

A HALL CRITERION FOR COUNTABLE FAMILIES OF SETSHOLZ M; PODEWSKI KP; STEFFENS K et al.1980; J. LONDON MATH. SOC.; GBR; DA. 1980; VOL. 21; NO 1; PP. 1-12; BIBL. 1 REF.Article

QUESTION DE REPRESENTATION ET D'ENUMERATION DES ENSEMBLES DE MOTS A L'AIDE D'AUTOMATES FINISKURMIT AA.1972; AVTOMAT. VYCHISLIT. TEKH., LATV. S.S.R.; S.S.S.R.; DA. 1972; NO 3; PP. 10-17; BIBL. 7 REF.Serial Issue

Register machine proof of the theorem on exponential diophantine representation of enumerable setsJONES, J. P; MATIJASEVIC, Y. V.The Journal of symbolic logic. 1984, Vol 49, Num 3, pp 818-829, issn 0022-4812Article

DESTABILIZATION OF AN ENUMERABLE SET OF CYCLES IN A HAMILTONIAN SYSTEMDOVEIL F; ESCANDE DF.1981; PHYS. LETT. SECT. A; ISSN 0375-9601; NLD; DA. 1981; VOL. 84; NO 8; PP. 399-403; BIBL. 9 REF.Article

REDUCTIBILITES DES NUMERATIONSDEGTEV AN.1980; MAT. SBOR.; SUN; DA. 1980; VOL. 112; NO 2; PP. 207-219; BIBL. 7 REF.Article

SETS CONSTRUCTED BY ACCEPTORS.NOVOTNY M.1974; INFORM. AND CONTROL; U.S.A.; DA. 1974; VOL. 26; NO 2; PP. 116-133; BIBL. 5 REF.Article

SUR UNE CLASSIFICATION DES ENSEMBLES BINAIRES ET LES PROPRIETES DES CLASSES D'HOMOGENEITELIPATOV EP.1982; PROBLEMY KIBERNETIKI; ISSN 507989; SUN; DA. 1982; NO 39; PP. 67-84; BIBL. 10 REF.Article

A SYSTEM OF GRAPH GRAMMARS WHICH GENERATES ALL RECURSIVELY ENUMERABLE SETS OF LABELLED GRAPHSUESU T.1978; TSUKUBA J. MATH.; JPN; DA. 1978; VOL. 2; PP. 11-26; BIBL. 7 REF.Article

The halting problem does not matterHUTCHINSON, A.Computer journal (Print). 1984, Vol 27, Num 4, issn 0010-4620, 376Article

Coloring ordered sets to avoid monochromatic maximal chainsDUFFUS, D; RODL, V; SAUER, N et al.Canadian journal of mathematics. 1992, Vol 44, Num 1, pp 91-103, issn 0008-414XArticle

A partition theorem for triplesMILNER, E. C; PRIKRY, K.Proceedings of the American Mathematical Society. 1986, Vol 97, Num 3, pp 488-494, issn 0002-9939Article

Cardinal representations for closures and preclosuresGALVIN, F; MILNER, E. C; POUZET, M et al.Transactions of the American Mathematical Society. 1991, Vol 328, Num 2, pp 667-693, issn 0002-9947Article

Some remarks on the algebraic structure of the Medvedev latticeSORBI, A.The Journal of symbolic logic. 1990, Vol 55, Num 2, pp 831-853, issn 0022-4812, 23 p.Article