Recursively enumerable sets and well-ordering of their enumerations

• Autorzy: Mycka J.

Identyfikatory

DOI

10.4467/20842589RM.14.005.2275

• Języki publikacji: EN

Abstrakty

EN

We will introduce the special kind of the order relations into recursively enumerable sets and prove that they can be used to distinguish (albeit in a non-constructive way) between recursive and non-recursive sets.

Słowa kluczowe

EN

recursively enumerable sets; recursive sets; non-recursive sets; enumeration

• Wydawca: Wydawnictwo Uniwersytetu Jagiellońskiego
• Czasopismo: Reports on Mathematical Logic
• Rocznik: 2014
• Tom: Vol. 49
• Strony: 79--97
• Opis fizyczny: Bibliogr. 8 poz.

Twórcy

autor

Mycka J.

• Institute of Mathematics University of Maria Curie-Skłodowska pl. M. Curie-Skłodowskiej 1 20-709 Lublin, Poland

Bibliografia

• [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 University, 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 Mathematical Society, 2012.