scientific article; zbMATH DE number 3536056

zbMath0344.02022MaRDI QIDQ4111536

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Recursively (computably) enumerable sets and degrees (03D25) Proof theory and constructive mathematics (03F99)

Related Items (73)

An inside/outside Ramsey theorem and recursion theory ⋮ Countable sets versus sets that are countable in reverse mathematics ⋮ Minimal bad sequences are necessary for a uniform Kruskal theorem ⋮ Reverse mathematics, well-quasi-orders, and Noetherian spaces ⋮ The computability, definability, and proof theory of Artinian rings ⋮ Representations and the foundations of mathematics ⋮ ON THE UNCOUNTABILITY OF ⋮ Reverse mathematics and parameter-free transfer ⋮ Inductive inference and reverse mathematics ⋮ The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮ Term extraction and Ramsey's theorem for pairs ⋮ THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS ⋮ Iterative Forcing and Hyperimmunity in Reverse Mathematics ⋮ On the strength of Ramsey's theorem ⋮ The Galvin-Prikry theorem and set existence axioms ⋮ A study of singular points and supports of measures in reverse mathematics ⋮ Splittings and disjunctions in reverse mathematics ⋮ Lifting proofs from countable to uncountable mathematics ⋮ THE STRENGTH OF ABSTRACTION WITH PREDICATIVE COMPREHENSION ⋮ Reducing ω-model reflection to iterated syntactic reflection ⋮ To be or not to be constructive, that is not the question ⋮ Structure of semisimple rings in reverse and computable mathematics ⋮ Well ordering principles for iterated \(\Pi^1_1\)-comprehension ⋮ THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH ⋮ RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\) ⋮ Fraïssé’s conjecture in Π11-comprehension ⋮ Prolegomena to virtue-theoretic studies in the philosophy of mathematics ⋮ THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES ⋮ Set-theoretic reflection is equivalent to induction over well-founded classes ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ A measure-theoretic proof of Turing incomparability ⋮ Unnamed Item ⋮ Weak comparability of well orderings and reverse mathematics ⋮ Fixed point theory in weak second-order arithmetic ⋮ Computability-theoretic and proof-theoretic aspects of partial and linear orderings ⋮ The Reverse Mathematics of wqos and bqos ⋮ Reverse mathematics and homeomorphic embeddings ⋮ From Mathesis Universalis to Provability, Computability, and Constructivity ⋮ Reverse mathematics of topology: dimension, paracompactness, and splittings ⋮ On the logical strengths of partial solutions to mathematical problems ⋮ Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation ⋮ How Incomputable is the Separable Hahn-Banach Theorem? ⋮ Ekeland's variational principle in weak and strong systems of arithmetic ⋮ Riesz representation theorem, Borel measures and subsystems of second- order arithmetic ⋮ Set existence axioms for general (not necessarily countable) stability theory ⋮ Connected components of graphs and reverse mathematics ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ Reverse formalism 16 ⋮ Pincherle's theorem in reverse mathematics and computability theory ⋮ On the mathematical and foundational significance of the uncountable ⋮ The reverse mathematics of the Tietze extension theorem ⋮ Patterns of resemblance and Bachmann-Howard fixed points ⋮ Which set existence axioms are needed to prove the separable Hahn-Banach theorem? ⋮ Fragments of arithmetic ⋮ Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem ⋮ Cone avoiding closed sets ⋮ Nets and reverse mathematics ⋮ Computability structure of the Sobolev spaces and its applications ⋮ Reflections on reflections in explicit mathematics ⋮ Bar induction and \(\omega\) model reflection ⋮ Unary Borel functions and second-order arithmetic ⋮ In the Footsteps of Hilbert: The Andréka-Németi Group’s Logical Foundations of Theories in Physics ⋮ Reverse mathematics of the uncountability of \(\mathbb{R}\) ⋮ Countable algebra and set existence axioms ⋮ Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games) ⋮ Reverse mathematics and ordinal exponentiation ⋮ Neo-Logicism and Its Logic ⋮ Bishop-Style Constructive Reverse Mathematics ⋮ Splittings and robustness for the Heine-Borel theorem ⋮ THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC

This page was built for publication: