Ordinal inequalities, transfinite induction, and reverse mathematics

1999 ◽  
Vol 64 (2) ◽  
pp. 769-774 ◽  
Author(s):  
Jeffry L. Hirst
Keyword(s):  
Reverse Mathematics ◽  
Second Order ◽  
Transfinite Induction ◽  
Second Order Arithmetic ◽  
Order Arithmetic ◽  
Induction Scheme

AbstractIf α and β are ordinals, α ≤ β, and β ≰ α then α+ 1 < β. The first result of this paper shows that the restriction of this statement to countable well orderings is provably equivalent to ACA0, a subsystem of second order arithmetic introduced by Friedman. The proof of the equivalence is reminiscent of Dekker's construction of a hypersimple set. An application of the theorem yields the equivalence of the set comprehension scheme ACA0 and an arithmetical transfinite induction scheme.

Reverse Mathematics: The Playground of Logic

2010 ◽  
Vol 16 (3) ◽  
pp. 378-402 ◽  
Author(s):  
Richard A. Shore
Keyword(s):  
Mathematical Logic ◽  
Reverse Mathematics ◽  
Computational Approach ◽  
Second Order ◽  
Second Order Arithmetic ◽  
Base Theory ◽  
Order Arithmetic

AbstractThis paper is essentially the author's Gödel Lecture at the ASL Logic Colloquium '09 in Sofia extended and supplemented by material from some other papers. After a brief description of traditional reverse mathematics, a computational approach to is presented. There are then discussions of some interactions between reverse mathematics and the major branches of mathematical logic in terms of the techniques they supply as well as theorems for analysis. The emphasis here is on ones that lie outside the usual main systems of reverse mathematics. While retaining the usual base theory and working still within second order arithmetic, theorems are described that range from those far below the usual systems to ones far above.

STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES

2016 ◽  
Vol 81 (4) ◽  
pp. 1405-1431 ◽  
Author(s):  
DAMIR D. DZHAFAROV
Keyword(s):  
Reverse Mathematics ◽  
Second Order ◽  
New Techniques ◽  
Ramsey's Theorem ◽  
Second Order Arithmetic ◽  
Ramsey’S Theorem ◽  
Problems And Solutions ◽  
Combinatorial Principles ◽  
Order Arithmetic ◽  
Image Position

AbstractThis paper is a contribution to the growing investigation of strong reducibilities between ${\rm{\Pi }}_2^1$ statements of second-order arithmetic, viewed as an extension of the traditional analysis of reverse mathematics. We answer several questions of Hirschfeldt and Jockusch [13] about Weihrauch (uniform) and strong computable reductions between various combinatorial principles related to Ramsey’s theorem for pairs. Among other results, we establish that the principle $SRT_2^2$ is not Weihrauch or strongly computably reducible to $D_{ < \infty }^2$, and that COH is not Weihrauch reducible to $SRT_{ < \infty }^2$, or strongly computably reducible to $SRT_2^2$. The last result also extends a prior result of Dzhafarov [9]. We introduce a number of new techniques for controlling the combinatorial and computability-theoretic properties of the problems and solutions we construct in our arguments.

NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS

2014 ◽  
Vol 20 (2) ◽  
pp. 170-200 ◽  
Author(s):  
C. T. CHONG ◽  
WEI LI ◽  
YUE YANG
Keyword(s):  
Recursion Theory ◽  
Reverse Mathematics ◽  
Second Order ◽  
Ramsey's Theorem ◽  
Second Order Arithmetic ◽  
Ramsey’S Theorem ◽  
Nonstandard Models ◽  
Combinatorial Principles ◽  
Order Arithmetic ◽  
Effective Computability

AbstractWe give a survey of the study of nonstandard models in recursion theory and reverse mathematics. We discuss the key notions and techniques in effective computability in nonstandard models, and their applications to problems concerning combinatorial principles in subsystems of second order arithmetic. Particular attention is given to principles related to Ramsey’s Theorem for Pairs.

scholarly journals – CA0 and order types of countable ordered groups

2001 ◽  
Vol 66 (1) ◽  
pp. 192-206 ◽  
Author(s):  
Reed Solomon
Keyword(s):  
Group Theory ◽  
Related Problem ◽  
Reverse Mathematics ◽  
Order Type ◽  
Second Order ◽  
Ordered Group ◽  
Second Order Arithmetic ◽  
Ordered Groups ◽  
Countable Ordinal ◽  
Order Arithmetic

