scientific article; zbMATH DE number 2236640
From MaRDI portal
Publication:5711891
zbMath1097.03053MaRDI QIDQ5711891
Publication date: 8 December 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (63)
Proof mining in \(L_{1}\)-approximation ⋮ Reverse mathematics and Weihrauch analysis motivated by finite complexity theory ⋮ Countable sets versus sets that are countable in reverse mathematics ⋮ Reverse Mathematics: The Playground of Logic ⋮ Dirk Jan Struik and his contributions to the history of mathematics ⋮ Fundamental notions of analysis in subsystems of second-order arithmetic ⋮ Representations and the foundations of mathematics ⋮ Measure theory and higher order arithmetic ⋮ TRANSFINITE RECURSION IN HIGHER REVERSE MATHEMATICS ⋮ ON THE UNCOUNTABILITY OF ⋮ Refining the taming of the reverse mathematics zoo ⋮ Reverse mathematics and parameter-free transfer ⋮ Open Questions in Reverse Mathematics ⋮ Betwixt Turing and Kleene ⋮ Between Turing and Kleene ⋮ Term extraction and Ramsey's theorem for pairs ⋮ Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$ ⋮ Program extraction for 2-random reals ⋮ Determinacy in third order arithmetic ⋮ Splittings and disjunctions in reverse mathematics ⋮ Lifting proofs from countable to uncountable mathematics ⋮ Equivalence of bar induction and bar recursion for continuous functions with continuous moduli ⋮ Banach’s theorem in higher-order reverse mathematics ⋮ Arithmetical conservation results ⋮ To be or not to be constructive, that is not the question ⋮ Mixed Nash equilibria for continuous games and reverse mathematics ⋮ A variant of Mathias forcing that preserves \(\mathsf{ACA}_0\) ⋮ A note on equality in finite‐type arithmetic ⋮ The non-normal abyss in Kleene's computability theory ⋮ On the computational properties of the uncountability of the real numbers ⋮ ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ Primitive recursion and the chain antichain principle ⋮ Unnamed Item ⋮ THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES ⋮ Classical consequences of continuous choice principles from intuitionistic analysis ⋮ A note on non-classical nonstandard arithmetic ⋮ From Nonstandard Analysis to Various Flavours of Computability Theory ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 ⋮ Reverse mathematics of topology: dimension, paracompactness, and splittings ⋮ ERNA and Friedman's Reverse Mathematics ⋮ TRIAL AND ERROR MATHEMATICS II: DIALECTICAL SETS AND QUASIDIALECTICAL SETS, THEIR DEGREES, AND THEIR DISTRIBUTION WITHIN THE CLASS OF LIMIT SETS ⋮ On the indecomposability of \(\omega^n\) ⋮ Using Ramsey's theorem once ⋮ On Tao's “finitary” infinite pigeonhole principle ⋮ On Brouwer's continuity principle ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ Partition Theorems and Computability Theory ⋮ A computable version of Banach's inverse mapping theorem ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ Reverse formalism 16 ⋮ Pincherle's theorem in reverse mathematics and computability theory ⋮ On the mathematical and foundational significance of the uncountable ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Dependent choice as a termination principle ⋮ Weihrauch and constructive reducibility between existence statements ⋮ Nets and reverse mathematics ⋮ The strength of compactness in computability theory and nonstandard analysis ⋮ ON IDEMPOTENT ULTRAFILTERS IN HIGHER-ORDER REVERSE MATHEMATICS ⋮ Non-branching degrees in the Medvedev lattice of Π10 classes ⋮ Reverse mathematics of the uncountability of \(\mathbb{R}\) ⋮ Parallelizations in Weihrauch reducibility and constructive reverse mathematics ⋮ Splittings and robustness for the Heine-Borel theorem
This page was built for publication:
