Related papers: On ultrafilter extensions of first-order models an…

We study types that appear in ultraproducts that have distributions which can be thought of as a sequence of graphs. The property of having distributions that are captured by graphs is motivated by a commonality of $\mathrm{SOP}_2$-types…

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

We like to develop model theory for $T$, a complete theory in $\mathbb{L}_{\theta,\theta}(\tau)$ when $\theta$ is a compact cardinal. By [Sh:300a] we have bare bones stability and it seemed we can go no further. Dealing with ultrapowers…

Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem 2). This is a variant of a prior theorem of van Benthem and…

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…

We observe that the category of topological space, uniform spaces, and simplicial sets are all, in a natural way, full subcategories of the same larger category, namely the simplicial category of filters; this is, moreover, implicit in the…

Let $X$ be the prime spectrum of a ring. In [arXiv:0707.1525] the authors define a topology on $X$ by using ultrafilters and they show that this topology is precisely the constructible topology. In this paper we generalize the construction…

A super-modular category is a unitary pre-modular category with M\"uger center equivalent to the symmetric unitary category of super-vector spaces. Super-modular categories are important alternatives to modular categories as any unitary…

The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…

Limit and Pseudotopological spaces are two generalizations of topological spaces which are defined by indicating what filters converge under some axioms. In this article, we introduce covering spaces and set forth some necessary conditions…

This paper introduces the seed order, a partial order of the class of uniform countably complete ultrafilters that generalizes the Mitchell order on normal measures. Like that order, the seed order is consistently a linear ordering even…

We provide two proofs of the compactness theorem for extensions of first-order logic based on team semantics. First, we build upon L\"uck's ultraproduct construction for team semantics and prove a suitable version of {\L}o\'s' Theorem.…

Ultrafilters are useful mathematical objects having applications in nonstandard analysis, Ramsey theory, Boolean algebra, topology, and other areas of mathematics. In this note, we provide a categorical construction of ultrafilters in terms…

The Univalent Foundations requires a logic that allows us to define structures on homotopy types, similar to how first-order logic with equality ($\text{FOL}_=$) allows us to define structures on sets. We develop the syntax, semantics and…

This paper develops a categorical framework to clarify the relationship between the completeness and compactness theorems in classical first-order logic. Rather than claiming that different model constructions yield naturally isomorphic…

We prove, in ZFC alone, some new results on regularity and decomposability of ultrafilters. We also list some problems, and furnish applications to topological spaces and to extended logics.

Highly saturated models are a fundamental part of the model-theoretic machinery of nonstandard analysis. Of the two methods for producing them, ultrapowers constructed with the aid of $\kappa^+$-good ultrafilters seems by far the less…

We show that there exist models $\mathcal M_1$ and $\mathcal M_2$ such that $\mathcal M_1$ elementarily embeds into $\mathcal M_2$ but their ultrafilter extensions $\beta(\mathcal M_1)$ and $\beta(\mathcal M_2)$ are not elementarily…

We consider an extension of the unary negation fragment of first-order logic in which arbitrarily many binary symbols may be required to be interpreted as equivalence relations. We show that this extension has the finite model property.…

Subset models provide a new semantics for justifcation logic. The main idea of subset models is that evidence terms are interpreted as sets of possible worlds. A term then justifies a formula if that formula is true in each world of the…