English
Related papers

Related papers: $\mathsf{MA} (\mathcal{I}$) and a Failure of Separ…

200 papers

The \emph{Separation Lemma} is a simple yet powerful tool, akin to the well-known \emph{Isolation Lemma}, that guarantees the uniqueness of certain set sums. Bandopadhyay et al.\ introduced this lemma to establish lower bounds for the \ALP…

Data Structures and Algorithms · Computer Science 2026-05-28 Abhishek Sahu

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Logic · Mathematics 2007-05-23 Wesley Calvert

We show two results on higher amalgamation in the theory $\mathrm{ACFA}^{+}$, the model companion of the theory of difference fields with an additive character (added as a continuous logic predicate) on the fixed field in characteristic 0.…

Logic · Mathematics 2026-01-09 Stefan Marian Ludwig

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…

Logic · Mathematics 2020-08-12 Corey Bacal Switzer

We prove that if $(M,\mathcal{X})$ and $(M,\mathcal{Y})$ are countable models of the theory $\mathrm{WKL}^*_0$ such that $\mathrm{I}\Sigma_1(A)$ fails for some $A \in \mathcal{X} \cap \mathcal{Y}$, then $(M,\mathcal{X})$ and…

We show that splitting forcing does not have the weak Sacks property below any condition, answering a question of Laguzzi, Mildenberger and Stuber-Rousselle. We also show how some partition results for splitting trees hold or fail and we…

Logic · Mathematics 2021-06-15 Jonathan Schilhan

In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…

Logic · Mathematics 2024-12-30 Rahman Mohammadpour , Boban Velickovic

We give a model where there is a ccc Souslin forcing which does not satisfy the Knaster condition. Next, we present a model where there is a sigma-linked not sigma-centered Souslin forcing such that all its small subsets are sigma-centered…

Logic · Mathematics 2016-09-06 Haim Judah , Andrzej Rosłanowski , Saharon Shelah

We propose a new method to extract the CP violating weak phase $\gamma$ in the CKM paradigm of the Standard Model, using $B^- \to D^0 \pi^- \to f \pi^-$ and $B^- \to \bar D^0 \pi^- \to f \pi^-$ decays, where $f$ are final states such as…

High Energy Physics - Phenomenology · Physics 2016-11-23 C. S. Kim , Sechul Oh

A linear system of difference equations and a nonlinear perturbation are considered. We propose sufficient conditions to ensure that the homeomorphism of topological equivalence between them is actually a $C^1$ diffeomorphism. These…

Dynamical Systems · Mathematics 2021-05-03 Álvaro Castañeda , Néstor Jara

We investigate the expressive power of quantifier alternation hierarchy of first-order logic over words. This hierarchy includes the classes ${\Sigma}_i$ (sentences having at most $i$ blocks of quantifiers starting with an $\exists$) and…

Formal Languages and Automata Theory · Computer Science 2015-12-01 Théo Pierron , Thomas Place , Marc Zeitoun

We stratify intuitionistic first-order logic over $(\forall,\to)$ into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these…

Logic in Computer Science · Computer Science 2019-03-14 Aleksy Schubert , Paweł Urzyczyn , Konrad Zdanowski

It is shown that for any fixed $i>0$, the $\Sigma_{i+1}$-fragment of Presburger arithmetic, i.e., its restriction to $i+1$ quantifier alternations beginning with an existential quantifier, is complete for…

Logic in Computer Science · Computer Science 2014-10-01 Christoph Haase

We continue the project of the study of reverse mathematics principles inspired by cardinal invariants. In this article in particular we focus on principles encapsulating the existence of large families of objects that are in some sense…

Logic · Mathematics 2026-02-04 David Belanger , Chi Tat Chong , Rupert Hölzl , Frank Stephan

For a complexity class $C$ and language $L$, a constructive separation of $L \notin C$ gives an efficient algorithm (also called a refuter) to find counterexamples (bad inputs) for every $C$-algorithm attempting to decide $L$. We study the…

Computational Complexity · Computer Science 2024-08-07 Lijie Chen , Ce Jin , Rahul Santhanam , Ryan Williams

As we pointed out recently, the neutral decays $B_d\to\pi^\mp K^\pm$ and $B_d\to\pi^0K$ may provide non-trivial bounds on the CKM angle $\gamma$. Here we reconsider this approach in the light of recent CLEO data, which look very…

High Energy Physics - Phenomenology · Physics 2007-05-23 Andrzej J. Buras , Robert Fleischer

We prove that for every tower $\mathcal T$ there are $\aleph_1$-dense $A$ and $B$ so that any ``reasonable" forcing notion $\mathbb{P}$ -- an adjective that includes all known ones -- for making $A$ and $B$ isomorphic will add a…

Logic · Mathematics 2025-10-14 Corey Bacal Switzer

We consider the modality "$\varphi$ is true in every $\sigma$-centered forcing extension", denoted $\square\varphi$, and its dual "$\varphi$ is true in some $\sigma$-centered forcing extension", denoted $\lozenge\varphi$ (where $\varphi$ is…

Logic · Mathematics 2019-12-12 Ur Ya'ar

It is well known that whenever a class of structures $\mathcal{K}_1$ is interpretable in a class of structures $\mathcal{K}_2$, then the hereditary undecidability of (a fragment of) the theory of $\mathcal{K}_1$ implies the hereditary…

Logic · Mathematics 2024-05-15 Vladimir E. Karpov

We describe a construction of a model of second order arithmetic in which (boldface) $\bm{\Pi^1_n}$-determinacy holds, but (lightface) $\Pi^1_{n+2}$-$\mathsf{DC}$ fails, thus showing that no projective level of determinacy implies full…

Logic · Mathematics 2025-05-23 Sandra Müller , Bartosz Wcisło