English
Related papers

Related papers: Strongly dependent theories

200 papers

We study several ideal-based constructions in the context of singular stationarity. By combining methods of strong ideals, supercompact embeddings, and Prikry-type posets, we obtain three consistency results concerning mutually stationary…

Logic · Mathematics 2017-10-02 Omer Ben-Neria

We introduce the notion of pseudo-algebraicity to study atomic models of first order theories (equivalently models of a complete sentence of $L_{\omega_1,\omega}$. Theorem: Let $T$ be any complete first-order theory in a countable language…

Logic · Mathematics 2015-03-03 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

In 1950, B.A. Trakhtenbrot showed that the set of first-order tautologies associated to finite models is not recursively enumerable. In 1999, P. H\'ajek generalized this result to the first-order versions of \L ukasiewicz, G\"odel and…

Logic · Mathematics 2014-07-10 Matteo Bianchi

Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…

Probability · Mathematics 2015-03-20 Kari Eloranta

Let $\mathfrak{i}$ denote the minimal cardinality of a maximal independent family and let $\mathfrak{a}_T$ denote the minimal cardinality of a maximal family of pairwise almost disjoint subtrees of $2^{<\omega}$. Using a countable support…

Logic · Mathematics 2019-12-24 Vera Fischer

The theme of the first two sections, is to prepare the framework of how from a "complicated" family of index models I in K_1 we build many and/or complicated structures in a class K_2. The index models are characteristically linear orders,…

Logic · Mathematics 2016-02-09 Saharon Shelah

In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…

Logic · Mathematics 2011-08-12 Vincent Guingona

Team Semantics generalizes Tarski's Semantics for First Order Logic by allowing formulas to be satisfied or not satisfied by sets of assignments rather than by single assignments. Because of this, in Team Semantics it is possible to extend…

Logic · Mathematics 2019-09-19 Pietro Galliani

Suppose F is a finite set of selfadjoint elements in a tracial von Neumann algebra M. For $\alpha >0$, F is $\alpha$-bounded if the free packing $\alpha$-entropy of F is bounded from above. We say that M is strongly 1-bounded if M has a…

Operator Algebras · Mathematics 2007-05-23 Kenley Jung

We prove that the category of countable Tate modules over an arbitrary discrete ring embeds fully faithfully into that of condensed modules. If the base ring is of finite type, we characterize the essential image as generated by the free…

Category Theory · Mathematics 2025-01-23 Valerio Melani , Hugo Pourcelot , Gabriele Vezzosi

A usual dichotomy is that in many cases, reasonably definable sets, satisfy the CH, i.e. if they are uncountable they have cardinality continuum. A strong dichotomy is when: if the cardinality is infinite it is continuum as in [Sh:273]. We…

Logic · Mathematics 2016-09-07 Saharon Shelah

We study the complexity of the model checking problem, for fixed model A, over certain fragments L of first-order logic. These are sometimes known as the expression complexities of L. We obtain various complexity classification theorems for…

Logic in Computer Science · Computer Science 2007-05-23 Barnaby Martin

A relevant thesis is that for the family of complete first order theories with NIP (i.e. without the independence property) there is a substantial theory, like the family of stable (and the family of simple) first order theories. We examine…

Logic · Mathematics 2007-05-23 Saharon Shelah

We compare classes of finite relational structures via monadic second-order transductions. More precisely, we study the preorder where we set C \subseteq K if, and only if, there exists a transduction {\tau} such that C\subseteq{\tau}(K).…

Logic · Mathematics 2015-07-01 Achim Blumensath , Bruno Courcelle

If T is an model complete theory with the strict order property, then the theory of the models of T with an automorphism has no model companion.

Logic · Mathematics 2007-05-23 Hirotaka Kikyo , Saharon Shelah

We study the coherence and conservativity of extensions of dependent type theories by additional strict equalities. By considering notions of congruences and quotients of models of type theory, we reconstruct Hofmann's proof of the…

Logic in Computer Science · Computer Science 2020-10-28 Rafaël Bocquet

We formulate the Hauptvermutung of Causal Set Theory in two mathematically well-defined but different ways one of which turns out to be wrong and the other one turns out to be true. A further result is that the Hauptvermutung is true if we…

Differential Geometry · Mathematics 2025-12-30 Olaf Müller

If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…

Logic · Mathematics 2020-04-10 Itaï Ben Yaacov , Frank Olaf Wagner

Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…

Combinatorics · Mathematics 2008-12-04 Zhi-Wei Sun

Hereditary coreflective subcategories of an epireflective subcategory A of Top such that I_2\notin A (here I_2 is the 2-point indiscrete space) were studied in [C]. It was shown that a coreflective subcategory B of A is hereditary (closed…

General Topology · Mathematics 2011-09-05 Martin Sleziak