On definable sets of positive integers
From MaRDI portal
Publication:5787743
DOI10.4064/FM-34-1-81-112zbMATH Open0031.19401OpenAlexW4239495391MaRDI QIDQ5787743FDOQ5787743
Publication date: 1947
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/213118
Cited In (19)
- In memory of Andrzej Mostowski
- All Quantifiers Versus the Quantifier All
- Arithmetical Predicates and Function Quantifiers
- Hierarchies of number-theoretic predicates
- Hyperarithmetical Sets
- Some characterizations of the first-order functional calculus
- Kleene’s Amazing Second Recursion Theorem
- Using computability to measure complexity of algebraic structures and classes of structures
- Computing degrees of unsolvability
- 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
- Classes of Recursively Enumerable Sets and Their Decision Problems
- Some concepts concerning formal systems of number theory
- Some Theorems on Classes of Recursively Enumerable Sets
- Iterated priority arguments in descriptive set theory
- Index sets related to prompt simplicity
- A View of Revival of Mathematical Logic in Warsaw, 1945–1975
- Recursion-theoretic ranking and compression
- Zur Theorie der konstruktiven Wohlordnungen
This page was built for publication: On definable sets of positive integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5787743)
