中文
相关论文

相关论文: Changing cardinal characteristics without changing…

200 篇论文

Let $M$ be a transitive model of $ZFC$ and let ${\bf B}$ be a $M$-complete Boolean algebra in $M.$ (In general a proper class.) We define a generalized notion of forcing with such Boolean algebras, $^*$forcing. (A $^*$ forcing extension of…

逻辑 · 数学 2016-09-06 Garvin Melles

An earlier paper, entitled "P-hierarchy on $\beta\omega$", investigated the relations between ordinal ultrafilters and the so-called P-hierarchy. This study is continued in the present paper and focuses on the aspects of characterization of…

逻辑 · 数学 2012-11-15 Andrzej Starosolski

We prove forcing axiom equivalents of two families of weakenings of the axiom of choice: a trichotomy principle for cardinals isolated by L\'evy, ${\rm H\hskip0.05pt}_\kappa$, and ${\rm DC}_\kappa$, the principle of dependent choices…

逻辑 · 数学 2025-02-19 Diego Lima Bomfim , Charles Morgan , Samuel Gomes da Silva

Let "ex" be the cardinality of the smallest independent family of subsets of omega (independent means that all nontrivial Boolean combinations are infinite) which cannot be extended to a homogeneous independent family. "Homogeneous" means…

逻辑 · 数学 2009-09-25 Martin Goldstern , Saharon Shelah

If we assume the axiom of choice, then every two cardinal numbers are comparable. In the absence of the axiom of choice, this is no longer so. For a few cardinalities related to an arbitrary infinite set, we will give all the possible…

逻辑 · 数学 2007-05-23 Lorenz Halbeisen , Saharon Shelah

We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the…

逻辑 · 数学 2017-09-26 Milos S. Kurilic

The landmark Levy-Solovay Theorem limits the kind of large cardinal embeddings that can exist in a small forcing extension. Here I announce a generalization of this theorem to a broad new class of forcing notions. One consequence is that…

逻辑 · 数学 2007-05-23 Joel David Hamkins

This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…

逻辑 · 数学 2020-08-12 Corey Bacal Switzer

Let $\Gamma^\infty$ be the set of all universally Baire sets of reals. Inspired by recent work of the second author and Nam Trang, we introduce a new technique for establishing generic absoluteness results for models containing…

逻辑 · 数学 2025-04-16 Sandra Müller , Grigor Sargsyan

Combining creature forcing approaches from arXiv:1003.3425 and arXiv:1402.0367, we show that, under CH, there is a proper $\omega^\omega$-bounding poset with $\aleph_2$-cc that forces continuum many pairwise different cardinal…

In this paper, we establish an analogue of Craig Interpolation Property for a many-sorted variant of first-order hybrid logic. We develop a forcing technique that dynamically adds new constants to the underlying signature in a way that…

计算机科学中的逻辑 · 计算机科学 2026-05-08 Daniel Găină , Go Hashimoto

We introduce a forcing that adds a $\square(\aleph_2,\aleph_0)$-sequence with countable conditions under CH. Assuming the consistency of a weakly compact cardinal, we can find a forcing extension by our new poset in which both…

逻辑 · 数学 2026-03-17 Maxwell Levine

We present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…

逻辑 · 数学 2016-06-10 John Krueger

We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…

计算机科学中的逻辑 · 计算机科学 2025-09-03 Go Hashimoto , Daniel Găină

Recently, a number of interesting relations have been discovered between generalised Pauli/Dirac groups and certain finite geometries. Here, we succeeded in finding a general unifying framework for all these relations. We introduce…

数学物理 · 物理学 2009-10-13 Hans Havlicek , Boris Odehnal , Metod Saniga

We show that Vopenka's Principle and Vopenka cardinals are indestructible under reverse Easton forcing iterations of increasingly directed-closed partial orders, without the need for any preparatory forcing. As a consequence, we are able to…

逻辑 · 数学 2012-02-28 Andrew D. Brooke-Taylor

We give a detailed proof of the properties of the usual Prikry type forcing notion for turning a measurable cardinal into $\aleph_\omega$.

逻辑 · 数学 2019-02-20 Mohammad Golshani

We introduce a new covering property, defined in terms of order types of sequences of open sets, rather than in terms of cardinalities of families. The most general form of this compactness notion depends on two ordinal parameters. In the…

一般拓扑 · 数学 2021-02-09 Paolo Lipparini

It is well known that pretameness implies the forcing theorem, and that pretameness is characterized by the preservation of the axioms of $\mathsf{ZF}^-$, that is $\mathsf{ZF}$ without the power set axiom, or equivalently, by the…

逻辑 · 数学 2017-10-31 Peter Holy , Regula Krapf , Philipp Schlicht

An infinite linearly ordered set (S,<=) is called doubly homogeneous if its automorphism group A(S) acts 2-transitively on it. We show that any group G arises as outer automorphism group G cong Out(A(S)) of the automorphism group A(S), for…

群论 · 数学 2007-05-23 Manfred Droste , Saharon Shelah