Searcharxiv⌕ Search

arXiv subjects

Michael C. Laskowski

Publications and source records attributed to Michael C. Laskowski.

At least 37 records · Page 2Linked to original sources

Weakly minimal groups with a new predicate

Fix a weakly minimal (i.e., superstable $U$-rank $1$) structure $\mathcal{M}$. Let $\mathcal{M}^*$ be an expansion by constants for an elementary substructure, and let $A$ be an arbitrary subset of the universe $M$. We show that all formulas in the expansion $(\mathcal{M}^*,A)$ are equivalent to bounded formulas, and so $(\mathcal{M},A)$ is stable (or NIP) if and only if the $\mathcal{M}$-induced structure $A_{\mathcal{M}}$ on $A$ is stable (or NIP). We then restrict to the case that $\mathcal{M}$ is a pure abelian group with a weakly minimal theory, and $A_{\mathcal{M}}$ is mutually algebraic (equivalently, weakly minimal with trivial forking). This setting encompasses most of the recent research on stable expansions of $(\mathbb{Z},+)$. Using various characterizations of mutual algebraicity, we give new examples of stable structures of the form $(\mathcal{M},A)$. Most notably, we show that if $(G,+)$ is a weakly minimal additive subgroup of the algebraic numbers, $A\subseteq G$ is enumerated by a homogeneous linear recurrence relation with algebraic coefficients, and no repeated root of the characteristic polynomial of $A$ is a root of unity, then $(G,+,B)$ is superstable for any $B\subseteq A$.

math.LO↗

Henkin constructions of models with size continuum

We survey the technique of constructing customized models of size continuum in omega steps and illustrate the method by giving new proofs of mostly old results within this rubric. One new theorem, which is joint with Saharon Shelah, is that a pseudominimal theory has an atomic model of size continuum.

math.LO↗

A strong failure of aleph_0-stability for atomic classes

We study classes of atomic models At_T of a countable, complete first-order theory T . We prove that if At_T is not pcl-small, i.e., there is an atomic model N that realizes uncountably many types over pcl(a) for some finite tuple a from N, then there are 2^aleph1 non-isomorphic atomic models of T, each of size aleph1.

math.LO↗

Borel Complexity and Potential Canonical Scott Sentences

