English
Related papers

Related papers: Indestructible Guessing Models and the Continuum

200 papers

Building on ideas of Gurevich and Shelah for the G\"odel Class, we present a new probabilistic proof of the finite model property for the Guarded Fragment of First-Order Logic. Our proof is conceptually simple and yields the optimal…

Logic in Computer Science · Computer Science 2026-05-29 Oskar Fiuk

We prove that for any superatomic Boolean Algebra of cardinality >beth_omega there is an automorphism moving uncountably many atoms. Similarly for larger cardinals. Any of those results are essentially best possible.

Logic · Mathematics 2007-05-23 Saharon Shelah

Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…

Logic · Mathematics 2007-05-23 Bernhard Koenig

For a large class of nonuniformly expanding maps of $\Bbb R^m$, with indifferent fixed points and unbounded distorsion and non necessarily Markovian, we construct an absolutely continuous invariant measure. We extend to our case techniques…

Dynamical Systems · Mathematics 2007-05-23 Huyi Hu , Sandro Vaienti

We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…

Logic · Mathematics 2016-06-06 Matthew Harrison-Trainor , Gregory Igusa , Julia F. Knight

The Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all positive existential formulas, can express the first-order translations of basic modal logic and of many description logics, along with many sentences…

Logic in Computer Science · Computer Science 2020-05-15 Vince Barany , Michael Benedikt , Balder ten Cate

We consider the space of countable structures with fixed underlying set in a given countable language. We show that the number of ergodic probability measures on this space that are $S_\infty$-invariant and concentrated on a single…

We show that if $\gamma \in \omega \cup \{\aleph_{0}\}$ and $\mathcal{A}$ is a counterexample to the analytic Vaught conjecture having exactly $\gamma$ many models of Scott rank $\omega_{1}$, then there exists a club $C \subseteq…

Logic · Mathematics 2019-03-26 Paul Larson , Saharon Shelah

Assuming the continuum hypothesis there is an inseparable sequence of length omega_1 that contains no Lusin subsequence, while if Martin's Axiom and the negation of CH is assumed then every inseparable sequence (of length omega_1) is a…

Logic · Mathematics 2009-09-25 Uri Abraham , Saharon Shelah

In this paper we prove that from large cardinals it is consistent that there is a singular strong limit cardinal $\nu$ such that the singular cardinal hypothesis fails at $\nu$ and every collection of fewer than $\mathrm{cf}(\nu)$…

Logic · Mathematics 2023-09-13 Omer Ben-Neria , Yair Hayut , Spencer Unger

A pointwise definable model is one in which every object is definable without parameters. In a model of set theory, this property strengthens V=HOD, but is not first-order expressible. Nevertheless, if ZFC is consistent, then there are…

Logic · Mathematics 2012-06-20 Joel David Hamkins , David Linetsky , Jonas Reitz

Standard Gaussian graphical models (GGMs) implicitly assume that the conditional independence among variables is common to all observations in the sample. However, in practice, observations are usually collected form heterogeneous…

Methodology · Statistics 2010-01-26 Abel Rodriguez , Alex Lenkoski , Adrian Dobra

Let $\Gamma$ be the fundamental group of a closed orientable surface of genus at least two. Consider the composition of a uniformly random element of $\mathrm{Hom}(\Gamma,S_n)$ with the $(n-1)$-dimensional irreducible representation of…

Geometric Topology · Mathematics 2025-04-30 Michael Magee , Doron Puder , Ramon van Handel

We study various classes of maximality principles, $\rm{MP}(\kappa,\Gamma)$, introduced by J.D. Hamkins, where $\Gamma$ defines a class of forcing posets and $\kappa$ is a cardinal. We explore the consistency strength and the relationship…

Logic · Mathematics 2017-04-18 Daisuke Ikegami , Nam Trang

The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a…

Logic in Computer Science · Computer Science 2016-08-05 Amelia Harrison , Vladimir Lifschitz

We establish convergence to an invariant measure as time tends to infinity, for a large class of (possibly non-Markovian) stochastic volatility models. Our arguments are based on a novel coupling idea for Markov chains which also extends to…

Probability · Mathematics 2021-08-30 Balázs Gerencsér , Miklós Rásonyi

It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…

Logic · Mathematics 2018-02-15 Gunter Fuchs

In this note we are concerned with the validity of an uncountable analogue of a combinatorial lemma due to Vlastimil Pt\'ak. We show that the validity of the result for $\omega_1$ can not be decided in ZFC alone. We also provide a…

Functional Analysis · Mathematics 2020-06-09 Petr Hájek , Tommaso Russo

We show that the Proper Forcing Axiom for forcing notions of size $\aleph_1$ is consistent with the continuum being arbitrarily large. In fact, assuming $GCH$ holds and $\kappa\geq\omega_2$ is a regular cardinal, we prove that there is a…

Logic · Mathematics 2025-08-26 David Asperó , Mohammad Golshani

Following on from the notion of (first-order) causality, which generalises the notion of being tracepreserving from CP-maps to abstract processes, we give a characterization for the most general kind of map which sends causal processes to…

Other Computer Science · Computer Science 2017-01-04 Aleks Kissinger , Sander Uijlen