Related papers: Constructing Fully Complete Models of Multiplicati…
This paper considers the problem of building saturated models for first-order graded logics. We define types as pairs of sets of formulas in one free variable which express properties that an element is expected, respectively, to satisfy…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
We give new and rather general gluing theorems for anti-self-dual (ASD) conformal structures, following the method suggested by Floer. The main result is a gluing theorem for pairs of conformally ASD manifolds `joined' across a common piece…
We develop the theory of tricategorical limits and colimits, and show that they can be modelled up to biequivalence via certain homotopically well-behaved limits and colimits enriched over the monoidal model category $\mathbf{Gray}$ of…
We establish the foundations of categorical weave calculus, developing the diagrammatic calculus of weaves and braid varieties within the study of Calabi-Yau triangulated categories and cluster tilting theory. This is achieved by…
Hybrid logic extends modal logic with special propositions called nominals, each of which is true at only one state in a model. This enables us to describe some properties of binary relations, such as irreflexivity and anti-symmetry, which…
We say that a projective class in a triangulated category with coproducts is perfect if the corresponding ideal is closed under coproducts of maps. We study perfect projective classes and the associated phantom and cellular towers. Given a…
We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C2) and interpreted over linearly ordered structures. We show that the problem is undecidable in the case of…
We show the functional completeness for the connectives of the non-trivial negation inconsistent logic C by using a well-established method implementing purely proof-theoretic notions only. Firstly, given that C contains a strong negation,…
Tucker decomposition is the cornerstone of modern machine learning on tensorial data analysis, which have attracted considerable attention for multiway feature extraction, compressive sensing, and tensor completion. The most challenging…
We present a streamlined and (hopefully) accessible proof of the model-completeness of the weak monadic second order version of a dense linear order with left-endpoint but no right-endpoint in a particular finite signature. We also show how…
A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…
We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…
The connection between classical model theoretical types (MT-types) and logically-geometrical types (LG-types) introduced by B. Plotkin is considered. It is proved that MT-types of two $n$-tuples in two universal algebras coincide if and…
A modular tensor category provides the appropriate data for the construction of a three-dimensional topological field theory. We describe the following analogue for two-dimensional conformal field theories: a 2-category whose objects are…
Multiplicative linear logic is a very well studied formal system, and most such studies are concerned with the one-sided sequent calculus. In this paper we look in detail at existing translations between a deep inference system and the…
Necessary and sufficient conditions are presented for the (first-order) theory of a universal class of algebraic structures (algebras) to admit a model completion, extending a characterization provided by Wheeler. For varieties of algebras…
We consider a classical N. Steenrod's problem on realization of homology classes by images of the fundamental classes of manifolds. It is well-known that each integral homology class can be realized with some multiplicity as an image of the…
We call a restriction semigroup almost perfect if it is proper and its least monoid congruence is perfect. We show that any such semigroup is isomorphic to a `$W$-product' $W(T,Y)$, where $T$ is a monoid, $Y$ is a semilattice and there is a…
We study the modal logic of the closure algebra $P_2$, generated by the set of all polygons in the Euclidean plane $\mathbb{R}^2$. We show that this logic is finitely axiomatizable, is complete with respect to the class of frames we call…