Reverse mathematics uses subsystems of second order arithmetic to determine which set existence axioms are required to prove particular theorems. Surprisingly, almost every theorem studied is either provable in RCA0 or equivalent over RCA0 to one of four other subsystems: WKL0, ACA0, ATR0 or – CA0. Of these subsystems, – CA0 has the fewest known equivalences. This article presents a new equivalence of – C0 which comes from ordered group theory.One of the fundamental problems about ordered groups is to classify all possible orders for various classes of orderable groups. In general, this problem is extremely difficult to solve. Mal'tsev [1949] solved a related problem by showing that the order type of a countable ordered group is ℤαℚε where ℤ is the order type of the integers, ℚ is the order type of the rationals, α is a countable ordinal, and ε is either 0 or 1. The goal of this article is to prove that this theorem is equivalent over RCA0 to – CA0.In Section 2, we give the basic definitions and notation for RCA0, ACA0 and CA0 as well as for ordered groups. For more information on reverse mathematics, see Friedman, Simpson, and Smith [1983] or Simpson [1999] and for ordered groups, see Kokorin and Kopytov [1974] or Fuchs [1963]. Our notation will follow these sources. In Section 3, we show that – CA0 suffices to prove Mal'tsev's Theorem and the reversal is done over RCA0 in Section 4.

scholarly journals Multi-sorted version of second order arithmetic

2016 ◽  
Vol 13 (5) ◽  
Author(s):  
Farida Kachapova
Keyword(s):  
Reverse Mathematics ◽  
Peano Arithmetic ◽  
Second Order ◽  
Natural Numbers ◽  
Natural Form ◽  
Second Order Arithmetic ◽  
Arithmetical Truth ◽  
Order Arithmetic

This paper describes axiomatic theories SA and SAR, which are versions of second order arithmetic with countably many sorts for sets of natural numbers. The theories are intended to be applied in reverse mathematics because their multi-sorted language allows to express some mathematical statements in more natural form than in the standard second order arithmetic. We study metamathematical properties of the theories SA, SAR and their fragments. We show that SA is mutually interpretable with the theory of arithmetical truth PATr obtained from the Peano arithmetic by adding infinitely many truth predicates. Corresponding fragments of SA and PATr are also mutually interpretable. We compare the proof-theoretical strengths of the fragments; in particular, we show that each fragment SAs with sorts <=s is weaker than next fragment SAs+1.

Reverse Mathematics and Π12 Comprehension

2005 ◽  
Vol 11 (4) ◽  
pp. 526-533 ◽  
Author(s):  
Carl Mummert ◽  
Stephen G. Simpson
Keyword(s):  
Topological Space ◽  
Metric Space ◽  
Reverse Mathematics ◽  
Second Order ◽  
Converse Statement ◽  
Second Order Arithmetic ◽  
Order Arithmetic ◽  
Complete Separable Metric Space ◽  
Separable Metric Space ◽  
Metrization Theorem

AbstractWe initiate the reverse mathematics of general topology. We show that a certain metrization theorem is equivalent to Π12 comprehension. An MF space is defined to be a topological space of the form MF(P) with the topology generated by {Np ∣ p ϵ P}. Here P is a poset, MF(P) is the set of maximal filters on P, and Np = {F ϵ MF(P) ∣ p ϵ F }. If the poset P is countable, the space MF(P) is said to be countably based. The class of countably based MF spaces can be defined and discussed within the subsystem ACA0 of second order arithmetic. One can prove within ACA0 that every complete separable metric space is homeomorphic to a countably based MF space which is regular. We show that the converse statement, “every countably based MF space which is regular is homeomorphic to a complete separable metric space,” is equivalent to . The equivalence is proved in the weaker system . This is the first example of a theorem of core mathematics which is provable in second order arithmetic and implies Π12 comprehension.

scholarly journals RANDOMNESS NOTIONS AND REVERSE MATHEMATICS

2019 ◽  
Vol 85 (1) ◽  
pp. 271-299
Author(s):  
ANDRÉ NIES ◽  
PAUL SHAFER
Keyword(s):  
Reverse Mathematics ◽  
Second Order ◽  
Second Order Arithmetic ◽  
Existence Principle ◽  
Order Arithmetic ◽  
Image Position

