Related papers: A note on standard systems and ultrafilters
We study various orders on countably complete ultrafilters on ordinals that coincide and are wellorders under a hypothesis called the Ultrapower Axiom. Our main focus is on the relationship between the Ultrapower Axiom and the linearity of…
We present a generalization of first-order unification to a term algebra where variable indexing is part of the object language. We exploit variable indexing by associating some sequences of variables ($X_0,\ X_1,\ X_2,\dots$) with a…
Much work on argument systems has focussed on preferred extensions which define the maximal collectively defensible subsets. Identification and enumeration of these subsets is (under the usual assumptions) computationally demanding. We…
We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
We describe the extension of normal iteration strategies with appropriate condensation properties to strategies for stacks of normal trees, with full normalization. Given a regular uncountable cardinal $\Omega$ and an…
Let $p$ be a prime, $S$ be a $p$-group and $\mathcal{F}$ be a saturated fusion system over $S$. Then $\mathcal{F}$ is said to be supersolvable, if there exists a series of $S$, namely $1 = S_0 \leq S_1 \leq \cdots \leq S_n = S$, such that…
In this paper we derive a new first-order theory of relativistic dissipative fluids by adopting the trace-fixed particle frame. Whereas in a companion letter we show that this theory is hyperbolic, causal and stable at global equilibrium…
Given a quasi-hereditary superalgebra $A$, the first author and R. Muth have defined generalized Schur bi-superalgebras $T^A(n)$ and proved that these algebras are again quasi-hereditary. In particular, $T^A(n)$ comes with a family of…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
Let M be a polynomially bounded, o-minimal structure with archimedean prime model, for example if M is a real closed field. Let C be a convex and unbounded subset of M. We determine the first order theory of the structure M expanded by the…
Encodings, that is, injective functions from words to words, have been studied extensively in several settings. In computability theory the notion of encoding is crucial for defining computability on arbitrary domains, as well as for…
We use the ultrafilter-convergence axiomatics for topological spaces to motivate in detail a gentle categorical introduction, first to Barr's Set-based relational T-algebras, and then to Burroni's T-preorders internal to a category C, here…
Burke \cite{MR1472122} proved that the generalized nonstationary ideal, denoted NS, is universal in the following sense: every normal ideal, and every tower of normal ideals of inaccessible height, is a canonical Rudin-Keisler projection of…
We show that, for many choices of finite tuples of generators $X = (x_1, \dots , x_d)$ of a tracial von Neumann algebra $(M, \tau)$ satisfying certain decomposition properties (non-primeness, possessing a Cartan subalgebra, or property…
We begin the study of the consequences of the existence of certain infinite matrices. Our present application is to compactness of products of topological spaces.
We establish the following model-theoretic characterization: profinite $L$-structures, the cofiltered limits of finite $L$-structures,are retracts of ultraproducts of finite $L$-structures. As a consequence, any elementary class of…
The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…
Checking for Non-Termination (NT) of a given program P, i.e., determining if P has at least one non-terminating run, is an undecidable problem that continues to garner significant research attention. While unintended NT is common in…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…