Reverse Mathematics
From MaRDI portal
Publication:5095937
Recommendations
Cited in
(45)- Reductions and functors from problems to word problems
- Reverse mathematics and Isbell's zig-zag theorem
- scientific article; zbMATH DE number 619555 (Why is no real title available?)
- Reverse mathematics and properties of finite character
- Computable Structure Theory
- Bishop-Style Constructive Reverse Mathematics
- Reverse mathematics and Weihrauch analysis motivated by finite complexity theory
- The Complexity of Satisfaction Problems in Reverse Mathematics
- Reverse Mathematics and Π12 Comprehension
- scientific article; zbMATH DE number 2236630 (Why is no real title available?)
- Alice’s adventures in inverse tan land – mathematical argument, language and proof
- Banach’s theorem in higher-order reverse mathematics
- Chi-Tat Chong’s Work on Reverse Mathematics
- On the complexity of learning programs
- The Ginsburg-Sands theorem and computability theory
- Searching problems above arithmetical transfinite recursion
- Exploring the abyss in Kleene's computability theory
- Reverse mathematics and local rings
- A note on continuous functions on metric spaces
- Connecting real and hyperarithmetical analysis
- On sequential theorems in reverse mathematics
- Big in reverse mathematics: measure and category
- From real analysis to the sorites paradox via reverse mathematics
- Computable formal contexts
- Arrow's theorem, ultrafilters, and reverse mathematics
- Provable better-quasi-orders
- Categories and functors in reverse and computable mathematics
- Indivisibility and uniform computational strength
- The biggest five of reverse mathematics
- Conservation of Ramsey's theorem for pairs and well-foundedness
- On the Weihrauch degree of the additive Ramsey theorem
- Hilbert's tenth problem for term algebras with a substitution operator
- Complemented subsets and Boolean-valued, partial functions
- Defining long words succinctly in FO and MSO
- On the first-order parts of problems in the Weihrauch degrees
- On the existence of infinite monomial division chains with finitely many indeterminates
- On arithmetical numberings in reverse mathematics
- Hybrid maximal filter spaces
- Big in reverse mathematics: the uncountability of the reals
- The adjacent Hindman's theorem and the \(\mathbb{Z}\)-Ramsey's theorem
- Algorithmic randomness and the weak merging of computable probability measures
- A recursive coloring function without _3⁰ solutions for Hindman's theorem
- Reductions of well-ordering principles to combinatorial theorems
- Approximation theorems throughout reverse mathematics
- The tree pigeonhole principle in the Weihrauch degrees
This page was built for publication: Reverse Mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5095937)