Related papers: Keisler's order has infinitely many classes
Keisler proved that if $\theta$ is a strong limit cardinal and $\lambda$ is a singular cardinal, then the transfer relation $\theta\longrightarrow\lambda$ holds. In a previous paper, we studied initial elementary submodels of the…
The sparsity order of a (simple undirected) graph is the highest possible rank (over ${\mathbb R}$ or ${\mathbb C}$) of the extremal elements in the matrix cone that consists of positive semidefinite matrices with prescribed zeros on the…
We analytically explore the scaling properties of a general class of nested subgraphs in complex networks, which includes the $K$-core and the $K$-scaffold, among others. We name such class of subgraphs $K$-nested subgraphs due to the fact…
We study the first-order almost-sure theories for classes of finite structures that are specified by homomorphically forbidding a set $\mathcal{F}$ of finite structures. If $\mathcal{F}$ consists of undirected graphs, a full description of…
We study the structure of the Rudin-Frolik order on countably complete ultrafilters under the assumption that this order is directed. This assumption, called the Ultrapower Axiom, holds in all known canonical inner models. It turns out that…
In quenched disordered systems, the existence of ordering is generally believed to be only possible in the weak disorder regime (disregarding models of spin-glass type). In particular, sufficiently large random fields is expected to…
A well-known result of Shelah and Spencer tells us that the almost sure theory for first order language on the random graph sequence $\left\{G(n, cn^{-1})\right\}$ is not complete. This paper proposes and proves what the complete set of…
We present some Zermelo-Fraenkel consistency results regarding bi-orderability of groups, as well as a construction of groups with Conradian orders whose every action on metric spaces has bounded orbits. A classical consequence of the…
Using extensive classical and quantum Monte Carlo simulations, we investigate the ground-state phase diagram of the fully frustrated transverse field Ising model on the square lattice. We show that pure columnar order develops in the…
We study a natural hierarchy in first-order logic, namely the quantifier structure hierarchy, which gives a systematic classification of first-order formulas based on structural quantifier resource. We define a variant of…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
Hadwiger's theorem is a Helly-type theorem involving common transversals to families of convex sets instead of common intersections. Subsequently, Pollack and Wenger identified a necessary and sufficient condition, called a consistent…
Work of Linnell shows that the space of left-orderings of a group is either finite or uncountable, and in the case that the space is finite, the isomorphism type of the group is known---it is what is known as a Tararin group. By defining…
In 2006, Restorff completed the classification of all Cuntz-Krieger algebras with finitely many ideals (i.e., those that are purely infinite) up to stable isomorphism. He left open the questions concerning strong classification up to stable…
A finite group is said to have "perfect order classes" if the number of elements of any given order is either zero or a divisor of the order of the group. The purpose of this note is to describe explicitly the finite Hamiltonian groups with…
The notion of a randomization of a first order structure was introduced by Keisler in the paper Randomizing a Model, Advances in Math. 1999. The idea was to form a new structure whose elements are random elements of the original first order…
In 1967 the author introduced a pre-ordering of all first order complete theories where T is lower than U if it is easier for an ultrapower of a model of T than an ultrapower of a model of U to be saturated. In a long series of recent…
Let $k$ be a perfect field such that for every $n$ there are only finitely many field extensions, up to isomorphism, of $k$ of degree $n$. If $G$ is a reductive algebraic group defined over $k$, whose characteristic is very good for $G$,…
We discuss the connection between various orders on the class of all the ultrafilters and certain compactness properties of abstract logics and of topological spaces. We present a model theoretical characterization of Comfort order. We…
Going back to Kreisel in the Sixties, hyperarithmetical analysis is a cluster of logical systems just beyond arithmetical comprehension. Only recently natural examples of theorems from the mathematical mainstream were identified that fit…