English
Related papers

Related papers: On the logical strength of Nash-Williams' theorem …

200 papers

The preservation theorems for semi-properness, hemi-properness, and pseudo-completeness hold for countable support iterations as well as revised countable support iterations, notwithstanding the fact that the "factor lemma" fails for the…

Logic · Mathematics 2009-09-25 Chaz Schlindwein

Invertibility is important in ring theory because it enables division and facilitates solving equations. Moreover, (nonassociative) rings can be endowed with an extra ''structure'' such as order and topology allowing more richness in the…

Commutative Algebra · Mathematics 2025-10-07 Nizar El Idrissi , Hicham Zoubeir

We prove that the Cohesiveness Principle (COH) is $\Pi^1_1$ conservative over $RCA_0 + I\Sigma^0_n$ and over $RCA_0 + B\Sigma^0_n$ for all $n \geq 2$ by recursion-theoretic means. We first characterize COH over $RCA_0 + B\Sigma^0_2$ as a…

Logic · Mathematics 2022-12-27 David R. Belanger

We analyze Ekeland's variational principle in the context of reverse mathematics. We find that that the full variational principle is equivalent to $\Pi^1_1$-${\sf CA}_0$, a strong theory of second-order arithmetic, while natural…

Logic · Mathematics 2020-09-16 David Fernández-Duque , Paul Shafer , Keita Yokoyama

Weighted labelled transition systems are LTSs whose transitions are given weights drawn from a commutative monoid. WLTSs subsume a wide range of LTSs, providing a general notion of strong (weighted) bisimulation. In this paper we extend…

Logic in Computer Science · Computer Science 2013-10-16 Marino Miculan , Marco Peressotti

A result of Kaufmann shows that if $L_\alpha$ is countable, admissible and satisfies $\Pi_n\textsf{-Collection}$, then $\langle L_\alpha, \in \rangle$ has a proper $\Sigma_{n+1}$-elementary end extension. This paper investigates to what…

Logic · Mathematics 2022-01-14 Zachiri McKenzie

We prove the following continuous analogue of Vaught's Two-Cardinal Theorem: if for some $\kappa>\lambda\geq \aleph_0$, a continuous theory $T$ has a model with density character $\kappa$ which has a definable subset of density character…

Logic · Mathematics 2021-10-13 Victoria Noquez

It is well known that ordered exponential fields with a compatible non-trivial valuation cannot be spherically complete, but there are some that are ``complete enough''. This paper gives analogues of Kaplansky's theorem on maximally valued…

Logic · Mathematics 2026-03-06 Pietro Freni

Let d be a positive integer. We show a finiteness theorem for semialgebraic RL triviality of a Nash family of Nash functions defined on a Nash manifold, generalising Benedetti-Shiota's finiteness theorem for semialgebraic RL equivalence…

Algebraic Geometry · Mathematics 2021-06-21 Satoshi Koike , Laurentiu Paunescu

This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…

Logic · Mathematics 2025-10-07 Yong Cheng

Let $A = \{0 = a_0 < a_1 < \cdots < a_{\ell + 1} = b\}$ be a finite set of non-negative integers. We prove that the sumset $NA$ has a certain easily-described structure, provided that $N \geqslant b-\ell$, as recently conjectured by Shakan…

Number Theory · Mathematics 2021-04-01 Andrew Granville , Aled Walker

We show that quasi-projective relation algebras and directed cylindric algebras are equivalent categorialy. We work out a Godels second incompleteness theorem for finite varibale fragments of first order logic. We show that distinct set…

Logic · Mathematics 2013-04-04 Tarek Sayed Ahmed

We formulate and prove Chevalley's theorem in the setting of affine Nash groups. As a consequence, we show that the semi-direct product of two almost linear Nash groups is still an almost linear Nash group.

Representation Theory · Mathematics 2015-06-11 Yingjue Fang , Binyong Sun

The purposes of this note are the following two; we first generalize Okada-Takeuti's well quasi ordinal diagram theory, utilizing the recent result of Dershowitz-Tzameret's version of tree embedding theorem with gap conditions. Second, we…

Logic in Computer Science · Computer Science 2019-02-07 Mitsuhiro Okada , Yuta Takahashi

We prove near-optimal trade-offs for quantifier depth versus number of variables in first-order logic by exhibiting pairs of $n$-element structures that can be distinguished by a $k$-variable first-order sentence but where every such…

Logic in Computer Science · Computer Science 2016-09-02 Christoph Berkholz , Jakob Nordström

We present an analogue of G\"{o}del's second incompleteness theorem for systems of second-order arithmetic. Whereas G\"{o}del showed that sufficiently strong theories that are $\Pi^0_1$-sound and $\Sigma^0_1$-definable do not prove their…

Logic · Mathematics 2022-09-21 James Walsh

We prove that if $ M $ and $ N $ are finitary matroids on a common countable edge set $ E $ then they admit a common independent set $I $ such that there is a bipartition $ E=E_{M}\cup E_{N} $ for which $ I\cap E_M $ spans $ E_M $ in $ M $…

Combinatorics · Mathematics 2021-04-06 Attila Joó

We show that the well-known Konig's Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory $\LA$ with induction restricted to $\Sigma_1^B$ formulas. This is an improvement over…

Logic in Computer Science · Computer Science 2013-03-27 Ariel Fernández , Michael Soltys

A trace on a C*-algebra is amenable (resp. quasidiagonal) if it admits a net of completely positive, contractive maps into matrix algebras which approximately preserve the trace and are approximately multiplicative in the 2-norm (resp.…

Operator Algebras · Mathematics 2018-01-12 Christopher Schafhauser

Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…

Algebraic Geometry · Mathematics 2025-09-03 Andreas Blatter , Jan Draisma , Filip Rupniewski