English
Related papers

Related papers: A note on the Revised GCH

200 papers

Elimination of a single Skolem function in pure logic increases the length of proofs only linearly. The result is shown for derivations with cuts that are free for the Skolem function in a sequent calculus with strong locality property.

Logic · Mathematics 2022-05-11 Ján Komara

We introduce the notion of additive filter and present a new proof of the existence of idempotent ultrafilters on N without any use of Zorn's Lemma, and where one only assumes the Ultrafilter Theorem for the continuum.

Logic · Mathematics 2017-01-13 Mauro Di Nasso , Eleftherios Tachtsis

Asaf Karagila pointed out that Remark 3.4 [1], directly contradicts Theorem 3.3 (c) [2] which was incorrectly stated. This note contains a proof of this remark. [1] Miller, Arnold W.; A Dedekind Finite Borel Set, Arch. Math. Logic 50…

Logic · Mathematics 2015-10-01 Arnold W. Miller

We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…

Logic · Mathematics 2016-02-02 Tapani Hyttinen , Vadim Kulikov , Miguel Moreno

Using Shelah's revised GCH theorem we prove that if mu<beth_omega <= lambda are cardinals, then every mu-almost disjoint subfamily B of [lambda]^{beth_omega} is essentially disjoint, i.e. for each b from B there is a subset f(b) of b of…

Logic · Mathematics 2022-09-22 Lajos Soukup

In a recent paper [5] a smooth function f : [0; 1] --> R with all derivatives vanishing at 0 has been considered and a global condition, showing that f is indeed identically 0, has been presented. The purpose of this note is to replace the…

History and Overview · Mathematics 2020-08-28 Carlo Benassi , Michela Eleuteri

With infinitely many high-quality data points, infinite computational power, an infinitely large foundation model with a perfect training algorithm and guaranteed zero generalization error on the pretext task, can the model be used for…

Artificial Intelligence · Computer Science 2026-04-27 Yang Yuan

Starting from large cardinals we construct a model of $ZFC$ in which the $GCH$ fails everywhere, but such that $GCH$ holds in its $HOD$. The result answers a question of Sy Friedman. Also, relative to the existence of large cardinals, we…

Logic · Mathematics 2015-12-22 Mohammad Golshani

We study some topics about \L o\'s's theorem without assuming the Axiom of Choice. We prove that \L o\'s's fundamental theorem of ultraproducts is equivalent to a weak form that every ultrapower is elementary equivalent to its source…

Logic · Mathematics 2024-08-13 Toshimichi Usuba

In this paper, we first give a new simple proof to the elimination theorem of definite fold by homotopy for generic smooth maps of manifolds of dimension strictly greater than $2$ into the $2$--sphere or into the real projective plane. Our…

Geometric Topology · Mathematics 2018-04-03 Osamu Saeki

Assuming the existence of suitable large cardinals, we show it is consistent that the Provability logic $\mathbf{GL}$ is complete with respect to the filter sequence of normal measures. This result answers a question of Andreas Blass from…

Logic · Mathematics 2023-02-24 Mohammad Golshani , Reihane Zoghifard

Andrew Wiles' proof of Fermat's Last Theorem, with an assist from Richard Taylor, focused renewed attention on the foundational question of whether the use of Grothendieck's Universes in number theory entails that the results proved…

Logic · Mathematics 2023-09-15 William H. Wheeler

We prove: $\mathbf{Theorem}$ Let $K$ be a universal class. If $K$ is categorical in cardinals of arbitrarily high cofinality, then $K$ is categorical on a tail of cardinals. The proof stems from ideas of Adi Jarden and Will Boney, and also…

Logic · Mathematics 2017-06-12 Sebastien Vasey

The authors and Fischer recently proved that any hereditary property of two-dimensional matrices (where the row and column order is not ignored) over a finite alphabet is testable with a constant number of queries, by establishing the…

Combinatorics · Mathematics 2017-06-14 Noga Alon , Omri Ben-Eliezer

The article has been withdrawn by the author. Wolfgang Lueck and Peter Linnell pointed out that the proof of Lemma 3.8 does not apply to the unrestricted case of wreath product. It is not clear at this stage how to complete the proof of…

Geometric Topology · Mathematics 2007-07-19 S. K. Roushon

We prove, via transfinite recursion, the existence, inside any linearly ordered set of appropriate regular cardinality $\lambda$, of a particular kind of well-ordered subsets characterized by the property of $\lambda$-fullness. Let $H$ be a…

Logic · Mathematics 2024-03-26 Gabriele Gullà

The best-known version of Shelah's celebrated singular cardinal compactness theorem states that if the cardinality of an abelian group is singular, and all its subgroups of lesser cardinality are free, then the group itself is free. The…

Category Theory · Mathematics 2016-01-19 Tibor Beke , Jiri Rosicky

We construct a model of the form $L[A,U]$ that exhibits the simplest structural behavior of $\sigma$-complete ultrafilters in a model of set theory with a single measurable cardinal $\kappa$ , yet satisfies $2^\kappa = \kappa^{++}$. This…

Logic · Mathematics 2024-12-10 Omer Ben-Neria , Eyal Kaplan

Continuing [Fuchino, Ottenbreit and Sakai[9, 10]] and [Fuchino and Ottenbreit[11]], we further study reflection principles in connection with the L\"owenheim-Skolem Theorems of stationary logics. In this paper, we mainly analyze the…

We improve upon a recent result of Culler and Dunfield on orderability of certain Dehn fillings by removing a difficult condition they required.

Geometric Topology · Mathematics 2018-07-03 Christopher Herald , Xingru Zhang
‹ Prev 1 3 4 5 6 7 10 Next ›