English
Related papers

Related papers: Forcing With Copies of Countable Ordinals

200 papers

We give an example of iteration of length omega of (<kappa)-complete kappa^+-cc forcing notions with the limit collapsing kappa^+. The construction is decoded from the proof of Shelah [Proper and Improper Forcing, Appendix, Theorem 3.6(1)].

Logic · Mathematics 2018-08-07 Andrzej Roslanowski

Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…

Logic in Computer Science · Computer Science 2015-07-01 Alexis Bes , Alexander Rabinovich

Assuming $\mathfrak b = \mathfrak c$ (or some weaker statement), we construct a compactification $\gamma\omega$ of $\omega$ such that its remainder $\gamma\omega\setminus\omega$ is nonseparable and carries a strictly positive measure.

General Topology · Mathematics 2015-01-29 Piotr Drygier , Grzegorz Plebanek

We study the divided power structures over a product of operads with distributive law. We give a systematic method to characterise the divided power algebras over such a product from the structures of divided power algebra coming from each…

Algebraic Topology · Mathematics 2021-07-28 Sacha Ikonicoff

In [5], Hjorth proved that for every countable ordinal $\alpha$, there exists a complete $\mathcal{L}_{\omega_1,\omega}$-sentence $\phi_\alpha$ that has models of all cardinalities less than or equal to $\aleph_\alpha$, but no models of…

Logic · Mathematics 2021-09-16 Philipp Lücke , Ioannis Souldatos

For every odd prime $p$ and every integer $n\geq 12$ there is a Heisenberg group of order $p^{5n/4+O(1)}$ that has $p^{n^2/24+O(n)}$ pairwise nonisomorphic quotients of order $p^{n}$. Yet, these quotients are virtually indistinguishable.…

Group Theory · Mathematics 2015-01-23 Mark L. Lewis , James B. Wilson

An $integral$ of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. This paper continues the investigation on integrals of groups started in the work arXiv:1803.10179. We study: (1) A sufficient condition for a bound…

Group Theory · Mathematics 2024-05-29 João Araújo , Peter J. Cameron , Carlo Casolo , Francesco Matucci , Claudio Quadrelli

Let $\Gamma^{+}$ be the positive cone in a totally ordered abelian group $\Gamma$, and $\alpha$ an action of $\Gamma^{+}$ by extendible endomorphisms of a $C^{\ast}$-algebra $A$. Suppose $I$ is an extendible $\alpha$-invariant ideal of $A$.…

Operator Algebras · Mathematics 2015-04-17 Sriwulan Adji , Saeid Zahmatkesh

Given a partially ordered set $P$ there exists the most general Boolean algebra $F(P)$ which contains $P$ as a generating set, called the {\it free Boolean algebra} over $P$. We study free Boolean algebras over posets of the form $P=P_0\cup…

General Topology · Mathematics 2012-10-23 Robert Bonnet , Latifa Faouzi , Wiesław Kubiś

We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…

Logic in Computer Science · Computer Science 2019-01-11 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

The continued fraction expansion of an irrational number $\alpha$ is eventually periodic if and only if $\alpha$ is a quadratic irrationality. However, very little is known regarding the size of the partial quotients of algebraic real…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski , Yann Bugeaud

For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…

Logic · Mathematics 2019-03-27 David Fernández-Bretón , Elizabeth Lauri

We discuss some highlights of our computer-verified proof of the construction, given a countable transitive set-model $M$ of $\mathit{ZFC}$, of generic extensions satisfying $\mathit{ZFC}+\neg\mathit{CH}$ and $\mathit{ZFC}+\mathit{CH}$.…

We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…

Logic in Computer Science · Computer Science 2013-08-14 Carlo A. Furia

We introduce the idea of a coherent adequate set of models, which can be used as side conditions in forcing. As an application we define a forcing poset which adds a square sequence on $\omega_2$ using finite conditions.

Logic · Mathematics 2014-06-13 John Krueger

We establish the equidistribution of the sequence of the averaged pullbacks of a Dirac measure at any value in $\mathbb{C}\setminus\{0\}$ under the derivatives of the iterations of a polynomials $f\in\mathbb{C}[z]$ of degree more than one…

Complex Variables · Mathematics 2016-11-16 Yûsuke Okuyama

Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…

Logic · Mathematics 2024-07-22 Iian B. Smythe

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

Logic in Computer Science · Computer Science 2020-04-14 Patrick Cegielski , Serge Grigorieff , Irene Guessarian

P-algebras are a non-commutative, non-associative generalization of Boolean algebras that are for quantum logic what Boolean algebras are for classical logic. P-algebras have type <X, 0, ', .> where 0 is a constant, ' is unary and . is…

Quantum Physics · Physics 2024-08-16 Daniel Lehmann

The class forcing theorem, which asserts that every class forcing notion $\mathbb{P}$ admits a forcing relation $\Vdash_{\mathbb{P}}$, that is, a relation satisfying the forcing relation recursion -- it follows that statements true in the…