On definable sets of positive integers

DOI10.4064/FM-34-1-81-112MaRDI QIDQ5787743zbMATH OpenOpenAlexFDO

Authors Andrzej Mostowski

Publication date 1947

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/213118

zbMATH Keywords

Philosophy and foundations

Cited in

(19)

• Zur Theorie der konstruktiven Wohlordnungen
• 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
• Using computability to measure complexity of algebraic structures and classes of structures
• Kleene’s Amazing Second Recursion Theorem
• 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
• Recursion-theoretic ranking and compression
• A View of Revival of Mathematical Logic in Warsaw, 1945–1975

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)