English
Related papers

Related papers: Topological interpretations of provability logic

200 papers

We investigate modal logical aspects of provability predicates $\mathrm{Pr}_T(x)$ satisfying the following condition: $\mathbf{M}$: If $T \vdash \varphi \to \psi$, then $T \vdash \mathrm{Pr}_T(\ulcorner \varphi \urcorner) \to…

Logic · Mathematics 2023-04-04 Haruka Kogure , Taishi Kurahashi

In this paper, we give a duality theorem between the category of $\kappa$-additive complete atomic modal algebras and the category of $\kappa$-downward directed multi-relational Kripke frames, for any cardinal number $\kappa$.…

Logic · Mathematics 2023-02-23 Yoshihito Tanaka

We give a new coalgebraic semantics for intuitionistic modal logic with $\Box$. In particular, we provide a colagebraic representation of intuitionistic descriptive modal frames and of intuitonistic modal Kripke frames based on image-finite…

Logic · Mathematics 2024-06-18 Rodrigo Nicolau Almeida , Nick Bezhanishvili

Temporal logics over finite traces have recently seen wide application in a number of areas, from business process modelling, monitoring, and mining to planning and decision making. However, real-life dynamic systems contain a degree of…

Logic in Computer Science · Computer Science 2019-11-19 Fabrizio M. Maggi , Marco Montali , Rafael Peñaloza

We introduce a modal logic for describing statistical knowledge, which we call statistical epistemic logic. We propose a Kripke model dealing with probability distributions and stochastic assignments, and show a stochastic semantics for the…

Logic in Computer Science · Computer Science 2023-07-19 Yusuke Kawamoto

Understanding the uncertainty in large language model (LLM) explanations is important for evaluating their faithfulness and reasoning consistency, and thus provides insights into the reliability of LLM's output regarding a question. In this…

Computation and Language · Computer Science 2025-09-16 Longchao Da , Xiaoou Liu , Jiaxin Dai , Lu Cheng , Yaqing Wang , Hua Wei

The importance of intuitionistic temporal logics in Computer Science and Artificial Intelligence has become increasingly clear in the last few years. From the proof-theory point of view, intuitionistic temporal logics have made it possible…

Logic in Computer Science · Computer Science 2023-06-22 Joseph Boudou , Martín Diéguez , David Fernández-Duque , Philip Kremer

Let L be some extension of classical propositional logic. The non-iterated probabilistic logic over L, is the logic PL that is defined by adding non-nested probabilistic operators in the language of L. For example in PL we can express a…

Logic in Computer Science · Computer Science 2019-02-12 Ioannis Kokkinis

Dynamic Topological Logic (DTL) is a multimodal system for reasoning about dynamical systems. It is defined semantically and, as such, most of the work done in the field has been model-theoretic. In particular, the problem of finding a…

Logic · Mathematics 2012-01-26 David Fernández Duque

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

The decidability of axiomatic extensions of the modal logic K with modal reduction principles, i.e. axioms of the form $\Diamond^{k} p \rightarrow \Diamond^{n} p$, has remained a long-standing open problem. In this paper, we make…

Logic in Computer Science · Computer Science 2024-06-06 Piotr Ostropolski-Nalewaja , Tim S. Lyon

Standpoint extensions of knowledge representation formalisms have been recently introduced as a means to incorporate multi-perspective modelling and reasoning through modal operators that attribute pieces of knowledge to specific entities…

Logic in Computer Science · Computer Science 2025-08-04 Lucía Gómez Álvarez , Sebastian Rudolph

Possibilistic computation tree Logic (PoCTL) is one kind of branching temporal logic combined with uncertain information in possibility theory, which was introduced in order to cope with the systematic verification on systems with uncertain…

Logic in Computer Science · Computer Science 2025-10-28 Yongming Li

We review the notion of symplectic duality earlier introduced in the context of topological recursion. We show that the transformation of symplectic duality can be expressed as a composition of $x-y$ dualities in a broader context of log…

Mathematical Physics · Physics 2024-12-05 Alexander Alexandrov , Boris Bychkov , Petr Dunin-Barkowski , Maxim Kazarian , Sergey Shadrin

(Pre)closure spaces are a generalization of topological spaces covering also the notion of neighbourhood in discrete structures, widely used to model and reason about spatial aspects of distributed systems. In this paper we introduce an…

Logic in Computer Science · Computer Science 2021-01-01 Davide Castelnovo , Marino Miculan

Advances in natural language processing have resulted in increased capabilities with respect to multiple tasks. One of the possible causes of the observed performance gains is the introduction of increasingly sophisticated text…

Computation and Language · Computer Science 2020-11-19 Sarah Tymochko , Zachary New , Lucius Bynum , Emilie Purvine , Timothy Doster , Julien Chaput , Tegan Emerson

This paper is a study of first-order coherent logic from the point of view of duality and categorical logic. We prove a duality theorem between coherent hyperdoctrines and open polyadic Priestley spaces, which we subsequently apply to prove…

Logic · Mathematics 2024-06-21 Sam van Gool , Jérémie Marquès

We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem…

Logic in Computer Science · Computer Science 2025-10-29 Renato Neves

We explore a fuzzy modal logic that can formalise probabilistic reasoning about actions and knowledge. In particular, we deal with contexts involving statements about events expressed via modal formulas, e.g., "after doing $a$, the…

Logic in Computer Science · Computer Science 2026-04-27 Daniil Kozhemiachenko , Igor Sedlár

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti