Gödel Temporal Logic (GTL)

• GTL is a temporal logic based on Gödel–Dummett logic that fuses fuzzy semantics with superintuitionistic principles to handle graded truth.
• It offers two complementary semantics—real-valued fuzzy and bi-relational intuitionistic—which ensure equivalent interpretations of temporal formulas.
• GTL maintains PSPACE-complete complexity and decidability through finite quasimodels and a complete Hilbert-style axiomatization despite lacking the finite model property.

Gödel Temporal Logic (GTL) is a variant of linear temporal logic whose propositional core is Gödel–Dummett logic—a superintuitionistic system notable for its t-norm fuzzy semantics and linear Kripke models. GTL provides a framework for reasoning about graded temporal information where truth values are drawn from the continuous interval $[0,1]$, supporting both fuzzy and superintuitionistic interpretations. The logic admits two canonical, equivalent semantics (real-valued and bi-relational), a Hilbert-style complete axiomatization, and has a decision problem that is PSPACE-complete, matching the complexity of classical LTL. GTL diverges from classical temporal logics through its richer propositional basis and non-classical behavior of temporal connectives, while preserving key structural features of temporal reasoning (Aguilera et al., 2023, Aguilera et al., 2022).

1. Syntax and Formula Construction

The formula language $\mathcal{L}$ of GTL consists of countably many propositional variables $p, q, r, \ldots$ and is defined by the BNF:

$$\varphi ::= p \mid \bot \mid \top \mid (\varphi \wedge \varphi) \mid (\varphi \vee \varphi) \mid (\varphi \to \varphi) \mid (\varphi \mathbin{=} \varphi) \mid X\varphi \mid G\varphi \mid F\varphi \mid (\varphi \mathbin{U} \varphi)$$

Here:

• $X$ (“next”), $G$ (“henceforth”), $F$ (“eventually”), and $U$ (“until”) are temporal modalities.
• $\to$ is Gödel (residual) implication; $=$ is co-implication (the Heyting–Brouwer dual).
• Classical negation is not primitive, but can be encoded as $\neg\varphi := \varphi = \bot$.
• The language is closed under intuitionistic connectives (including derived constructs such as $R$ (“release”) and past modalities, though the focus is on the future fragment).

This syntax enables direct expression of both fuzzy gradations and intuitionistic orderings in temporal reasoning (Aguilera et al., 2023, Aguilera et al., 2022).

2. Real-Valued (Fuzzy) Semantics

In the fuzzy semantics, time is modeled by $(\mathbb{N},S)$, with successor $S(n) = n+1$. A real-valued model is a map

$$v: \mathrm{Prop} \times \mathbb{N} \rightarrow [0,1]$$

interpreted recursively:

• $v(\top,t) = 1;\quad v(\bot,t) = 0$
• $$v(\varphi \wedge \psi, t) = \min\{v(\varphi, t), v(\psi, t)\}$$
• $$v(\varphi \vee \psi, t) = \max\{v(\varphi, t), v(\psi, t)\}$$
• $v(\varphi \to \psi, t) = 1$ if $v(\varphi, t) \le v(\psi, t)$; otherwise $v(\psi, t)$
• $v(\varphi = \psi, t) = v(\psi, t)$ if $v(\varphi, t) \le v(\psi, t)$; otherwise $1$
• $v(X\varphi, t) = v(\varphi, t+1)$
• $v(G\varphi, t) = \inf_{k\ge t} v(\varphi, k)$; $v(F\varphi, t) = \sup_{k\ge t} v(\varphi, k)$
• $$v(\varphi\,U\,\psi, t) = \sup_{k \ge t} \min\bigl(v(\psi, k), \inf_{t \le j < k} v(\varphi, j)\bigr)$$

A formula is valid in real-valued semantics if $v(\varphi,t) = 1$ for all $t$ and all models, supporting the interpretation of statements with intermediate truth values (Aguilera et al., 2023, Aguilera et al., 2022).

3. Bi-Relational (Superintuitionistic) Semantics

The bi-relational semantics treats GTL as a superintuitionistic temporal logic. A bi-relational frame is a triple $(W, \leq, S)$ with:

• $W$ a non-empty set of “worlds,” linearly ordered by $\leq$
• $S: W \to W$ is a bijection (“next”)

A valuation maps each variable to a downward-closed subset of $W$. For $w \in W$:

