Related papers: Unified inverse correspondence for LE-logics
Using the theory infinity-categories we construct derived (dg-)categories of regular, holonomic D-modules and algebraically constructible sheaves on a complex smooth algebraic stack. We construct a natural infinity-categorical equivalence…
In this paper, we establish a complete structural description of flat Lorentzian Lie groups, i.e., Lie groups endowed with a flat left invariant Lorentzian metric, thereby resolving a long-standing open problem in the theory of…
We develop a method to give presentations of quantized function algebras of complex reductive groups. In particular, we give presentations of quantized function algebras of automorphism groups of finite dimensional simple complex Lie…
We introduce the two substructural propositional logics KL, KL+, which use disjunction, fusion and a unary, (quasi-)exponential connective. For both we prove strong completeness with respect to the interpretation in Kleene algebras and a…
We generalize Fitting's work on Intuitionistic Kripke models of Set Theory using Ono and Komori's Residuated Kripke models. Based on these models, we provide a generalization of the von Neumann hierarchy in the context of Modal Residuated…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…
We interpret the construction of relative Cuntz-Pimsner algebras of correspondences in terms of the correspondence bicategory, as a reflector into a certain sub-bicategory. This generalises a previous characterisation of absolute…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
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 present a unified categorical treatment of completeness theorems for several classical and intuitionistic infinitary logics with a proposed axiomatization. This provides new completeness theorems and subsumes previous ones by G\"odel,…
We develop dualities for complete perfect distributive quasi relation algebras and complete perfect distributive involutive FL-algebras. The duals are partially ordered frames with additional structure. These frames are analogous to the…
We establish a correspondence between infinity-enhanced Leibniz algebras, recently introduced in order to encode tensor hierarchies, and differential graded Lie algebras, which have been already used in this context. We explain how any…
One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable. However, different degrees of satisfiability in many-valued logics, poses various kind of…
We extend the formalisation of confluence results in Kleene algebras to a formalisation of coherent confluence proofs. For this, we introduce the structure of higher globular Kleene algebra, a higher-dimensional generalisation of modal and…
We present an algebraic framework for interacting extended quantum systems to study complex phenomena characterized by the coexistence and competition of different states of matter. We start by showing how to connect different…
Lagrangian multiforms provide a variational framework for describing integrable hierarchies. This thesis presents two approaches for systematically constructing Lagrangian one-forms, which cover the case of finite-dimensional integrable…
We define a new class of infinitary logics $\mathscr L^1_{\kappa,\alpha}$ generalizing Shelah's logic $\mathbb L^1_\kappa$ defined in \cite{MR2869022}. If $\kappa=\beth_\kappa$ and $\alpha <\kappa$ is infinite then our logic coincides with…
The provability logic of a theory T is the set of modal formulas, which under any arithmetical realization are provable in T . We slightly modify this notion by requiring the arithmetical realizations to come from a specified set $\Gamma$.…
This article fits in the area of research that investigates the application of topological duality methods to problems that appear in theoretical computer science. One of the eventual goals of this approach is to derive results in…