Primitive recursive reverse mathematics
From MaRDI portal
Publication:6050165
DOI10.1016/j.apal.2023.103354arXiv2210.13080MaRDI QIDQ6050165
Nikolay Bazhenov, Marta Fiori-Carones, Alexander G. Melnikov, Lu Liu
Publication date: 12 October 2023
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.13080
Foundations of classical theories (including reverse mathematics) (03B30) Recursive functions and relations, subrecursive hierarchies (03D20) Second- and higher-order arithmetic and fragments (03F35) Computable structure theory, computable model theory (03C57) Computation over the reals, computable analysis (03D78)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinite dimensional proper subspaces of computable vector spaces
- Categorical characterizations of the natural numbers require primitive recursion
- Proper divisibility in computable rings
- Algebraic structures computable without delay
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
- Primitive recursive ordered fields and some applications
- Fixed point theory in weak second-order arithmetic
- How incomputable is the separable Hahn-Banach theorem?
- Countable algebra and set existence axioms
- Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
- An on-line graph coloring algorithm with sublinear performance ratio
- Polynomial-time versus recursive models
- Polynomial-time Abelian groups
- Skolem functions and constructive models
- On-line coloring \(k\)-colorable graphs
- Handbook of recursive mathematics. Vol. 1: Recursive model theory
- Handbook of recursive mathematics. Vol. 2: Recursive algebra, analysis and combinatorics
- Computable structures and the hyperarithmetical hierarchy
- The computability, definability, and proof theory of Artinian rings
- Which set existence axioms are needed to prove the separable Hahn-Banach theorem?
- Reverse mathematics and Peano categoricity
- Things that can and things that cannot be done in PRA
- Eliminating unbounded search in computable algebra
- Punctual definability on structures
- Punctual categoricity spectra of computably categorical structures
- Weaker cousins of Ramsey's theorem over a weak base theory
- The back-and-forth method and computability without delay
- \(\mathsf{WKL}_0\) and induction principles in model theory
- Baire categoricity and \(\Sigma_1^0\)-induction
- Subspaces of computable vector spaces
- Algebraic disguises of \(\Sigma ^ 0_ 1\) induction
- Abelian groups without elements of finite order
- On the strength of Ramsey's theorem for pairs
- COMPUTABLE ABELIAN GROUPS
- REVERSE MATHEMATICS OF FIRST-ORDER THEORIES WITH FINITELY MANY MODELS
- Weihrauch degrees, omniscience principles and weak computability
- Effective Borel measurability and reducibility of functions
- Slicing the Truth
- On the existence of a connected component of a graph
- Spectra of structures and relations
- Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
- The atomic model theorem and type omitting
- An Effective Version of Dilworth's Theorem
- Recursively presentable prime models
- Recursive Colorings of Graphs
- On-Line Coloring and Recursive Graph Theory
- Separable Banach space theory needs strong set existence axioms
- Σ_{𝑛}-bounding and Δ_{𝑛}-induction
- Reverse mathematics and a Ramsey-type König's Lemma
- On the strength of Ramsey's theorem without Σ1‐induction
- REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION
- Weihrauch Complexity in Computable Analysis
- An inside/outside Ramsey theorem and recursion theory
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- The jump of a Σ n -cut
- CONSTRUCTIVE ALGEBRAS I
- Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Computable Algebra, General Theory and Theory of Computable Fields
- Existence and feasibility in arithmetic
- Ramsey's theorem and recursion theory
- Invariants, Boolean algebras and ACA₀⁺
- To reorient is easier than to orient: An on-line algorithm for reorientation of graphs
- Reverse mathematics and fully ordered groups
- HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?
This page was built for publication: Primitive recursive reverse mathematics
