RECURSIVELY ENUMERABLE SETS AND WELL-ORDERING OF THEIR ENUMERATIONS
cytuj
pobierz pliki
RIS BIB ENDNOTEChoose format
RIS BIB ENDNOTERECURSIVELY ENUMERABLE SETS AND WELL-ORDERING OF THEIR ENUMERATIONS
Publication date: 21.10.2014
Reports on Mathematical Logic, 2014, Number 49, pp. 79 - 97
https://doi.org/10.4467/20842589RM.14.005.2275Authors
[1] P. Clote, Handbook of Computability Theory, Studies in Logic and the Foundations of Mathematics, Elsevier, 1999.
[2] T. Jech, Set Theory, Springer Monographs in Mathematics, Springer, 2006.
[3] G. Kreisel, On the interpretation of non-finitist proofs I, II, Journal of Symbolic Logic 16,17 (1952), 241–267, 43–58.
[4] P. Odifreddi, Classical Recursion Theory, Studies in Logic and the Foundations of Mathematics, North Holland, 1989.
[5] J. Roitman, Introduction to Modern Set Theory, Virginia Commonwealth Univer- sity, 2011.
[6] R. I. Soare, Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Springer, 1987.
[7] S. S. Wainer, A classification of the ordinal recursive functions, Archiv fur Mathematische Logik und
Grundlagenforschung 13:3–4 (1970), 136–153.
[8] R. Weber, Computability Theory, Student Mathematical Library, American Math- ematical Society, 2012.
Information: Reports on Mathematical Logic, 2014, Number 49, pp. 79 - 97
Article type: Original article
Titles:
RECURSIVELY ENUMERABLE SETS AND WELL-ORDERING OF THEIR ENUMERATIONS
Institute of Mathematics University of Maria Curie-Sk lodowska pl. M. Curie-Sk lodowskiej 1 20-709 Lublin, Poland
Published at: 21.10.2014
Article status: Open
Licence: None
Percentage share of authors:
Article corrections:
-Publication languages:
EnglishView count: 1988
Number of downloads: 1182