相关论文: Pre-filtrations, Pre-stable Canonical Rules, and t…
We characterize type isomorphisms in the multiplicative-additive fragment of linear logic (MALL), and thus in *-autonomous categories with finite products, extending a result for the multiplicative fragment by Balat and Di Cosmo. This…
In this paper, we present a formalization of Kozen's propositional modal $\mu$-calculus, in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in…
We investigate the canonicity of inequalities of the intuitionistic mu-calculus. The notion of canonicity in the presence of fixed point operators is not entirely straightforward. In the algebraic setting of canonical extensions we examine…
We prove a Goldblatt-Thomason theorem for dialgebraic intuitionistic logics, and instantiate it to Goldblatt-Thomason theorems for a wide variety of modal intuitionistic logics from the literature.
Within the possibilistic approach to uncertainty modeling, the paper presents a modal logical system to reason about qualitative (comparative) statements of the possibility (and necessity) of fuzzy propositions. We relate this qualitative…
We introduce FIK, a natural intuitionistic modal logic specified by Kripke models satisfying the condition of forward confluence. We give a complete Hilbert-style axiomatization of this logic and propose a bi-nested calculus for it. The…
The logic IK is the intuitionistic variant of modal logic introduced by Fischer Servi, Plotkin and Stirling, and studied by Simpson. This logic is considered a fundamental intuitionstic modal system as it corresponds, modulo the standard…
Using the isomorphism between highest weight U_q(sl_2)-modules and homologies of certain local systems on the configuration spaces, constructed by Varchenko, we give a geometric construction of the dual of the Lusztig's canonical basis in a…
Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This…
Generalizing both Substable FSMs and Indicator FSMs, we introduce alpha-stabilized subordination, a procedure which produces new FSMs (H-sssi symmetric stable processes) from old ones. We extend these processes to isotropic stable fields…
The system of intuitionistic modal logic ${\bf IEL}^{-}$ was proposed by S. Artemov and T. Protopopescu as the intuitionistic version of belief logic \cite{Artemov}. We construct the modal lambda calculus which is Curry-Howard isomorphic to…
In this paper, we give sufficient properties for a finite dimensional graded algebra to be a higher preprojective algebra. These properties are of homological nature, they use Gorensteiness and bimodule isomorphisms in the stable category…
In this paper we use some basic facts from the theory of (matrix) Lie groups and algebras to show that many of the classical matrix splittings used to construct stationary iterative methods and preconditioniers for Krylov subspace methods…
We obtain necessary and sufficient conditions to determine the existence of presymplectic forms of a given rank on all almost abelian Lie algebras. We also study the moduli space of presymplectic forms (this is the set of all closed 2-forms…
Using the methods of quantisation ideals, we construct a family of quantisations corresponding to Case alpha in Sergeev's classification of solutions to the tetrahedron equation. This solution describes transformations between special…
An extension of the notion of dinatural transformation is introduced in order to give a criterion for preservation of dinaturality under composition. An example of an application is given by proving that all bicartesian closed canonical…
Motivated by recent works on the genus of classifying spaces of compact Lie groups, here we study the set of filtered $\lambda$-ring structures over a filtered ring from a purely algebraic point of view. From a global perspective, we first…
Skolemization, with Herbrand's theorem, underpins automated theorem proving and various transformations in computer science and mathematics. Skolemization removes strong quantifiers by introducing new function symbols, enabling efficient…
We prove that there is a factor of the Muchnik lattice that captures intuitionistic propositional logic. This complements a now classic result of Skvortsova for the Medvedev lattice.
We consider a quantified version of the (propositional) modal logic $\mathsf{BK}$, proposed earlier by S. P. Odintsov and H. Wansing; this version will be denoted by $\mathsf{QBK}$. Using the canonical model method, we prove the strong…