Primitive recursive reverse mathematics (Q6050165)

scientific article; zbMATH DE number 7748763

Language	Label	Description	Also known as
English	Primitive recursive reverse mathematics	scientific article; zbMATH DE number 7748763

Statements

instance of

scholarly article

0 references

title

Primitive recursive reverse mathematics (English)

0 references

0 references

0 references

0 references

Alexander G. Melnikov

0 references

published in

Annals of Pure and Applied Logic

0 references

publication date

12 October 2023

0 references

full work available at URL

https://arxiv.org/abs/2210.13080

0 references

zbMATH Keywords

computability theory

0 references

primitive recursion

0 references

reverse mathematics

0 references

foundations of mathematics

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Computable structures and the hyperarithmetical hierarchy

0 references

Q5711876

0 references

Abelian groups without elements of finite order

0 references

FOUNDATIONS OF ONLINE STRUCTURE THEORY

0 references

REVERSE MATHEMATICS OF FIRST-ORDER THEORIES WITH FINITELY MANY MODELS

0 references

\(\mathsf{WKL}_0\) and induction principles in model theory

0 references

Weihrauch degrees, omniscience principles and weak computability

0 references

Weihrauch Complexity in Computable Analysis

0 references

Punctual categoricity spectra of computably categorical structures

0 references

Effective Borel measurability and reducibility of functions

0 references

Which set existence axioms are needed to prove the separable Hahn-Banach theorem?

0 references

Q3794177

0 references

Q4215631

0 references

On the strength of Ramsey's theorem for pairs

0 references

Q5306365

0 references

Infinite dimensional proper subspaces of computable vector spaces

0 references

The computability, definability, and proof theory of Artinian rings

0 references

Polynomial-time versus recursive models

0 references

Polynomial-time Abelian groups

0 references

Q4249365

0 references

The jump of a Σ n -cut

0 references

Subspaces of computable vector spaces

0 references

Q5155667

0 references

Q4956005

0 references

Handbook of recursive mathematics. Vol. 1: Recursive model theory

0 references

Handbook of recursive mathematics. Vol. 2: Recursive algebra, analysis and combinatorics

0 references

Q2703808

0 references

Q5675350

0 references

Skolem functions and constructive models

0 references

Q3958432

0 references

Weaker cousins of Ramsey's theorem over a weak base theory

0 references

To reorient is easier than to orient: An on-line algorithm for reorientation of graphs

0 references

An inside/outside Ramsey theorem and recursion theory

0 references

Q5224790

0 references

Reverse mathematics and a Ramsey-type König's Lemma

0 references

Countable algebra and set existence axioms

0 references

Q4249726

0 references

On the existence of a connected component of a graph

0 references

How incomputable is the separable Hahn-Banach theorem?

0 references

Proper divisibility in computable rings

0 references

Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))

0 references

Recursively presentable prime models

0 references

Algebraic disguises of \(\Sigma ^ 0_ 1\) induction

0 references

Slicing the Truth

0 references

Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem

0 references

Spectra of structures and relations

0 references

Q4384146

0 references

Separable Banach space theory needs strong set existence axioms

0 references

REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION

0 references

The atomic model theorem and type omitting

0 references

Ramsey's theorem and recursion theory

0 references

Q4001935

0 references

An Effective Version of Dilworth's Theorem

0 references

On-line coloring \(k\)-colorable graphs

0 references

HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?

0 references

Punctual definability on structures

0 references

Algebraic structures computable without delay

0 references

Q4002004

0 references

Things that can and things that cannot be done in PRA

0 references

Applied Proof Theory: Proof Interpretations and Their Use in Mathematics

0 references

On-Line Coloring and Recursive Graph Theory

0 references

Categorical characterizations of the natural numbers require primitive recursion

0 references

An on-line graph coloring algorithm with sublinear performance ratio

0 references

CONSTRUCTIVE ALGEBRAS I

0 references

Q5537372

0 references

COMPUTABLE ABELIAN GROUPS

0 references

Eliminating unbounded search in computable algebra

0 references

The back-and-forth method and computability without delay

0 references

Existence and feasibility in arithmetic

0 references

Q3994907

0 references

Q3884109

0 references

Computable Algebra, General Theory and Theory of Computable Fields

0 references

Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes

0 references

Recursive Colorings of Graphs

0 references

Invariants, Boolean algebras and ACA₀⁺

0 references

Q5703752

0 references

Q3395521

0 references

Baire categoricity and \(\Sigma_1^0\)-induction

0 references

Σ_{𝑛}-bounding and Δ_{𝑛}-induction

0 references

Reverse mathematics and fully ordered groups

0 references

Q4770951

0 references

Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction

0 references

Primitive recursive ordered fields and some applications

0 references

Fixed point theory in weak second-order arithmetic

0 references

Reverse mathematics and Peano categoricity

0 references

Q4485693

0 references

On the strength of Ramsey's theorem without Σ1‐induction

0 references

Identifiers

arXiv ID

2210.13080

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1016/J.APAL.2023.103354

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6050165