English
Related papers

Related papers: Absolute model companionship, forcibility, and the…

200 papers

In this paper, for a C*-Algebra A with M = M(A) an AW*-algebra, or equivalently, for an essential, norm-closed, two-sided ideal A of an AW*-algebra M, we investigate the strict approximability of the elements of M from commutative C*-…

Operator Algebras · Mathematics 2007-05-23 Claudio D'Antoni , Laszlo Zsido

We introduce bounded category forcing axioms for well-behaved classes $\Gamma$. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe $H_{\lambda_\Gamma^+}$ modulo…

Logic · Mathematics 2021-01-11 David Aspero , Matteo Viale

We show that it is consistent relative to a weakly compact cardinal that strong homology is additive and compactly supported within the class of locally compact separable metric spaces. This complements work of Marde\v{s}i\'{c} and Prasolov…

Logic · Mathematics 2022-02-22 Nathaniel Bannister , Jeffrey Bergfalk , Justin Tatch Moore

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

Logic · Mathematics 2016-04-01 Richard Rast

Even when completely and consistently formulated, a fundamental theory of physics and cosmological boundary conditions may not give unambiguous and unique predictions for the universe we observe; indeed inflation, string/M theory, and…

High Energy Physics - Theory · Physics 2009-10-07 Anthony Aguirre , Max Tegmark

The theory of classical realizability is a framework for the Curry-Howard correspondence which enables to associate a program with each proof in Zermelo-Fraenkel set theory. But, almost all the applications of mathematics in physics,…

Logic in Computer Science · Computer Science 2023-06-22 Jean-Louis Krivine

For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…

Rings and Algebras · Mathematics 2017-08-01 Brett McLean

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

The PARAFAC2 model provides a flexible alternative to the popular CANDECOMP/PARAFAC (CP) model for tensor decompositions. Unlike CP, PARAFAC2 allows factor matrices in one mode (i.e., evolving mode) to change across tensor slices, which has…

Machine Learning · Computer Science 2023-10-18 Marie Roald , Carla Schenker , Jeremy E. Cohen , Evrim Acar

The aim of this paper is to give mathematical account of an argument of David Lewis in Parts of Classes in defense of universalism in mereology. Specifically we study how to extend models of Core Mereology (following Achille Varzi's…

Logic · Mathematics 2024-10-04 Imanol Mozo Carollo

In this paper, following an idea of Christophe Chalons, I propose a new kind of forcing axiom, the Maximality Principle, which asserts that any sentence phi holding in some forcing extension V^P and all subsequent extensions V^P*Q holds…

Logic · Mathematics 2007-05-23 Joel David Hamkins

Exhibiting a deep connection between purely geometric problems and real algebra, the complexity class $\exists \mathbb{R}$ plays a crucial role in the study of geometric problems. Sometimes $\exists \mathbb{R}$ is referred to as the 'real…

Computational Geometry · Computer Science 2021-11-15 Michael G. Dobbins , Linda Kleist , Tillmann Miltzow , Paweł Rzążewski

We prove that for every simple theory $T$ (or even simple thick compact abstract theory) there is a (unique) compact abstract theory $T^\fP$ whose saturated models are the lovely pairs of $T$. Independence-theoretic results that were proved…

Logic · Mathematics 2009-02-05 Itaï Ben Yaacov

We characterize when the elementary diagram of a mutually algebraic structure has a model complete theory, and give an explicit description of a set of existential formulas to which every formula is equivalent. This characterization yields…

Logic · Mathematics 2016-02-10 Michael C. Laskowski

Wigner's Friend-type paradoxes challenge the assumption that events are absolute -- that when we measure a system, we obtain a single result, which is not relative to anything or anyone else. These paradoxes highlight the tension between…

Quantum Physics · Physics 2026-04-23 Sumit Mukherjee , Jonte R. Hance

We study modal team logic MTL, the team-semantical extension of modal logic ML closed under Boolean negation. Its fragments, such as modal dependence, independence, and inclusion logic, are well-understood. However, due to the unrestricted…

Logic in Computer Science · Computer Science 2023-06-22 Martin Lück

We study the relationship between Amoeba forcing (the partial order which generically adds a measure one set of random reals) and projective measurability. Given a universe V of set theory and a forcing notion P in V we say that V is…

Logic · Mathematics 2009-09-25 Jörg Brendle

We study models where the gauge coupling constants, masses and the gravitational constant are functions of some conserved charge in the universe, and furthermore a cosmological constant that depends on the total charge of the universe. We…

High Energy Physics - Theory · Physics 2015-06-03 Eduardo Guendelman , Roee Steiner

The main focus of this paper is on bisimulation-invariant MSO, and more particularly on giving a novel model-theoretic approach to it. In model theory, a model companion of a theory is a first-order description of the class of models in…

Logic · Mathematics 2016-05-04 Silvio Ghilardi , Samuel J. van Gool

AC-completion efficiently handles equality modulo associative and commutative function symbols. When the input is ground, the procedure terminates and provides a decision algorithm for the word problem. In this paper, we present a modular…

Logic in Computer Science · Computer Science 2015-07-01 Sylvain Conchon , Evelyne Contejean , Mohamed Iguernelala