Definability of Functional Properties in the Basic Modal-Temporal Language over Ordered Frames

Abstract: We study the expressive power of the simplest modal-temporal language, obtained by adding Prior's temporal operators (G) and (H) to the basic modal language with (\Box). This language is the standard bimodal combination of modal and tense logic; under its functional interpretation it is denoted (L_{T\times W}). To analyse its definability across five order types, we consider two semantic readings of the temporal operators: the standard reading ((G,H)), which includes the current instant, and the strict reading ((G^{\ast},H^{\ast})), which always excludes it. We examine nine functional properties -- totality, non-totality, injectivity, surjectivity, monotonicity, strict monotonicity, antitonicity, strict antitonicity, and constancy -- over preorders, strict preorders, partial orders, linear orders, and strict linear orders. Our analysis reveals two different levels of expressive power. In the original multiflow setting, the language is quite weak and the two readings coincide. When we restrict the semantics to minimal functional frames (the (O^{2}) family), many properties become definable, and the choice of reading becomes crucial: the strict reading can define properties such as injectivity even in reflexive orders. The same definability patterns appear with indexed languages and with the Uniform Domain condition on the semantics of (L_{T\times W}). That three such different ways of controlling functional multiplicity lead to identical definability patterns indicates that the expressive limitations of the original framework come from the uncontrolled multiplicity of functions, not from any weakness of the operators. Even after controlling functional multiplicity, a set of properties remains undefinable in all non-linear orders, showing that the lack of connectivity is a fundamental obstacle.

• The paper rigorously demonstrates that LₜₓW can define properties like totality and surjectivity in strict linear orders but fails in non-linear ones.
• It uses p-morphisms and functional bisimulations to establish sharp expressivity boundaries across various semantic settings, including minimal and indexed frames.
• The study highlights the necessity of structural constraints such as uniform domains to overcome inherent modal locality limitations in defining function properties.

Definability of Functional Properties in the Basic Modal-Temporal Language over Ordered Frames

Introduction and Problem Statement

The paper "Definability of Functional Properties in the Basic Modal-Temporal Language over Ordered Frames" (2607.01110) provides a comprehensive study of the expressive boundaries of the modal-temporal language $L_{T\times W}$—the standard bimodal combination of modal and tense logic, equipped with Prior’s operators $G$ and $H$ together with the modal operator $\Box$. The main technical focus is on determining which properties of partial functions between ordered sets (e.g., totality, injectivity, surjectivity, monotonicity) can be defined by formulas in $L_{T\times W}$ when evaluated over varying classes of ordered frames.

Key distinctions are drawn between:

• Two semantic interpretations of the tense operators: the standard (Priorean) and strict (excluding the current point),
• The structural setting: general multiflow frames (unrestricted families of functions), minimal functional frames (essentially "single-function" semantics), and additional constraint schemes such as indexed languages and uniform domains.

The investigation is comprehensive across order types: strict/preorders, partial/linear orders, and their strict variants.

Syntax, Semantics, and Algebraic Correspondence

$L_{T\times W}$ formulas are constructed using propositional variables, boolean connectives, modal $\Box$, and temporal $G$, $H$. The frame semantics comprise disjoint families of ordered sets (\emph{flows}), together with families of partial functions between them (\emph{accessibility functions}). The modal operator $\Box$ universally quantifies over successor images under all available functions.

A thorough algebraic analysis is performed, yielding precise per-function and per-class characterizations of functional properties in terms of order-theoretic inclusions of images of intervals (constructed via $G$0, $G$1, and their strict analogs). These are shown to exactly align with the modal and temporal reach of $G$2 when interpreted over linear and strict linear orders.

Definability in General Multiflow Frames

The central technical contribution is a sharp classification of which functional properties are (or are not) definable in $G$3 as the underlying flows (ordered sets) and the multiplicity of functions are varied.

Main structural findings:

• In arbitrary multiflow frames (with multiple, indistinguishable functions), $G$4 is provably weak: only totality and surjectivity can be defined, and even then only over (strict) linear orders.
• The choice between standard and strict interpretations of $G$5 does not affect these definability limitations in the multiflow setting.

The proofs are grounded in the methodology of p-morphisms and functional bisimulations, extending the Goldblatt-Thomason modal preservation theorem to the functional, ordered context.

Expressivity Gains in Minimal and Controlled Semantics

Major advances are shown when structure is tightly constrained:

Minimal Functional Frames:

• By restricting to at most two flows and a single function (collapsing the second-order modal quantification to first-order), the definability of a broad family of function properties is achieved. Notably, monotonicity and antitonicity become definable in all order types; injectivity and constancy are recovered for $G$6 (injectivity for $G$7 under the strict temporal reading).
• The strict (irreflexive) interpretation of $G$8 enables the definition of strict monotonicity and injectivity in $G$9, showing the advantage of this reading in reflexive orders.

Indexed Languages and Uniform Domain:

• Syntactic control (indexed modal operators specifying functions) and domain-uniformity among functions both yield the same expressive reach as the minimal (single-function) setting.
• The correspondence between definability in minimal frames and indexed semantics is formalized and established at the level of arbitrary function properties, making this an equivalence result.
• Imposing uniform domains on multiflows makes previously non-definable properties definable, mirroring the minimal (or indexed) settings.

Limits of Expressibility: Undefinability Results

For non-linear orders (preorders, posets, and their strict variants), there exists an immutable "hard core" of functional properties—totality, surjectivity, injectivity, constancy, and their negations—that $H$0 cannot distinguish, even when controlling function multiplicity or varying the temporal reading. This rigidity is traced to the lack of global order-theoretic connectivity, which temporal modalities that propagate only locally cannot overcome.

All positive and negative results are established with explicit modal formulas or robust counterexamples (p-morphisms/bisimulations or semantic equivalence constructions where p-morphism techniques are inapplicable, as for constancy).

Implications and Prospects

Theoretical Implications:

• The expressive power of modal-temporal logic over function systems is shown to hinge more on the modality for isolating function graphs (via indices, minimality, or domain control) than on the primitives of the temporal language per se.
• The limitation on definability by order connectivity exposes a fundamental bound for all logics whose temporal quantification is inherently local.

Practical/Methodological Impact:

• For specifying, verifying, or classifying functional properties (such as determinism, reversibility, various forms of monotonicity) in dynamic systems modeled via multimodal, temporal frameworks, adopting either controlled multiplicity (minimality/indices) or uniform-domain constraints is necessary for full expressive adequacy.
• The technical taxonomy, complete with explicit logical schemata, provides an immediate resource for modal logicians engineering tailored fragments or logics over function systems.

Future Directions:

• Two avenues are outlined: enrichment of frames with connectivity/cohesion mechanisms, potentially using infinitary connectives; and the addition of genuinely global operators such as the universal modality, bypassing temporal accessibility to restore definability in non-linear orders.

Conclusion

The study rigorously determines that the basic modal-temporal language $H$1 is subject to a sharp expressivity boundary in its capacity to define functional properties, determined both by the order-theoretic structure of the flows and by the degree of access to function multiplicity. Structural simplifications or syntactic labeling are both essential for fine-grained definability. The persistent gap for non-linear orders traces back to modal locality, not to any technical defect in the modal-temporal syntax, and likely marks an inescapable frontier within this logical paradigm.