English
Related papers

Related papers: Provability Models

200 papers

We study local consequence relations in modal extensions of product logic over Kripke models with either valued (fuzzy) or crisp accessibility relations. In both settings, we consider semantics over the full class of product algebras as…

Logic · Mathematics 2026-05-15 Amanda Vidal

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 a many-valued generalization of Propositional Dynamic Logic where formulas in states and accessibility relations between states of a Kripke model are evaluated in a finite FL-algebra. One natural interpretation of this framework is…

Logic in Computer Science · Computer Science 2020-12-23 Igor Sedlár

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

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

We introduce our implementation in HOL Light of the metatheory for G\"odel-L\"ob provability logic (GL), covering soundness and completeness w.r.t. possible world semantics and featuring a prototype of a theorem prover for GL itself. The…

Logic in Computer Science · Computer Science 2023-10-13 Marco Maggesi , Cosimo Perini Brogi

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

Based on an analysis of the inference rules used, we provide a characterization of the situations in which classical provability entails intuitionistic provability. We then examine the relationship of these derivability notions to uniform…

Logic in Computer Science · Computer Science 2016-08-31 Gopalan Nadathur

The interpretation of propositional dynamic logic (PDL) through Kripke models requires the relations constituting the interpreting Kripke model to closely observe the syntax of the modal operators. This poses a significant challenge for an…

Logic in Computer Science · Computer Science 2011-09-19 Ernst-Erich Doberkat

We introduce the logics GLP(\Lambda), a generalization of Japaridze's polymodal provability logic GLP(\omega) where \Lambda is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall…

Logic · Mathematics 2012-10-18 Lev D. Beklemishev , David Fernández-Duque , Joost J. Joosten

This paper develops the model theory of normal modal logics based on partial "possibilities" instead of total "worlds," following Humberstone (1981) instead of Kripke (1963). Possibility semantics can be seen as extending to modal logic the…

Logic · Mathematics 2025-01-22 Wesley H. Holliday

The present dissertation introduces the research project on HOLMS (\textbf{HOL} Light Library for \textbf{M}odal \textbf{S}ystems), a growing modular framework for modal reasoning within the HOL Light proof assistant. To provide an…

Logic in Computer Science · Computer Science 2025-06-13 Antonella Bilotta

We investigate some finitely-valued generalizations of propositional dynamic logic with tests. We start by introducing the (n+1)-valued Kripke models and a corresponding language based on a modal extension of {\L}ukasiewicz many-valued…

Logic in Computer Science · Computer Science 2014-01-29 Bruno Teheux

The study of modal logic has witnessed tremendous development following the introduction of Kripke semantics. However, recent developments in programming languages and type theory have led to a second way of studying modalities, namely…

Logic in Computer Science · Computer Science 2024-05-09 G. A. Kavvos

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

Inductive Logic Programming (ILP) provides interpretable rule learning in relational domains, yet remains limited in its ability to induce and reason with numerical constraints. Classical ILP systems operate over discrete predicates and…

Artificial Intelligence · Computer Science 2025-12-16 Nijesh Upreti , Vaishak Belle

This paper is focused on the study of modal logics defined from valued Kripke frames, and particularly, on computability and expressibility questions of modal logics of transitive Kripke frames evaluated over certain residuated lattices. It…

Logic in Computer Science · Computer Science 2019-04-03 Amanda Vidal

We study model and frame definability of various modal logics. Let ML(A+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We show that a class of Kripke models…

Logic · Mathematics 2018-12-17 Katsuhiko Sano , Jonni Virtema

We introduce and study single-conclusioned nested sequent calculi for a broad class of intuitionistic multi-modal logics known as "intuitionistic grammar logics (IGLs)." These logics serve as the intuitionistic counterparts of classical…

Logic in Computer Science · Computer Science 2026-05-06 Tim S. Lyon

We consider the operation of sum on Kripke frames, where a family of frames-summands is indexed by elements of another frame. In many cases, the modal logic of sums inherits the finite model property and decidability from the modal logic of…

Logic · Mathematics 2022-07-06 Ilya B. Shapirovsky