On definable sets of positive integers
From MaRDI portal
Publication:5787743
DOI10.4064/fm-34-1-81-112zbMath0031.19401OpenAlexW4239495391MaRDI QIDQ5787743
Publication date: 1947
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/213118
Related Items (18)
Classes of Recursively Enumerable Sets and Their Decision Problems ⋮ Some characterizations of the first-order functional calculus ⋮ Some concepts concerning formal systems of number theory ⋮ Zur Theorie der konstruktiven Wohlordnungen ⋮ Index sets related to prompt simplicity ⋮ Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic ⋮ The incompleteness theorems after 70 years ⋮ Hierarchies of number-theoretic predicates ⋮ A View of Revival of Mathematical Logic in Warsaw, 1945–1975 ⋮ All Quantifiers Versus the Quantifier All ⋮ Recursion-theoretic ranking and compression ⋮ Hyperarithmetical Sets ⋮ Using computability to measure complexity of algebraic structures and classes of structures ⋮ In memory of Andrzej Mostowski ⋮ Arithmetical Predicates and Function Quantifiers ⋮ Kleene’s Amazing Second Recursion Theorem ⋮ Computing degrees of unsolvability ⋮ Some Theorems on Classes of Recursively Enumerable Sets
This page was built for publication: On definable sets of positive integers
