English
Related papers

Related papers: On Modal Companions of Logics with Strong Negation

200 papers

We define a Kripke semantics for a conditional logic based on the propositional logic $\mathsf{N4}$, the paraconsistent variant of Nelson's logic of strong negation; we axiomatize the minimal system induced by this semantics. The resulting…

Logic · Mathematics 2023-11-07 Grigory K. Olkhovikov

For each natural number $n$ we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than $n$ and no strictly ascending chains. The case $n=0$ is the G\"odel-L\"ob…

Logic · Mathematics 2023-11-08 Robert Goldblatt

In this paper, we shall give another proof of the faithfulness of Blass translation (for short, $B$-translation) of the propositional fragment $\bf L_1$ of Le\'{s}niewski's ontology in the modal logic $\bf K$ \it by means of Hintikka…

Logic · Mathematics 2020-11-03 Takao Inoué

Standpoint logics offer unified modal logic-based formalisms for representing multiple heterogeneous viewpoints. At the same time, many non-monotonic reasoning frameworks can be naturally captured using modal logics, in particular using the…

Artificial Intelligence · Computer Science 2025-11-18 Piotr Gorczyca , Hannes Strass

The model theory of a first-order logic called N^4 is introduced. N^4 does not eliminate double negations, as classical logic does, but instead reduces fourfold negations. N^4 is very close to classical logic: N^4 has two truth values;…

Logic in Computer Science · Computer Science 2007-05-23 François Bry

Over the past 50 years, Nelson algebras have been extensively studied by distinguished scholars as the algebraic counterpart of Nelson's constructive logic with strong negation. Despite these studies, a comprehensive survey of the topic is…

Logic · Mathematics 2024-04-24 Jouni Järvinen , Sándor Radeleczki , Umberto Rivieccio

The foundations of formal models for epistemic and doxastic logics often rely on certain logical aspects of modal logics such as S4 and S4.2 and their semantics; however, the corresponding mathematical results are often stated in papers or…

Logic in Computer Science · Computer Science 2024-04-24 Laura P. Gamboa Guzman , Kristin Y. Rozier

We study propositional logical systems arising from the language of Johansson's minimal logic and obtained by weakening the requirements for the negation operator. We present their semantics as a variant of neighbourhood semantics. We use…

Logic · Mathematics 2020-02-27 Nick Bezhanishvili , Almudena Colacito , Dick de Jongh

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…

Logic · Mathematics 2024-06-25 Wesley H. Holliday

We define a natural notion of standard translation for the formulas of conditional logic which is analogous to the standard translation of modal formulas into the first-order logic. We briefly show that this translation works (modulo a…

Logic · Mathematics 2026-01-14 Grigory Olkhovikov

We propose a "modal linear logic" to reformulate intuitionistic modal logic S4 (IS4) in terms of linear logic, establishing an S4-version of Girard translation from IS4 to it. While the Girard translation from intuitionistic logic to linear…

Logic in Computer Science · Computer Science 2019-04-25 Yosuke Fukuda , Akira Yoshimizu

Two Gentzen-style twist sequent calculi for the normal modal logic S4 are introduced and investigated. The proposed calculi, which do not employ the standard logical inference rules for the negation connective, are characterized by several…

Logic in Computer Science · Computer Science 2025-01-03 Norihiro Kamide

We investigate algebraic and topological semantics of the modal logic S4CI and obtain strong completeness of the given system in the case of local semantic consequence relations. In addition, we consider an extension of the logic S4CI with…

Logic · Mathematics 2024-06-04 Daniyar Shamkanov

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…

Logic in Computer Science · Computer Science 2009-03-23 Mehrnoosh Sadrzadeh , Roy Dyckhoff

In this project, a rather complete proof-theoretical formalization of Lambek Calculus (non-associative with arbitrary extensions) has been ported from Coq proof assistent to HOL4 theorem prover, with some improvements and new theorems.…

Computation and Language · Computer Science 2017-05-23 Chun Tian

We extend to natural deduction the approach of Linear Nested Sequents and of 2-sequents. Formulas are decorated with a spatial coordinate, which allows a formulation of formal systems in the original spirit of natural deduction -- only one…

Logic in Computer Science · Computer Science 2021-04-27 Simone Martini , Andrea Masini , Margherita Zorzi

In proof-theoretic semantics, meaning is based on inference. It may seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of…

Logic · Mathematics 2024-02-13 Timo Eckhardt , David J. Pym

It is a celebrated result of McKinsey and Tarski [28] that S4 is the logic of the closure algebra X+ over any dense-in-itself separable metrizable space. In particular, S4 is the logic of the closure algebra over the reals R, the rationals…

Logic · Mathematics 2013-11-12 Guram Bezhanisevili , David Gabelaia , Joel Lucero-Bryan

Positive modal algebras are the positive-subreducts of modal algebras. We prove that the variety of positive S4-algebras is not locally finite. On the other hand, the free one-generated positive S4-algebra is shown to be finite. Moreover,…

Logic · Mathematics 2019-08-06 T. Moraschini

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…

Logic in Computer Science · Computer Science 2023-06-22 G. A. Kavvos
‹ Prev 1 2 3 10 Next ›