English
Related papers

Related papers: Temporal interpretation of intuitionistic quantifi…

200 papers

In a recent paper we showed that intuitionistic quantifiers admit the following temporal interpretation: "always in the future" (for $\forall$) and "sometime in the past" (for $\exists$). In this paper we study this interpretation for the…

Logic · Mathematics 2020-09-02 Guram Bezhanishvili , Luca Carai

We introduce the logic $\sf ITL^e$, an intuitionistic temporal logic based on structures $(W,\preccurlyeq,S)$, where $\preccurlyeq$ is used to interpret intuitionistic implication and $S$ is a $\preccurlyeq$-monotone function used to…

Logic · Mathematics 2017-04-11 Joseph Boudou , Martín Diéguez , David Fernández-Duque

The language of linear temporal logic can be interpreted over the class of dynamic topological systems, giving rise to the intuitionistic temporal logic ${{\sf ITL}^{\sf c}}_{\Diamond,\forall}$, recently shown to be decidable by…

Logic in Computer Science · Computer Science 2019-10-03 Joseph Boudou , Martín Diéguez , David Fernández-Duque

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a…

Logic · Mathematics 2015-04-21 Richard Zach

We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the…

Logic in Computer Science · Computer Science 2016-11-01 Robert Constable , Mark Bickford

In this paper we analyse logic of false belief in intuitionistic setting. This logic, studied in its classical version by Steinsvold, Fan, Gilbert and Venturi, describes the following situation: a formula F is not satisfied in a given…

Logic · Mathematics 2020-12-16 Tomasz Witczak

We propose four axiomatic systems for intuitionistic linear temporal logic and show that each of these systems is sound for a class of structures based either on Kripke frames or on dynamic topological systems. Our topological semantics…

We investigate a non-classical 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…

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

A dynamical system is a pair $(X,f)$, where $X$ is a topological space and $f\colon X\to X$ is continuous. Kremer observed that the language of propositional linear temporal logic can be interpreted over the class of dynamical systems,…

Logic · Mathematics 2023-06-22 David Fernández-Duque

Propositional temporal logic over the real number time flow is finitely axiomatisable, but its first-order counterpart is not recursively axiomatisable. We study the logic that combines the propositional axiomatisation with the usual axioms…

Logic · Mathematics 2025-08-13 Robert Goldblatt

Until is a notoriously difficult temporal operator as it is both existential and universal at the same time: A until B holds at the current time instant w iff either B holds at w or there exists a time instant w' in the future at which B…

Logic in Computer Science · Computer Science 2009-10-26 Andrea Masini , Luca Viganò , Marco Volpe

We introduce Qiana, a logic framework for reasoning on formulas that are true only in specific contexts. In Qiana, it is possible to quantify over both formulas and contexts to express, e.g., that ``everyone knows everything Alice says''.…

Artificial Intelligence · Computer Science 2026-04-03 Simon Coumes , Pierre-Henri Paris , François Schwarzentruber , Fabian Suchanek

Adding propositional quantification to the modal logics K, T or S4 is known to lead to undecidability but CTL with propositional quantification under the tree semantics (tQCTL) admits a non-elementary Tower-complete satisfiability problem.…

Logic in Computer Science · Computer Science 2023-06-22 Bartosz Bednarczyk , Stéphane Demri

We consider G\"odel temporal logic ($\sf GTL$), a variant of linear temporal logic based on G\"odel--Dummett propositional logic. In recent work, we have shown this logic to enjoy natural semantics both as a fuzzy logic and as a…

Logic in Computer Science · Computer Science 2022-12-05 Juan Pablo Aguilera , Martín Diéguez , David Fernández-Duque , Brett McLean

Lewis' theory of counterfactuals is the foundation of many contemporary notions of causality. In this paper, we extend this theory in the temporal direction to enable symbolic counterfactual reasoning on infinite sequences, such as…

Logic in Computer Science · Computer Science 2023-06-16 Bernd Finkbeiner , Julian Siber

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

One way of proving theorems in modal logics is translating them into the predicate calculus and then using conventional resolution-style theorem provers. This approach has been regarded as inappropriate in practice, because the resulting…

Logic in Computer Science · Computer Science 2021-12-30 Jian Zhang

In 1933, G\"odel introduced a provability interpretation of the propositional intuitionistic logic to establish a formalization for the BHK interpretation. He used the modal system, $\mathbf{S4}$, as a formalization of the intuitive concept…

Logic · Mathematics 2017-09-04 Amirhossein Akbar Tabatabai

Following a suggestion of Birkhoff and Von Neumann [Ann. Math. 37 (1936), 23-32], we pursue a joint study of quantum logic and intuitionistic logic. We exhibit a linear-time translation which for each quantum logic $Q$ and each…

Logic · Mathematics 2025-03-20 Juan P. Aguilera , Guillaume Massas

We consider Minkowski spacetime, the set of all point-events of spacetime under the relation of causal accessibility. That is, ${\sf x}$ can access ${\sf y}$ if an electromagnetic or (slower than light) mechanical signal could be sent from…

Logic · Mathematics 2017-06-13 Robin Hirsch , Mark Reynolds
‹ Prev 1 2 3 10 Next ›