English
Related papers

Related papers: Axiomatic systems and topological semantics for in…

200 papers

We investigate a class of first-order temporal-epistemic logics for reasoning about multi-agent systems. We encode typical properties of systems including perfect recall, synchronicity, no learning, and having a unique initial state in…

Multiagent Systems · Computer Science 2014-01-25 Francesco Belardinelli , Alessio Lomuscio

In recent work, we introduced a new semantics for conditionals, covering a large class of what we call preconditionals. In this paper, we undertake an axiomatic study of preconditionals and subclasses of preconditionals. We then prove that…

Logic · Mathematics 2025-08-29 Wesley H. Holliday

We study knowable informational dependence between empirical questions, modeled as continuous functional dependence between variables in a topological setting. We also investigate epistemic independence in topological terms and show that it…

Logic · Mathematics 2024-01-17 Alexandru Baltag , Johan van Benthem

Logical formalisms for reasoning about relations between spatial regions play a fundamental role in geographical information systems, spatial and constraint databases, and spatial reasoning in AI. In analogy with Halpern and Shoham's modal…

Logic in Computer Science · Computer Science 2017-01-11 Carsten Lutz , Frank Wolter

When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to an arbitrary set of axioms is hard, even for relatively…

Logic in Computer Science · Computer Science 2007-05-23 Ian Horrocks , Stephan Tobies

We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-order logic by strictly positive inductive and coinductive definitions. We define a realizability interpretation of IFP and use it to extract…

Logic in Computer Science · Computer Science 2023-07-25 Ulrich Berger , Hideki Tsuiki

We propose a novel ranking-based semantics for Dung-style argumentation frameworks with the help of conditional logics. Using an intuitive translation for an argumentation framework to generate conditionals, we can apply nonmonotonic…

Artificial Intelligence · Computer Science 2020-08-07 Kenneth Skiba , Matthias Thimm

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

We study the positive logic FO+ on finite words, and its fragments, pursuing and refining the work initiated in [Kuperberg 2023]. First, we transpose notorious logic equivalences into positive first-order logic: FO+ is equivalent to LTL+ ,…

Logic in Computer Science · Computer Science 2024-06-26 Denis Kuperberg , Quentin Moreau

We present three examples of \textit{multi-topological} semantics for intuitionistic modal logic with one modal operator $\Box$ (which behaves in some sense like necessity). We show that it is possible to treat neighborhood models,…

Logic · Mathematics 2019-03-19 Tomasz Witczak

We present a non-deterministic semantic framework for all modal logics in the modal cube, extending prior works by Kearns and others. Our approach introduces modular and uniform multi-valued non-deterministic matrices (Nmatrices) for each…

Logic in Computer Science · Computer Science 2025-07-16 Renato Leme , Carlos Olarte , Elaine Pimentel , Marcelo E. Coniglio

In 1988, Ivlev proposed four-valued non-deterministic semantics for modal logics in which the alethic T axiom holds good. Unfortunately, no completeness was proved. In previous work, we proved completeness for some Ivlev systems and…

Logic · Mathematics 2018-08-31 Marcelo E. Coniglio , Luis Fariñas del Cerro , Newton M. Peron

We give labeled natural deduction systems for a family of tense logics extending the basic linear tense logic Kl. We prove that our systems are sound and complete with respect to the usual Kripke semantics, and that they possess a number of…

Logic in Computer Science · Computer Science 2008-03-25 Luca Viganò , Marco Volpe

We present an elementary introduction to a new logic for reasoning about behaviors that occur over time. This logic is based on temporal type theory. The syntax of the logic is similar to the usual first-order logic; what differs is the…

Logic · Mathematics 2022-11-04 Brendan Fong , Alberto Speranzon , David I. Spivak

In previous work [Lewitzka, Log. J. IGPL 2017], we presented a hierarchy of classical modal systems, along with algebraic semantics, for the reasoning about intuitionistic truth, belief and knowledge. Deviating from G\"odel's interpretation…

Logic in Computer Science · Computer Science 2019-01-01 Steffen Lewitzka

Using the previously developed concepts of semantic spacetime, I explore the interpretation of knowledge representations, and their structure, as a semantic system, within the framework of promise theory. By assigning interpretations to…

Artificial Intelligence · Computer Science 2017-08-02 Mark Burgess

Recent years witnessed a growing interest in non-standard epistemic logics of knowing whether, knowing how, knowing what, knowing why and so on. The new epistemic modalities introduced in those logics all share, in their semantics, the…

Artificial Intelligence · Computer Science 2017-07-28 Yanjing Wang

We define a family of propositional constructive modal logics corresponding each to a different classical modal system. The logics are defined in the style of Wijesekera's constructive modal logic, and are both proof-theoretically and…

Logic · Mathematics 2022-10-19 Tiziano Dalmonte

Correspondence theory allows us to create sound and complete axiomatizations for modal logic on frames with certain properties. For example, if we restrict ourselves to transitive frames we should add the axiom $\square \phi \rightarrow…

Logic in Computer Science · Computer Science 2023-07-12 Philippe Balbiani , Wiebe van der Hoek , Louwe B. Kuijer

Suitable extensions of the monadic second-order theory of k successors have been proposed in the literature to capture the notion of time granularity. In this paper, we provide the monadic second-order theories of downward unbounded layered…

Logic in Computer Science · Computer Science 2007-05-23 M. Franceschet , A. Montanari