English
Related papers

Related papers: Temporal interpretation of intuitionistic quantifi…

200 papers

Extensions of Answer Set Programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELf), provide an expressive computational framework for modeling dynamic applications. In this…

Artificial Intelligence · Computer Science 2024-01-23 Pedro Cabalar , Martín Diéguez , François Laferrière , Torsten Schaub

The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logic which is a semantical fragment of the logic…

Logic in Computer Science · Computer Science 2015-03-17 Ahmet Kara , Thomas Schwentick , Thomas Zeume

In this paper we demonstrate decidability for the intuitionistic modal logic S4 first formulated by Fischer Servi. This solves a problem that has been open for almost thirty years since it had been posed in Simpson's PhD thesis in 1994. We…

Logic in Computer Science · Computer Science 2023-08-01 Marianna Girlando , Roman Kuznets , Sonia Marin , Marianela Morales , Lutz Straßburger

We investigate the decidability of model-checking logics of time, knowledge and probability, with respect to two epistemic semantics: the clock and synchronous perfect recall semantics in partially observed discrete-time Markov chains.…

Logic in Computer Science · Computer Science 2015-11-11 Ron van der Meyden , Manas K. Patra

Temporal commonsense reasoning refers to the ability to understand the typical temporal context of phrases, actions, and events, and use it to reason over problems requiring such knowledge. This trait is essential in temporal natural…

Artificial Intelligence · Computer Science 2023-11-17 Georg Wenzel , Adam Jatowt

We investigate a version of linear temporal logic whose propositional fragment is G\"odel-Dummett logic (which is well known both as a superintuitionistic logic and a t-norm fuzzy logic). We define the logic using two natural semantics:…

Logic in Computer Science · Computer Science 2023-06-29 Juan Pablo Aguilera , Martín Diéguez , David Fernández-Duque , Brett McLean

We show that the amended monadic Grzegorczyk logic $\mathsf{M^+Grz}$ is the largest modal companion of the amended monadic intuitionistic logic $\mathsf{M^+IPC}$. Thus, unlike the monadic intuitionistic logic $\mathsf{MIPC}$, Esakia's…

Logic · Mathematics 2025-12-23 Guram Bezhanishvili , Luca Carai

We determine the ZF-provable modal logic of the modality $\Box_{\mathrm{sym}}$, where $\Box_{\mathrm{sym}}\varphi$ means '$\varphi$ holds in every finite symmetry-preserving iteration' of the symmetric method. We prove that the exact logic…

Logic · Mathematics 2025-10-23 Frank Gilson

Sandqvist gave a proof-theoretic semantics (P-tS) for classical logic (CL) that explicates the meaning of the connectives without assuming bivalance. Later, he gave a semantics for intuitionistic propositional logic (IPL). While soundness…

Logic · Mathematics 2025-07-18 Alexander V. Gheorghiu

The boxdot conjecture asserts that every normal modal logic that faithfully interprets T by the well-known boxdot translation is in fact included in T. We confirm that the conjecture is true. More generally, we present a simple semantic…

Logic · Mathematics 2017-01-03 Emil Jeřábek

This paper extends implication-space semantics to include first-order quantification. Implication-space semantics has recently been introduced as an inferentialist formal semantics that can capture nonmonotonic and nontransitive material…

Logic · Mathematics 2026-02-17 Ulf Hlobil

We investigate properties of monadic purely negational fragment of Intuitionistic Control Logic (ICL). This logic arises from Intuitionistic Propositional Logic (IPL) by extending language of IPL by additional new constant for falsum.…

Logic · Mathematics 2014-08-12 Anna Glenszczyk

There has been an increasing interest in topological semantics for epistemic logic, which has been shown to be useful for, e.g., modelling evidence, degrees of belief, and self-reference. We introduce a polytopological PDL capable of…

Logic in Computer Science · Computer Science 2026-02-17 Martín Diéguez , David Fernández-Duque

Deficiency in expressive power of the first-order logic has led to developing its numerous extensions by fixed point operators, such as Least Fixed-Point (LFP), inflationary fixed-point (IFP), partial fixed-point (PFP), etc. These logics…

Logic in Computer Science · Computer Science 2008-12-18 Alexei Lisitsa

We introduce continuation semantics for both fixpoint modal logic (FML) and Computation Tree Logic* (CTL*), parameterised by a choice of branching type and quantitative predicate lifting. Our main contribution is proving that they are…

Logic in Computer Science · Computer Science 2026-03-03 Ryota Kojima , Corina Cirstea

The main focus of this paper is on bisimulation-invariant MSO, and more particularly on giving a novel model-theoretic approach to it. In model theory, a model companion of a theory is a first-order description of the class of models in…

Logic · Mathematics 2016-05-04 Silvio Ghilardi , Samuel J. van Gool

In this short paper, we advocate for the idea that continuation-based intermediate languages correspond to intermediate logics. The goal of intermediate languages is to serve as a basis for compiler intermediate representations, allowing to…

Logic in Computer Science · Computer Science 2026-01-14 Jean Caspar , Guillaume Munch-Maccagnoni

Many Time Interpretation (MTI) proposes that each stochastic "quantum jump" ("reduction") concerning each single object (of an ensemble) represents a consequence of a (stochastic) choice (change) of Time. Therefore, each single object…

Quantum Physics · Physics 2009-09-25 Miroljub Dugic

We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…

Logic in Computer Science · Computer Science 2021-04-27 Melissa Antonelli , Ugo Dal Lago , Paolo Pistone

This draft introduces the technical machinery of a semantic framework for potentialist truthmaking based on our innovation of intentic states, which are structured partial models accounting for our distinction between non-hypothetical and…

Logic in Computer Science · Computer Science 2026-02-05 Paul Gorbow
‹ Prev 1 4 5 6 7 8 10 Next ›