Related papers: Lawvere completion and separation via closure
Enriched Lawvere theories are a generalization of Lawvere theories that allow us to describe the operational semantics of formal systems. For example, a graph enriched Lawvere theory describes structures that have a graph of operations of…
We build on our previous paper \cite{constructive} by using the general method introduced there in conjunction with invariant theory. This yields quantifier elimination results for the classical quaternions, octonions, as well as other…
The set of all separable quantum states is compact and convex. We focus on the two-qubit quanum system and study the boundary of the set. Then we give the criterion to determine whether a separable state is on the boundary. Some…
One of the main prerequisites for understanding sheaves on elementary toposes is the proof that a (Lawvere-Tierney) topology on a topos induces a closure operator on it, and vice-versa. That standard theorem is usually presented in a…
Working jointly in the equivalent categories of MV-al\-ge\-bras and lattice-ordered abelian groups with strong order unit (for short, unital $\ell$-groups), we prove that isomorphism is a sufficient condition for a separating subalgebra $A$…
Different notions for order convergence have been considered by various authors. Associated to every notion of order convergence corresponds a topology, defined by taking as the closed sets those subsets of the poset satisfying that no net…
We introduce the notion of a "category with path objects", as a slight strengthening of Kenneth Brown's classic notion of a "category of fibrant objects". We develop the basic properties of such a category and its associated homotopy…
This article provides a general framework in the context of category theory where one can recognize as particular instances of the same abstract construction several notions of completion, envelope, and hull, such as the Boolean algebra…
The randomization of a complete first order theory T is the complete continuous theory T^R with two sorts, a sort for random elements of models of T, and a sort for events in an underlying probability space. We give necessary and sufficient…
A method based on order completion for solving general equations is presented. In particular, this method can be used for solving large classes of nonlinear systems of PDEs, with possibly associated initial and/or boundary value problems.
The purpose of this note is to show that, if $\mathcal{V}$ is a closed monoidal category, the following three notions are equivalent. (1) Category with $\mathcal{V}$-structure and cylinder. (2) Tensored $\mathcal{V}$-category. (3)…
Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The…
We construct a notion of derived completion which applies to homomorphisms of commutative S-algebras. We study the relationship of the construction with other constructions of completions, and prove various invariance properties. The…
Inspired by Brown's collapsing method (or discrete Morse theory) to obtain a free resolution of $\bbZ$ over the monoid ring $\bbZ M$, we apply algebraic discrete Morse theory to compute the homology groups of Lawvere theories, which is…
We contribute to the knowledge of the quantifier completions and their applications by using the language of doctrines. This algebraic presentation allows us to properly analyse the behaviour of the existential and universal quantifiers. We…
An argument is given to associate integrable nonintegrable transition of discrete maps with the transition of Lawvere's fixed point theorem to its own contrapositive. We show that the classical description of nonlinear maps is neither…
There are many category-theoretic notions of algebraic theory, including Lawvere theories, monads, PROPs and operads. The first central notion of this thesis is a common generalisation of these, which we call a proto-theory. In order to…
Answering a question by Honsell and Plotkin, we show that there are two equations between lambda terms, the so-called subtractive equations, consistent with lambda calculus but not simultaneously satisfied in any partially ordered model…
We provide a thorough algebraic analysis of three known completions having a central role in the exact completions of Lawvere's doctrines: the one adding comprehensive diagonals (i.e. forcing equality on terms to coincide with the equality…
Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces---so-called ``topological semantics''. The first is classical higher-order logic, with…