Related papers: From 2-sequents and Linear Nested Sequents to Natu…
Protothetic is one of the most stimulating systems for propositional logic. Including quantifiers and an inference rule for definitions, it is a very interesting mean for the study of many questions of metalogic. Unfortunately, it only…
Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for…
Formal semantics and distributional semantics are distinct approaches to linguistic meaning: the former models meaning as reference via model-theoretic structures; the latter represents meaning as vectors in high-dimensional spaces shaped…
We introduce a new logic that combines Adjoint Logic with Graded Necessity Modalities. This results in a very expressive system capable of controlling when and how structural rules are used. We give a sequent calculus, natural deduction,…
Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that…
We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e. in presence of all the usual connectives) classical natural deduction.
This paper proves normalisation theorems for intuitionist and classical negative free logic, without and with the $\invertediota$ operator for definite descriptions. Rules specific to free logic give rise to new kinds of maximal formulas…
In this paper, we develop the proof theory of skew prounital closed categories. These are variants of the skew closed categories of Street where the unit is not represented. Skew closed categories in turn are a weakening of the closed…
We develop a system for solving logical deduction one-dimensional ordering problems by transforming natural language premises and candidate statements into first-order logic. Building on Heim and Kratzer's syntax-based compositional…
We extend Natural Deduction for intuitionistic logic with a third introduction rule for the disjunction, $\vee$-i3, with a conclusion $\Gamma\vdash A\vee B$, but both premises $\Gamma\vdash A$ and $\Gamma\vdash B$. This rule is admissible…
In this paper we use display calculus to show the decidability for normal modal logic K and some of its extensions.
We study a synthetic corpus based approach for language models (LMs) to acquire logical deductive reasoning ability. The previous studies generated deduction examples using specific sets of deduction rules. However, these rules were limited…
We consider the problem of implementing deontic modal logic. We show how (deontic) modal operators can be elegantly and directly expressed using default negation (negation-as-failure) and strong negation present in answer set programming…
The paper considers the representation of k-valued logical functions in the class of disjunctive normal forms. Various classes of monotone functions of k-valued logic are investigated. Theorems are proved on the coincidence of reduced and…
Modal synthesis methods are a long-standing approach for modelling distributed musical systems. In some cases extensions are possible in order to handle geometric nonlinearities. One such case is the high-amplitude vibration of a string,…
Subatomic systems were recently introduced to identify the structural principles underpinning the normalization of proofs. "Subatomic" means that we can reformulate logical systems in accordance with two principles. Their atomic formulas…
We present a non-deterministic semantic framework for all modal logics in the modal cube, extending prior works by Kearns and others. Our approach introduces modular and uniform multi-valued non-deterministic matrices (Nmatrices) for each…
Logics closed under classes of substitutions broader than class of uniform substitutions are known as hyperformal logics. This paper extends known results about hyperformal logics in two ways. First: we examine a very powerful form of…
Linearization of coupled second order nonlinear ordinary differential equations (SNODEs) is one of the open and challenging problems in the theory of differential equations. In this paper we describe a simple and straightforward method to…
We introduce labelled sequent calculi for the basic normal non-distributive modal logic L and 31 of its axiomatic extensions, where the labels are atomic formulas of a first order language which is interpreted on the canonical extensions of…