We define and investigate HC-forcing invariant formulas of set theory, whose interpretations in the hereditarily countable sets are well behaved under forcing extensions. This leads naturally to a notion of cardinality ||Phi|| for sentences Phi of $L_{ω_1,ω}$, which counts the number of sentences of $L_{\infty,ω}$ that, in some forcing extension, become a canonical Scott sentence of a model of Phi. We show this cardinal bounds the complexity of (Mod(Phi), iso), the class of models of Phi with universe omega, by proving that (Mod(Phi),iso) is not Borel reducible to (Mod(Psi),iso) whenever ||Psi|| < ||Phi||. Using these tools, we analyze the complexity of the class of countable models of four complete, first-order theories T for which (Mod(T),iso) is properly analytic, yet admit very different behavior. We prove that both `Binary splitting, refining equivalence relations' and Koerwien's example of an eni-depth 2, omega-stable theory have (Mod(T),iso) non-Borel, yet neither is Borel complete. We give a slight modification of Koerwien's example that also is omega-stable, eni-depth 2, but is Borel complete. Additionally, we prove that I_{\infty,ω}(Phi)<\beth_{ω_1} whenever (Mod(Phi),iso) is Borel.

math.LO↗

Definable choice for a class of weakly o-minimal theories

Given an o-minimal structure ${\mathcal M}$ with a group operation, we show that for a properly convex subset $U$, the theory of the expanded structure ${\mathcal M}'=({\mathcal M},U)$ has definable Skolem functions precisely when ${\mathcal M}'$ is valuational. As a corollary, we get an elementary proof that the theory of any such ${\mathcal M}'$ does not satisfy definable choice.

math.LO↗

Constructing many atomic models in $\aleph_1$

We introduce the notion of pseudo-algebraicity to study atomic models of first order theories (equivalently models of a complete sentence of $L_{ω_1,ω}$. Theorem: Let $T$ be any complete first-order theory in a countable language with an atomic model. If the pseudo-minimal types are not dense, then there are $2^{\aleph_1}$ pairwise non-isomorphic atomic models of $T$, each of size $\aleph_1$.

math.LO↗

P-NDOP and P-decompositions of aleph_epsilon-saturated models of superstable theories

Assume a complete superstable theory is superstable, and let P be a class of regular types, typically closed under automorphisms of the monster and non-orthogonality. We define the notion of P-NDOP and prove the existence of P-decompositions and derive an analog of Sh401 for superstable theories with P-NDOP. In this context, we also find a sufficient condition on P-decompositions that imply non-isomorphic models. For this, we investigate natural structures on the types in P\intersect S(M) modulo non-orthogonality.

math.LO↗

Borel completeness of some aleph_0 stable theories

We study aleph_0-stable theories, and prove that if T either has eni-DOP or is eni-deep, then its class of countable models is Borel complete. We introduce the notion of lambda-Borel completeness and prove that such theories are lambda-Borel complete. Using this, we conclude that an aleph_0-stable theory has 2^lambda pairwise non-L(infinity,aleph_0) equivalent models of size lambda for all infinite cardinals lambda if and only if T either has eni-DOP or is eni-deep.

math.LO↗

Characterizing model completeness among mutually algebraic structures

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 a new, more constructive proof that the elementary diagram of any model of a strongly minimal, trivial theory is model complete.

math.LO↗

Model companion of ordered theories with an automorphism

Kikyo and Shelah showed that if $T$ is a theory with the Strict Order Property in some first-order language $\mathcal{L}$, then in the expanded language $\mathcal{L}_σ:= \mathcal{L}\cup\{σ\}$ with a new unary function symbol $σ$, the bigger theory $T_σ:= T\cup\{``σ\mbox{is an} \mathcal{L}\mbox{-automorphism''}\}$ does not have a model companion. We show in this paper that if, however, we restrict the automorphism and consider the theory $T_σ$ as the base theory $T$ together with a ``restricted'' class of automorphisms, then $T_σ$ can have a model companion in $\mathcal{L}_σ$. We show this in the context of linear orders and ordered abelian groups.

math.LO↗

Mutually algebraic structures and expansions by predicates

We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion $(M,A)$ by a unary predicate with the finite cover property. We show that every structure has a maximal mutually algebraic reduct, and give a strong structure theorem for the class of elementary extensions of a fixed mutually algebraic structure.

math.LO↗

The Schroder-Bernstein property for a-saturated models

A first-order theory T has the Schröder-Bernstein (SB) property if any pair of elementarily bi-embeddable models are isomorphic. We prove that T has an expansion by constants that has the SB property if and only if T is superstable and non-multidimensional. We also prove that among superstable theories T, the class of a-saturated models of T has the SB property if and only if T has no nomadic types.

math.LO↗

On VC-minimal theories and variants

In this paper, we study VC-minimal theories and explore related concepts. We first define the notion of convex orderablility and show that this lies strictly between VC-minimality and dp-minimality. Next, we define the notion of weak VC-minimality, show it lies strictly between VC-minimality and dependence, and show that all unstable weakly VC-minimal theories interpret an infinite linear order. Finally, we define the notion full VC-minimality, show that this lies strictly between weak o-minimality and VC-minimality, and show that theories that are fully VC-minimal have low VC-density.

math.LO↗

The Schröder-Bernstein property for weakly minimal theories

For a countable, weakly minimal theory, we show that the Schroeder-Bernstein property (any two elementarily bi-embeddable models are isomorphic) is equivalent to both a condition on orbits of rank 1 types and the property that the theory has no infinite collection of pairwise bi-embeddable, pairwise nonisomorphic models. We conclude that for countable weakly minimal theories, the Schroeder-Bernstein property is absolute between transitive models of ZFC.

math.LO↗

Karp height of models of stable theories

A trichotomy theorem for countable, stable, unsuperstable theories is offered. We develop the notion of a `regular ideal' of formulas and study types that are minimal with respect to such an ideal.

math.LO↗

Karp complexity and classes with the independence property

A class K of structures is controlled if for all cardinals lambda, the relation of L_{infty,lambda}-equivalence partitions K into a set of equivalence classes (as opposed to a proper class). We prove that no pseudo-elementary class with the independence property is controlled. By contrast, there is a pseudo-elementary class with the strict order property that is controlled.

math.LO↗

The Karp complexity of unstable classes

A class K of structures is controlled if, for all cardinals lambda, the relation of L_{infty,lambda}-equivalence partitions K into a set of equivalence classes (as opposed to a proper class). We prove that the class of doubly transitive linear orders is controlled, while any pseudo-elementary class with the omega-independence property is not controlled.

math.LO↗

Forcing Isomorphism II

If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be forced isomorphic by a ccc forcing. We give examples showing that the hypothesis on the number of complete types is necessary and what happens if `ccc' is replaced other cardinal-preserving adjectives. We also give an example showing that membership in a pseudo-elementary class can be altered by very simple cardinal-preserving forcings.

math.LO↗