Related papers: Cover Systems for the Modalities of Linear Logic
In this article we investigate the notion and basic properties of Boolean algebras and prove the Stone's representation theorem. The relations of Boolean algebras to logic and to set theory will be studied and, in particular, a neat proof…
Solovay's arithmetical completeness theorem states that the modal logic of provability coincides with the modal logic $\mathbf{GL}$. Hamkins and L\"owe studied the modal logical aspects of set theoretic multiverse and proved that the modal…
We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…
This paper demonstrates the existence of $\mathbb{Q}$-complements for algebraically integrable log-Fano foliations on klt ambient varieties. Additionally, we investigate properties of algebraically integrable Fano foliations such as a…
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…
We present natural deduction systems and associated modal lambda calculi for the necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in the dual-context style: they feature two distinct zones of…
We study the model theory of covers of groups definable in o-minimal structures. This includes the case of covers of compact real Lie groups. In particular we study categoricity questions, pointing out some notable differences with the case…
Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…
For every finitary set functor F we demonstrate that free algebras carry a canonical partial order. In case F is bicontinuous, we prove that the cpo obtained as the conservative completion of the free algebra is the free completely…
The present paper mainly considers the representation type of the enveloping algebra of monomial algebra. Let $A$ be a monomial algebra and $A^e= A\otimes_{\mathrm{l}\!\mathrm{k}} A^{\mathrm{op}}$ its enveloping algebra. It is shown that…
Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…
In [17], we introduced a modal logic, called $L$, which combines intuitionistic propositional logic $IPC$ and classical propositional logic $CPC$ and is complete w.r.t. an algebraic semantics. However, $L$ seems to be too weak for…
We present a coalgebraic framework for studying generalisations of dynamic modal logics such as PDL and game logic in which both the propositions and the semantic structures can take values in an algebra $\mathbf{A}$ of truth-degrees. More…
We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…
These notes are intended as a fairly self contained explanation of Fock space and various algebras that act on it, including a Clifford algebra, a Weyl algebra, an infinite rank matrix algebra, and an affine Kac-Moody algebra. We also…
Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…
In this paper we investigate the complexity-theoretical aspects of cyclic and non-wellfounded proofs in the context of parsimonious logic, a variant of linear logic where the exponential modality ! is interpreted as a constructor for…
In 1933, G\"odel considered two modal approaches to describing provability. One captured formal provability and resulted in the logic GL and Solovay's Completeness Theorem. The other was based on the modal logic S4 and led to Artemov's…
This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of Linear Logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have…
Modal probabilistic logics provide a framework for reasoning about probability in modal contexts, involving notions such as knowledge, belief, time, and action. In this paper, we study a particular family of these logics, extending the…