Related papers: Ultrafilters, finite coproducts and locally connec…
We present a unified categorical framework that connects the syntactic Henkin construction for the first-order Completeness Theorem with Lawvere's Fixed-Point Theorem. Concretely, we define two canonical functors from the category of…
It is a consequence of the axiom of choice that every preorder can be extended to a total preorder while respecting the strict preorder relation. We call such an extension a prelinearization of the preorder and study the extent to which the…
Ultrafilters are very useful and versatile objects with applications throughout mathematics: in topology, analysis, combinarotics, model theory, and even theory of social choice. Proofs based on ultrafilters tend to be shorter and more…
In a previous publication, we introduced an abstract logic via an abstract notion of quantifier. Drawing upon concepts from categorical logic, this abstract logic interprets formulas from context as subobjects in a specific category, e.g.,…
If $\mathcal P$ is a family of filters over some set $I$, a topological space $X$ is \emph{sequencewise $\mathcal P$-\brfrt compact} if, for every $I$-indexed sequence of elements of $X$, there is $F \in \mathcal P$ such that the sequence…
The main result of this paper may be stated as a construction of "almost representations" for the canonical presheaves of object extensions of length n on the C-systems defined by locally cartesian closed universe categories with binary…
This paper is a sequel to "Localization of $\frak{u}$-modules. I", hep-th/9411050. We are starting here the geometric study of the tensor category $\cal{C}$ associated with a quantum group (corresponding to a Cartan matrix of finite type)…
Let FI denote the category whose objects are the sets $[n] = \{1,\ldots, n\}$, and whose morphisms are injections. We study functors from the category FI into the category of sets. We write $\mathfrak{S}_n$ for the symmetric group on $[n]$.…
We extend the class of ultrafilters $U$ over countable sets for which $U\cdot U\equiv_T U$, extending several results from \cite{Dobrinen/Todorcevic11}. In particular, we prove that for each countable ordinal $\alpha\geq 2$, the generic…
Let us say that a class of upward closed sets (upsets) of distributive lattices is a finitary filter class if it is closed under homomorphic preimages, intersections, and directed unions. We show that the only finitary filter classes of…
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…
We propose a uniform method of constructing ultrafilter extensions from canonical models, which is based on the similarity between ultrafilters and maximal consistent sets. This method can help us understand why the known ultrafilter…
We develop a unified representation theory for the categories of finite subsets and relation-preserving maps of highly homogeneous relational structures classified by Cameron. For any commutative coefficient ring $k$, we extend the…
We prove that every categorical model of dependent type theory with dependent sums and products, intensional identity types and univalent universes presents via its $\infty$-localisation an elementary $\infty$-topos, that is, a finitely…
A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…
We study two generalizations of the Rudin-Keisler ordering to ultrafilters on complete Boolean algebras. To highlight the difference between them, we develop new techniques to construct incomparable ultrafilters in this setting.…
Assuming the Generalized Continuum Hypothesis, this paper answers the question: when is the tensor product of two ultrafilters equal to their Cartesian product? It is necessary and sufficient that their Cartesian product is an ultrafilter;…
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 consider mappings, which are structure consisting of a single function (and possibly some number of unary relations) and address the problem of approximating a continuous mapping by a finite mapping. This problem is the inverse problem…
For any symmetric monoidal category $\mathcal{D}$, Lauda and Pfeiffer showed the equivalence between the $\mathcal{D}$-valued open-closed 2-dimensional TQFTs and the so-called knowledgeable Frobenius algebras (KFAs) in $\mathcal{D}$. Each…