• $[\bot] = \emptyset;$ $[\top] = W$
• $[\varphi \wedge \psi] = [\varphi] \cap [\psi]$; $[\varphi \vee \psi] = [\varphi] \cup [\psi]$
• $$[\varphi \to \psi] = \{w \mid \forall v \le w: v \in [\varphi] \Rightarrow v \in [\psi] \}$$
• $$[\varphi = \psi] = \{w \mid \exists v \le w: v \in [\varphi], v \notin [\psi]\}$$
• $[X\varphi] = S^{-1}([\varphi])$
• $[G\varphi] = \bigcap_{n \ge 0} S^{-n}([\varphi])$; $[F\varphi] = \bigcup_{n \ge 0} S^{-n}([\varphi])$
• $$[\varphi\,U\,\psi] = \{ w \mid \exists n \ge 0,\; wS^n u,\, u \in [\psi],\, \forall 0 \le i < n,\; wS^i v \in [\varphi] \}$$

A formula is valid if it holds at all worlds for every such bi-relational model. This semantics encodes both intuitionistic monotonicity (under $\leq$) and linear temporal evolution (via $S$) (Aguilera et al., 2023, Aguilera et al., 2022).

4. Equivalence of the Two Semantics

The principal semantic result is that the set of formulas valid in the real-valued semantics exactly coincides with that valid in the bi-relational semantics (Aguilera et al., 2023), Thm. 3.3. This equivalence is established by:

• Forwards: given a real-valued model, constructing a bi-relational frame of real “cut-points” and showing agreement under inductive interpretation of all connectives.
• Backwards: given a (countable) bi-relational model, embedding its structure in $[0,1]$ and reconstructing a real-valued assignment with value agreement.

This result allows flexible interchange between fuzzy and intuitionistic perspectives and supports the transfer of results (e.g., validity, definability) between frameworks.

5. Quasimodels, Decidability, and the Failure of the Finite Model Property

Neither semantics admits the finite model property: certain non-valid formulas can only be falsified on infinite structures. However, finite quasimodels can always be constructed to falsify unprovable formulas. Quasimodels are finite, nondeterministic Kripke-style labeled systems satisfying:

• Local linearity and monotonicity
• Witnessing conditions for $U$ and $G$ modalities
• A temporal accessibility relation with bi-seriality and confluence

The construction involves collapsing equivalence classes of types and formulas to yield finite labeled systems, then closing $R$ to a convex, bi-serial, and w-sensible relation. This ensures that, for every falsifiable formula, there is a finite quasimodel falsifying it. Thus, GTL is decidable, with a non-deterministic exponential time procedure (by brute-force enumeration of types) (Aguilera et al., 2023), Thm. 6.7.

6. Computational Complexity

The validity (and satisfiability) problem for GTL is PSPACE-complete:

• PSPACE-hardness: achieved by a polynomial-time encoding of classical LTL into GTL via negative translation, where $\varphi^*$ sends each atomic $p$ to $\neg p$ and commutes with all connectives.
• PSPACE-membership: due to the existence of small ultimately periodic quasimodels (“lassos” of polynomial size in $|\varphi|$), a nondeterministic polynomial space algorithm can decide validity/satisfiability (Aguilera et al., 2023), Thm. 11.11.

This aligns GTL with the complexity of classical LTL, despite the enriched propositional and semantic structure.

7. Hilbert-Style Axiomatic Calculus

A complete Hilbert-system axiomatization for GTL comprises:

• Propositional base: All intuitionistic tautologies using $\wedge,\vee,\to$.
• Co-implication axioms: Heyting–Brouwer (e.g., $(\varphi=\psi) \to (\psi=\varphi)$).
• Linearity (Gödel–Dummett): $(\varphi \to \psi) \vee (\psi \to \varphi)$ enforces chain completeness.
• Temporal axioms: Schemas for $X$, $G$, distribution over $\to$ and $=$, co-induction and induction principles for $G$ and $F$.
• Past–future links: Axioms connecting $Y$ (“yesterday”) to $X$ and $G$ where present.
• Inference rules: Modus ponens, necessitation for $X$ and $G$.

This calculus is sound and complete for both real-valued and bi-relational semantics, established through a canonical type-space construction, filtration, and quasimodel techniques (Aguilera et al., 2023, Aguilera et al., 2022).

Aspect	LTL (Classical)	GTL
Propositional base	Boolean	Gödel–Dummett (superintuitionistic, fuzzy)
Truth values	{0,1}	$[0,1]$ (fuzzy) or chains (Kripke)
Temporal modalities	$X, F, G, U$	$X, F, G, U$
Complexity	PSPACE-complete	PSPACE-complete
Finite model prop.	Holds	Fails
Finite quasimodels	N/A	Always exist for falsifiable formulas

The inclusion of fuzzy and intuitionistic constructs makes GTL a natural setting for non-binary temporal reasoning, with applications in systems where graded truth and linear temporal progression are intertwined (Aguilera et al., 2023, Aguilera et al., 2022).