Related papers: Elements of affine model theory
Using the tensor category theory developed by Lepowsky, Zhang and the second author, we construct a braided tensor category structure with a twist on a semisimple category of modules for an affine Lie algebra at an admissible level. We…
Smooth manifolds have been always understood intuitively as spaces with an affine geometry on the infinitesimal scale. In Synthetic Differential Geometry this can be made precise by showing that a smooth manifold carries a natural structure…
We show that the category of affine bundles over a smooth manifold M is equivalent to the category of affine spaces modelled on projective finitely generated C^\infty(M)-modules. Using this equivalence of categories, we are able to give an…
Given a finite index subfactor, we show that the {\em affine morphisms at zero level} in the affine category over the planar algebra associated to the subfactor is isomorphic to the fusion algebra of the subfactor as a *-algebra. This…
We introduce and study a new type of compactness principle for strong logics that, roughly speaking, infers the consistency of a theory from the consistency of its small fragments in certain outer models of the set-theoretic universe. We…
A prototypical example of categorial grammars are those based on Lambek calculus, i.e. noncommutative intuitionistic linear logic. However, it has been noted that purely noncommutative operations are often not sufficient for modeling even…
We prove that every finite direct product of crystallographic groups arising from an irreducible root system (in the sense of Lie theory) is profinitely rigid (equiv. first-order rigid). This is a generalization of recent proofs of…
The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
We introduce and develop propositional continuous intuitionistic logic and propositional continuous affine logic via complete algebraic semantics. Our approach centres on AC-algebras, which are algebras $USC(\mathcal{L})$ of sup-preserving…
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
This paper presents matching logic, a first-order logic (FOL) variant for specifying and reasoning about structure by means of patterns and pattern matching. Its sentences, the patterns, are constructed using variables, symbols, connectives…
Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…
We consider (finitary, propositional) logics through the original use of Category Theory: the study of the "sociology of mathematical objects", aligning us with a recent, and growing, trend of study logics through its relations with other…
The Z-grading determined by a long simple root of an affine or finite type Lie algebra arises from an adjoint or cominuscule representation of a lower rank semi-simple complex Lie algebra. Analysis of the relationship between the grading…
A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…
Cut-elimination is the bedrock of proof theory with a multitude of applications from computational interpretations to proof analysis. It is also the starting point for important meta-theoretical investigations including decidability,…
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…
Local-order-invariant (first-order) logic is an extension of first-order logic where formulae have access to a ternary local order relation on the Gaifman graph, provided that the truth value does not depend on the specific order relation…