AbstractWe investigate the strength of a randomness notion ${\cal R}$ as a set-existence principle in second-order arithmetic: for each Z there is an X that is ${\cal R}$-random relative to Z. We show that the equivalence between 2-randomness and being infinitely often C-incompressible is provable in $RC{A_0}$. We verify that $RC{A_0}$ proves the basic implications among randomness notions: 2-random $\Rightarrow$ weakly 2-random $\Rightarrow$ Martin-Löf random $\Rightarrow$ computably random $\Rightarrow$ Schnorr random. Also, over $RC{A_0}$ the existence of computable randoms is equivalent to the existence of Schnorr randoms. We show that the existence of balanced randoms is equivalent to the existence of Martin-Löf randoms, and we describe a sense in which this result is nearly optimal.

Nonstandard Arithmetic and Reverse Mathematics

2006 ◽  
Vol 12 (1) ◽  
pp. 100-125 ◽  
Author(s):  
H. Jerome Keisler
Keyword(s):  
Reverse Mathematics ◽  
Second Order ◽  
Second Order Arithmetic ◽  
Natural Counterpart ◽  
Order Arithmetic

AbstractWe show that each of the five basic theories of second order arithmetic that play a central role in reverse mathematics has a natural counterpart in the language of nonstandard arithmetic. In the earlier paper [3] we introduced saturation principles in nonstandard arithmetic which are equivalent in strength to strong choice axioms in second order arithmetic. This paper studies principles which are equivalent in strength to weaker theories in second order arithmetic.

scholarly journals Reverse mathematics and the equivalence of definitions for well and better quasi-orders

2004 ◽  
Vol 69 (3) ◽  
pp. 683-712 ◽  
Author(s):  
Peter Cholak ◽  
Alberto Marcone ◽  
Reed Solomon
Keyword(s):  
Reverse Mathematics ◽  
Second Order ◽  
Base System ◽  
Mathematical Concepts ◽  
Second Order Arithmetic ◽  
Finite Set ◽  
Combinatorial Principles ◽  
Quasi Order ◽  
Order Arithmetic ◽  
Better Quasi Order

In reverse mathematics, one formalizes theorems of ordinary mathematics in second order arithmetic and attempts to discover which set theoretic axioms are required to prove these theorems. Often, this project involves making choices between classically equivalent definitions for the relevant mathematical concepts. In this paper, we consider a number of equivalent definitions for the notions of well quasi-order and better quasi-order and examine how difficult it is to prove the equivalences of these definitions.As usual in reverse mathematics, we work in the context of subsystems of second order arithmetic and take RCA0 as our base system. RCA0 is the subsystem formed by restricting the comprehension scheme in second order arithmetic to formulas and adding a formula induction scheme for formulas. For the purposes of this paper, we will be concerned with fairly weak extensions of RCA0 (indeed strictly weaker than the subsystem ACA0 which is formed by extending the comprehension scheme in RCA0 to cover all arithmetic formulas) obtained by adjoining certain combinatorial principles to RCA0. Among these, the most widely used in reverse mathematics is Weak König's Lemma; the resulting theory WKL0 is extensively documented in [11] and elsewhere.We give three other combinatorial principles which we use in this paper. In these principles, we use k to denote not only a natural number but also the finite set {0, …, k − 1}.

scholarly journals Reverse Mathematics of  Divisibility in Integral  Domains

2021 ◽  
Author(s):  
◽  
Valentin B Bura
Keyword(s):  
Reverse Mathematics ◽  
Second Order ◽  
Ring Theory ◽  
The Other ◽  
Base System ◽  
Integral Domains ◽  
Second Order Arithmetic ◽  
Irreducible Factorization ◽  
Order Arithmetic ◽  
Well Foundedness

<p>This thesis establishes new results concerning the proof-theoretic strength of two classic theorems of Ring Theory relating to factorization in integral domains. The first theorem asserts that if every irreducible is a prime, then every element has at most one decomposition into irreducibles; the second states that well-foundedness of divisibility implies the existence of an irreducible factorization for each element. After introductions to the Algebra framework used and Reverse Mathematics, we show that the first theorem is provable in the base system of Second Order Arithmetic RCA0, while the other is equivalent over RCA0 to the system ACA0.</p>

Sign in / Sign up

Export Citation Format

Share Document