English
Related papers

Related papers: An intuitionistically complete system of basic int…

200 papers

In this paper, we discuss models of the common knowledge logic. The common knowledge logic is a multi-modal logic that includes the modal operators $\mathsf{K}_{i}$ ($i\in\mathcal{I}$, where $\mathcal{I}$ is a finite set of agents) and…

Logic · Mathematics 2025-12-23 Yoshihito Tanaka

Prime implicates and prime implicants have proven relevant to a number of areas of artificial intelligence, most notably abductive reasoning and knowledge compilation. The purpose of this paper is to examine how these notions might be…

Logic in Computer Science · Computer Science 2014-01-16 Meghyn Bienvenu

This paper presents a formalization of the classical proof of completeness in Henkin-style developed by Troelstra and van Dalen for intuitionistic logic with respect to Kripke models. The completeness proof incorporates their insights in a…

Logic in Computer Science · Computer Science 2023-10-04 Huayu Guo , Dongheng Chen , Bruno Bentzen

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…

Logic in Computer Science · Computer Science 2010-02-03 Lutz Schroeder , Dirk Pattinson

IFG logic is a variant of the independence-friendly logic of Hintikka and Sandu. We answer the question: ``Which IFG-formulas are equivalent to ordinary first-order formulas?'' We use the answer to show that the ordinary cylindric set…

Logic · Mathematics 2009-04-23 Allen L. Mann

The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional…

Logic · Mathematics 2009-11-13 Sérgio Marcelino , Pedro Resende

The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding…

Logic · Mathematics 2007-05-23 Georges Hansoul , Bruno Teheux

We study abstract intermediate justification logics, that is arbitrary intermediate propositional logics extended with a subset of specific axioms of (classical) justification logics. For these, we introduce various semantics by combining…

Logic · Mathematics 2020-08-18 Nicholas Pischke

We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present…

Logic · Mathematics 2023-04-06 Wesley H. Holliday

The proof theory and semantics of intuitionistic modal logics have been studied by Simpson in terms of Prawitz-style labelled natural deduction systems and Kripke models. An alternative to model-theoretic semantics is provided by…

Logic · Mathematics 2025-07-10 Yll Buzoku , David. J. Pym

Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a…

Logic in Computer Science · Computer Science 2023-08-01 Samuel Bucheli , Roman Kuznets , Thomas Studer

Logic $L$ was introduced by Lewitzka [7] as a modal system that combines intuitionistic and classical logic: $L$ is a conservative extension of CPC and it contains a copy of IPC via the embedding $\varphi\mapsto\square\varphi$. In this…

Logic in Computer Science · Computer Science 2017-03-10 Steffen Lewitzka

This paper is devoted to the construction of conditional logic system of {\L}ukasiewicz m-valued propositional logic. We construct conditional logic system {\L}CR based on {\L}ukasiewicz m-valued propositional logic. We construct world…

Logic · Mathematics 2024-07-30 Shuquan Huo

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

Logic · Mathematics 2025-08-12 Mauro Avon

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.

Logic · Mathematics 2010-03-24 Andrea Sorbi , Sebastiaan A. Terwijn

Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic. The calculi are used to establish…

Logic · Mathematics 2015-07-01 George Metcalfe , Nicola Olivetti

Transitive closure logic is a known extension of first-order logic obtained by introducing a transitive closure operator. While other extensions of first-order logic with inductive definitions are a priori parametrized by a set of inductive…

Logic in Computer Science · Computer Science 2018-06-29 Liron Cohen , Reuben N. S. Rowe

We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…

Logic in Computer Science · Computer Science 2025-08-26 Han Gao , Daniil Kozhemiachenko , Nicola Olivetti

Boudou and the authors have recently introduced the intuitionistic temporal logic $\sf ITL^e$ and shown it to be decidable. In this article we show that the `henceforth'-free fragment of this logic is complete for the class of…

Logic · Mathematics 2018-04-11 Martín Diéguez , David Fernández-Duque

We consider an extension of bi-intuitionistic logic with the traditional modalities from tense logic Kt. Proof theoretically, this extension is obtained simply by extending an existing sequent calculus for bi-intuitionistic logic with…

Logic in Computer Science · Computer Science 2010-06-30 Rajeev Gore , Linda Postniece , Alwen Tiu
‹ Prev 1 3 4 5 6 7 10 Next ›