Related papers: Many-valued coalgebraic logic over semi-primal var…
Since the discovery of critical mistakes in Rauszer's work on bi-intuitionistic logics, solid foundations for these have progressively been rebuilt. However, the algebraic treatment of these logics has not yet been tended to. We fill this…
We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…
Most non-classical logics are subclassical, that is, every inference/theorem they validate is also valid classically. A notable exception is the three-valued propositional Logic of Ordinary Discourse (OL) proposed and extensively motivated…
We characterize all logarithmic, holomorphic vector-valued modular forms which can be analytically continued to a region strictly larger than the upper half-plane.
We define lifting properties for universal algebras, which we study in this general context and then particularize to various such properties in certain classes of algebras. Next we focus on residuated lattices, in which we investigate…
In computer science, various logical languages are defined to analyze properties of systems. One way to pinpoint the essential differences between those logics is to compare their expressivity in terms of distinguishing power and expressive…
In this work, a novel quaternary algebra has been proposed that can be used to implement an arbitrary quaternary logic function in more than one systematic ways. The proposed logic has evolved from and is closely related to the Boolean…
In recent research, some of the present authors introduced the concept of an n-dimensional Boolean algebra and its corresponding propositional logic nCL, generalising the Boolean propositional calculus to n>= 2 perfectly symmetric truth…
We study extensions of standard description logics to the framework of polyadic modal logic. We promote a natural approach to such logics via general relation algebras that can be used to define operations on relations of all arities. As a…
Motivated by applications in modelling quantum systems using coalgebraic techniques, we introduce a fibred coalgebraic logic. Our approach extends the conventional predicate lifting semantics with additional modalities relating conditions…
Weighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata. Its semantics is parameterized with respect to a semiring on which the values that weighted…
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 study the relation between additivity and deduction theorems in the algebraic semantics of congruential modal logic. Additivity of the modal operator is well-known to imply the local deduction-detachment theorem. Our main theme is that…
Using the lattice-theoretic version of the Euler characteristic introduced by V. Klee and G.-C. Rota in the Sixties, we define the Euler characteristic of a formula in G\"{o}del logic (over finitely or infinitely many truth-values). We then…
In fuzzy propositional logic, to a proposition a partial truth in [0,1] is assigned. It is well known that under certain circumstances, fuzzy logic collapses to classical logic. In this paper, we will show that under dual conditions, fuzzy…
The study of essential and strongly essential variables in functions defined on finite sets is a part of $k$-valued logic. We extend the main definitions from functions to terms. This allows us to apply concepts and results of Universal…
Let $i: \mathrm{L} \hookrightarrow \mathrm{X}$ be a compact K\"{a}hler Lagrangian in a holomorphic symplectic variety $\mathrm{X}/\mathbf{C}$. We use deformation quantisation to show that the endomorphism differential graded algebra…
We generalize the notion of symmetries of propositional formulas in conjunctive normal form to modal formulas. Our framework uses the coinductive models and, hence, the results apply to a wide class of modal logics including, for example,…
With help of a compact Prolog-based theorem prover for Intuitionistic Propositional Logic, we synthesize minimal assumptions under which a given formula formula becomes a theorem. After applying our synthesis algorithm to cover basic…
The aim of illocutionary logic is to explain how context can affect the meaning of certain special kinds of performative utterances. Recall that performative utterances are understood as follows: a speaker performs the illocutionary act…