English
Related papers

Related papers: A model of second-order arithmetic satisfying AC b…

200 papers

We develop a behavioural theory of reflective sequential algorithms (RSAs), i.e. sequential algorithms that can modify their own behaviour. The theory comprises a set of language-independent postulates defining the class of RSAs, an…

Logic in Computer Science · Computer Science 2023-01-27 Klaus-Dieter Schewe , Flavio Ferrarotti

We study projective stationary sets. The Projective Stationary Reflection principle is the statement that every projective stationary set contains an increasing continuous $\in$--chain of length $\omega_1$. We show that if Martin's Maximum…

Logic · Mathematics 2009-09-25 Qi Feng , Thomas Jech

The Axiom of Choice (AC for short) is the most (in)famous axiom of the usual foundations of mathematics, ZFC set theory. The (non-)essential use of AC in mathematics has been well-studied and thoroughly classified. Now, fragments of…

Logic · Mathematics 2020-11-04 Dag Normann , Sam Sanders

We study a quadruple of interrelated subexponential subsystems of arithmetic WKL$_0^-$, RCA$^-_0$, I$\Delta_0$, and $\Delta$RA$_1$, which complement the similarly related quadruple WKL$_0$, RCA$_0$, I$\Sigma_1$, and PRA studied by Simpson,…

Logic in Computer Science · Computer Science 2017-05-17 Ján Kľuka , Paul J. Voda

We study the reverse mathematics of the theory of countable second-countable topological spaces, with a focus on compactness. We show that the general theory of such spaces works as expected in the subsystem $\mathsf{ACA}_0$ of second-order…

Logic · Mathematics 2011-11-01 François G. Dorais

The Axiom of Dependent Choice $\mathsf{DC}$ and the Axiom of Countable Choice $\mathsf{AC}_\omega$ are two weak forms of the Axiom of Choice that can be stated for a specific set: $\mathsf{DC}(X)$ asserts that any total binary relation on…

Logic · Mathematics 2025-01-07 Alessandro Andretta , Lorenzo Notaro

We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…

Logic · Mathematics 2021-12-16 Anton Freund , Michael Rathjen

We separate the Collection Principle, the Reflection Principle, and the Partial Reflection Principle in ZF with urelements (ZFU), despite their equivalence under the Axiom of Choice. In particular, Collection and the Partial Reflection…

Logic · Mathematics 2026-02-26 Elliot Glazer , Bokai Yao

A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…

Logic · Mathematics 2023-05-16 Alfredo Roque Freire , Kameryn J. Williams

The aim of this short note is to fill in a gap in our earlier paper [16] on 2BSDEs with reflections, and to explain how to correct the subsequent results in the second paper [15]. We also provide more insight on the properties of 2RBSDEs,…

Probability · Mathematics 2020-09-14 Anis Matoussi , Dylan Possamaï , Chao Zhou

Fra\"iss\'e's conjecture (proved by Laver) is implied by the $\Pi^1_1$-comprehension axiom of reverse mathematics, as shown by Montalb\'an. The implication must be strict for reasons of quantifier complexity, but it seems that no better…

Logic · Mathematics 2024-06-21 Anton Freund

We point out the presence of a $T \to -T$ temperature-reflection ($T$-reflection) symmetry for the partition functions of many physical systems. Without knowledge of the origin of the symmetry, we have only been able to test the existence…

High Energy Physics - Theory · Physics 2015-05-20 Gokce Basar , Aleksey Cherman , David A. McGady , Masahito Yamazaki

We show that Brown's lemma is equivalent to Sigma02-induction over RCA0* and that the finite version of Brown's lemma is provable in RCA0 but not in RCA0*.

Logic · Mathematics 2016-03-03 Emanuele Frittaion

The parameter-free part $\text{PA}_2^\ast$ of $\text{PA}_2$, the 2nd order Peano arithmetic, is considered. We make use of a product/iterated Sacks forcing to define an $\omega$-model of $\text{PA}_2^\ast + \text{CA}(\Sigma^1_2)$, in which…

Logic · Mathematics 2022-09-19 Vladimir Kanovei , Vassily Lyubetsky

In the context of reverse mathematics, effective transfinite recursion refers to a principle that allows us to construct sequences of sets by recursion along arbitrary well orders, provided that each set is $\Delta^0_1$-definable relative…

Logic · Mathematics 2021-07-01 Anton Freund

Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…

Logic · Mathematics 2024-03-21 Dag Normann , Sam Sanders

There is no infinite sequence of $\Pi^1_1$-sound extensions of $\mathsf{ACA}_0$ each of which proves $\Pi^1_1$-reflection of the next. This engenders a well-founded ``reflection ranking'' of $\Pi^1_1$-sound extensions of $\mathsf{ACA}_0$.…

Logic · Mathematics 2025-03-27 James Walsh

Let T be a triangulated category with coproducts, C the full subcategory of compact objects in T. If T is the homotopy category of spectra, Adams proved the following in [Adams71]: All contravariant homological functors C --> Ab are the…

Algebraic Topology · Mathematics 2017-07-11 J. Daniel Christensen , Bernhard Keller , Amnon Neeman

In this paper we propose an interpretation for self-referential propositions in a "meta-model" N* of ZF. This meta-model N* is considered as an informal model of arithmetic that mathematicians often use when working with number theory.…

Logic · Mathematics 2019-08-08 Arieh Lev

In this article we proved so-called strong reflection principles corresponding to formal theories Th which has omega-models. An posible generalization of the Lob's theorem is considered.Main results is: (1) let $k$ be an inaccessible…

General Mathematics · Mathematics 2019-10-08 Jaykov Foukzon