English
Related papers

Related papers: Provability Logics of Hierarchies

200 papers

Justification logics are modal-like logics with the additional capability of recording the reason, or justification, for modalities in syntactic structures, called justification terms. Justification logics can be seen as explicit…

Logic in Computer Science · Computer Science 2015-10-27 Samuel Bucheli

This work presents a formalized proof of modal completeness for G\"odel-L\"ob provability logic (GL) in the HOL Light theorem prover. We describe the code we developed, and discuss some details of our implementation, focusing on our choices…

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

Game Logic is an excellent setting to study proofs-about-programs via the interpretation of those proofs as programs, because constructive proofs for games correspond to effective winning strategies to follow in response to the opponent's…

Logic in Computer Science · Computer Science 2022-10-07 Rose Bohrer , André Platzer

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

Formally specifying, let alone verifying, properties of systems involving multiple programming languages is inherently challenging. We introduce Heterogeneous Dynamic Logic (HDL), a framework for combining reasoning principles from distinct…

Logic in Computer Science · Computer Science 2026-04-16 Samuel Teuber , Mattias Ulbrich , André Platzer , Bernhard Beckert

Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…

Logic in Computer Science · Computer Science 2009-02-13 Lutz Schröder , Dirk Pattinson

We define the notion of a model of higher-order modal logic in an arbitrary elementary topos $\mathcal{E}$. In contrast to the well-known interpretation of (non-modal) higher-order logic, the type of propositions is not interpreted by the…

Logic · Mathematics 2017-03-07 Steve Awodey , Kohei Kishida , Hans-Christoph Kotzsch

In the interpretation of experimental data, one is actually looking for plausible explanations. We look for a measure of plausibility, with which we can compare different possible explanations, and which can be combined when there are…

Artificial Intelligence · Computer Science 2010-12-30 Wan Ahmad Tajuddin Wan Abdullah

We consider the question of extending propositional logic to a logic of plausible reasoning, and posit four requirements that any such extension should satisfy. Each is a requirement that some property of classical propositional logic be…

Artificial Intelligence · Computer Science 2017-07-07 Kevin S. Van Horn

The intuitive notion of evidence has both semantic and syntactic features. In this paper, we develop an {\em evidence logic} for epistemic agents faced with possibly contradictory evidence from different sources. The logic is based on a…

Logic · Mathematics 2013-07-05 Johan van Benthem , David Fernández-Duque , Eric Pacuit

Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…

Logic · Mathematics 2023-06-22 Nick Bezhanishvili , Jim de Groot , Yde Venema

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

Logic in Computer Science · Computer Science 2012-10-10 Jakub Michaliszyn , Jan Otop , Piotr Witkowski

In this paper, we discuss a proof system $\mathsf{NGL}$ for the logic $\mathbf{GL}$ of provability, which is equipped with an $\omega$-rule. We show the three classes of transitive Kripke frames, the class which strongly validates the…

Logic · Mathematics 2023-11-03 Katsumi Sasaki , Yoshihito Tanaka

We provide a logical framework in which a resource-bounded agent can be seen to perform approximations of probabilistic reasoning. Our main results read as follows. First we identify the conditions under which propositional probability…

Logic in Computer Science · Computer Science 2022-05-09 Paolo Baldi , Hykel Hosni

This is the logical foundation for for Relativity Theory, Probability Theory, and for Quantum Theory. Contents is the following: 1 Introduction. 2 Classical logic. 3 Time and space. 3.1 Recorders. 3.2 Time. 3.3 Space. 3.4 Relativity. 4.…

General Physics · Physics 2007-05-23 G. A. Quznetsov

This paper addresses fundamental issues on the nature of the concepts and structures of fuzzy logic, focusing, in particular, on the conceptual and functional differences that exist between probabilistic and possibilistic approaches. A…

Artificial Intelligence · Computer Science 2013-04-05 Enrique H. Ruspini

Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive…

Logic in Computer Science · Computer Science 2024-04-24 Yevgeny Kazakov , Ian Pratt-Hartmann

This paper continues the investigation of the logic of competing theories, be they scientific, social, political etc. We introduce a many-valued, multi-type modal language which we endow with relational semantics based on enriched reflexive…

This paper introduces a new family of cognitive modal logics designed to formalize conjectural reasoning: modal systems in which cognitive contexts extend known facts with hypothetical assumptions in order to explore their consequences.…

Logic in Computer Science · Computer Science 2026-03-24 Fabio Vitali

For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal…

Logic in Computer Science · Computer Science 2011-01-18 Lutz Schröder , Dirk Pattinson