English
Related papers

Related papers: Destroying Saturation while Preserving Presaturati…

200 papers

Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct…

Commutative Algebra · Mathematics 2019-02-20 Thomas Kahle , Ezra Miller , Christopher O'Neill

We present a method to iterate finitely splitting lim-sup tree forcings along non-wellfounded linear orders. We apply this method to construct a forcing (without using an inaccessible or amalgamation) that makes all definable sets of reals…

Logic · Mathematics 2011-10-18 Jakob Kellner , Saharon Shelah

In [6] we proved that the universal theory of infinite free lattices is (algorithmically) decidable, leaving open the problem of decidability of the full theory of an (infinite) free lattice. We solve this problem by proving that, for every…

Logic · Mathematics 2025-11-18 J. B. Nation , Gianluca Paolini

We use Shelah's theory of possible cofinalities in order to solve a problem about ultrafilters. THEOREM. Suppose that $ \lambda $ is a singular cardinal, $ \lambda ' < \lambda $, and the ultrafilter $D$ is $ \kappa $-decomposable for all…

Logic · Mathematics 2009-04-05 Paolo Lipparini

We consider nonlinear optimization problems with cardinality constraints. Based on a continuous reformulation we introduce second order necessary and sufficient optimality conditions. Under such a second order condition, we can guarantee…

Optimization and Control · Mathematics 2017-09-06 Max Bucher , Alexandra Schwartz

In this work we extend the concept of the Lipschitz saturation of an ideal defined in [5] to the context of modules in some different ways, and we prove they are generically equivalent.

Algebraic Geometry · Mathematics 2020-12-23 Terence Gaffney , Thiago F. da Silva

In this paper we address a problem posed by Shelah in 1999 to find a suitable notion for superstability for abstract elementary classes in which limit models of cardinality $\mu$ are saturated. Theorem 1. Suppose that $\mathcal{K}$ is a…

Logic · Mathematics 2015-02-18 Monica VanDieren

$\mathbf{Theorem.}$ Let $K$ be an abstract elementary class (AEC) with amalgamation and no maximal models. Let $\lambda > \text{LS} (K)$. If $K$ is categorical in $\lambda$, then the model of cardinality $\lambda$ is Galois-saturated. This…

Logic · Mathematics 2017-08-08 Sebastien Vasey

We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…

Logic · Mathematics 2013-12-25 Saharon Shelah

We analyze possibilities of second-order quantifier elimination for formulae containing parameters -- constants or functions. For this, we use a constraint resolution calculus obtained from specializing the hierarchical superposition…

Logic in Computer Science · Computer Science 2021-07-07 Dennis Peuter , Philipp Marohn , Viorica Sofronie-Stokkermans

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

Logic in Computer Science · Computer Science 2014-11-04 Danko Ilik

In this work we study how nonminimally coupled theories of gravity modify the usual Friedmann equation, and develop two methods to treat these. The ambiguity in the form of the Lagrangian density of a perfect fluid is emphasized, and the…

General Relativity and Quantum Cosmology · Physics 2015-06-18 Orfeu Bertolami , Jorge Páramos

We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…

Logic · Mathematics 2026-05-05 Radek Honzik

Under the assumption that $\delta$ is a Woodin cardinal and $\GCH$ holds, I show that if $F$ is any class function from the regular cardinals to the cardinals such that (1) $\kappa<\cf(F(\kappa))$, (2) $\kappa<\lambda$ implies…

Logic · Mathematics 2012-07-31 Brent Cody

We show that Shelah cardinals are preserved under the canonical $GCH$ forcing notion. We also show that if $GCH$ holds and $F:REG\rightarrow CARD$ is an Easton function which satisfies some weak properties, then there exists a cofinality…

Logic · Mathematics 2016-09-28 Mohammad Golshani

Remarkable cardinals were introduced by Schindler, who showed that the existence of a remarkable cardinal is equiconsistent with the assertion that the theory of $L(\mathbb R)$ is absolute for proper forcing. Here, we study the…

Logic · Mathematics 2015-06-10 Yong Cheng , Victoria Gitman

We try to control many cardinal characteristics by working with a notion of orthogonality between two families of forcings. We show that b^+<g is consistent

Logic · Mathematics 2007-05-23 Heike Mildenberger , Saharon Shelah

It is elementary and well-known that if an element x of a bounded modular lattice L has a complement in L then x has a relative complement in every interval [a,b] containing x. We show that the relatively strong assumption of modularity of…

Combinatorics · Mathematics 2021-07-13 Ivan Chajda , Helmut Länger

This dissertation includes many theorems which show how to change large cardinal properties with forcing. I consider in detail the degrees of inaccessible cardinals (an analogue of the classical degrees of Mahlo cardinals) and provide new…

Logic · Mathematics 2015-06-15 Erin Carmody

Assuming the P-ideal dichotomy, we attempt to isolate those cardinal characteristics of the continuum that are correlated with two well-known consequences of the proper forcing axiom. We find a cardinal invariant $\mathfrak{x}$ such that…

Logic · Mathematics 2013-05-27 Dilip Raghavan , Stevo Todorcevic