English
Related papers

Related papers: The structure of the Mitchell order - II

200 papers

We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite linear order. This partially answers a…

Logic · Mathematics 2021-07-02 Pierre Simon

Assuming an abstract comparison principle called the Ultrapower Axiom, which is motivated by the comparison process of inner model theory and generalizes the statement that the Mitchell order is linear on normal ultrafilters, we…

Logic · Mathematics 2018-01-30 Gabriel Goldberg

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…

Logic in Computer Science · Computer Science 2025-10-22 Tom de Jong , Nicolai Kraus , Fredrik Nordvall Forsberg , Chuangjie Xu

We show that the set of all measures on any measurable space is a complete lattice, i.e. every collection of measures has both a greatest lower bound and a least upper bound.

Functional Analysis · Mathematics 2021-04-15 Senan Sekhon

We give a new proof that there are arbitrarily large indecomposable abelian groups; moreover, the groups constructed are absolutely indecomposable, that is, they remain indecomposable in any generic extension. However, any absolutely rigid…

Logic · Mathematics 2007-05-23 Paul C. Eklof , Saharon Shelah

Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…

Logic · Mathematics 2022-01-28 Gabriel Goldberg

In this paper, we study the well extension of strict(irreflective) partial well orderings. We first prove that any partially well-ordered structure <A, R> can be extended to a well-ordered one. Then we prove that every linear extension of…

Logic in Computer Science · Computer Science 2015-07-28 Haoxiang Lin

In the first part, after showing that the most natural approach to define an order on sets of conformal classes fails, we define a nontrivial order $\leq_2$ on the set of conformal classes of compact Cauchy slabs with fixed past boundary…

Differential Geometry · Mathematics 2025-10-22 Olaf Müller

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

Based on Taylor's hereditarily directed plump ordinals, we define the directed plump ordering on W-types in Martin-L\"of type theory. This ordering is similar to the plump ordering but comes equipped with non-empty finite joins in addition…

Logic in Computer Science · Computer Science 2022-03-21 Daniel Gratzer , Michael Shulman , Jonathan Sterling

We consider different classes of combinatory structures related to Krivine realizability. We show, in the precise sense that they give rise to the same class of triposes, that they are equivalent for the purpose of modeling higher-order…

A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type of the natural numbers -- we call such a linear extension a…

Combinatorics · Mathematics 2012-01-31 Graham Brightwell , Malwina Luczak

Let $\mathfrak{P}$ be a topological property. We study the relation between the order structure of the set of all $\mathfrak{P}$-extensions of a completely regular space $X$ with compact remainder (partially ordered by the standard partial…

General Topology · Mathematics 2015-02-17 M. R. Koushesh

We give sufficient conditions for left- and bi-orderability of fundamental groups of Ore categories in terms of indirect factors, including Thompson groups and many of their generalizations. Besides recovering known results, we prove that…

Group Theory · Mathematics 2025-03-17 Davide Perego , Matteo Tarocchi

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à

We propose a notion of a generalized order, which can be used for the notion of a strict partial order. We introduce a weak order to replace the usual weak order defined from a strict partial order. In a constructive setting, that usual…

Logic · Mathematics 2019-07-29 Jean S. Joseph

We prove from suitable large cardinal hypotheses that the least weakly compact cardinal can be unfoldable, weakly measurable and even nearly $\theta$-supercompact, for any desired $\theta$. In addition, we prove several global results…

Logic · Mathematics 2013-05-28 Brent Cody , Moti Gitik , Joel David Hamkins , Jason Schanker

A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…

Combinatorics · Mathematics 2009-09-25 Jonathan David Farley

If kappa is strongly compact, lambda > kappa is regular, then (2^{< lambda})^+ --> (lambda+eta)^2_theta holds for eta,theta<kappa.

Logic · Mathematics 2007-05-23 Saharon Shelah

We define forcing orders which add witnesses to the failure of various forms of Friedman's Property. These posets behave similarly to the forcing order adding a nonreflecting stationary set but have the advantage of allowing the…

Logic · Mathematics 2024-11-05 Hannes Jakob