Related papers: Algebraic modal correspondence: Sahlqvist and beyo…
Using the functor of Baumslag rationalization of groups we construct a functor on the category of all (non necessarily simply connected) spaces that extends the classical rationalization of simply connected spaces. We study this functor and…
This thesis is intended to provide an account of the theory and applications of Operational Methods that allow the "translation" of the theory of special functions and polynomials into a "different" mathematical language. The language we…
The Langlands correspondence for complex curves is traditionally formulated in terms of sheaves rather than functions. Recently, Langlands asked whether it is possible to construct a function-theoretic version. In this paper we use the…
This paper proposes a basic proof theoretic framework for major modal logics: {\sf S5} and some of its subsystems. The framework is based on a version of hypersequent calculus, and the basic modal systems we handle here are the system {\sf…
Possibilistic logic offers a qualitative framework for representing pieces of information associated with levels of uncertainty of priority. The fusion of multiple sources information is discussed in this setting. Different classes of…
We continue to develop a research line initiated in \cite{wollic22}, studying I/O logic from an algebraic approach based on subordination algebras. We introduce the classes of slanted (co-)Heyting algebras as equivalent presentations of…
Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…
Algebraic quantum field theory is an approach to relativistic quantum physics, notably the theory of elementary particles, which complements other modern developments in this field. It is particularly powerful for structural analysis but…
In a 1985 commentary to his collected works, Kolmogorov remarked that his 1932 paper "was written in hope that with time, the logic of solution of problems [i.e., intuitionistic logic] will become a permanent part of a [standard] course of…
Trace formulae provide one of the most elegant descriptions of the classical-quantum correspondence. One side of a formula is given by a trace of a quantum object, typically derived from a quantum Hamiltonian, and the other side is…
The Tarskian classical relevant logic TR arises from Tarski's work on the foundations of the calculus of relations and on first-order logic restricted to finitely many variables, presented by Tarski and Givant their book, A Formalization of…
We introduce a realist, unextravagant interpretation of quantum theory that builds on the existing physical structure of the theory and allows experiments to have definite outcomes, but leaves the theory's basic dynamical content…
Fiore and Hur recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a…
We reduce some key calculations of compositions of morphisms between Soergel bimodules ("Soergel calculus") to calculations in the nil Hecke ring ("Schubert calculus"). This formula has several applications in modular representation theory.
The notion of class is ubiquitous in computer science and is central in many formalisms for the representation of structured knowledge used both in knowledge representation and in databases. In this paper we study the basic issues…
Given a class $\mathcal C$ of models, a binary relation ${\mathcal R}$ between models, and a model-theoretic language $L$, we consider the modal logic and the modal algebra of the theory of $\mathcal C$ in $L$ where the modal operator is…
This is a companion article to my papers on Kazhdan-Lusztig polynomials and character formulae for the Lie superalgebras gl(m|n) (much revised!) and q(n). The goal is to develop the general theory of tilting modules for Lie superalgebras,…
First-order logic is the basis for many knowledge representation formalisms and methods. Providing technological support for learning to write first-order formulas for natural language specifications requires methods to test formulas for…
This paper argues that every quantum system can be understood as a sufficiently general kind of stochastic process unfolding in an old-fashioned configuration space according to ordinary notions of probability. This argument is based on an…
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…