Pith. sign in

REVIEW 3 cited by

Temporal Ensemble Logic

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.14443 v2 pith:Y7U5Y6D4 submitted 2024-08-26 cs.LO cs.AIcs.FL

classification cs.LOcs.AIcs.FL
keywords temporallogicmathbbtimebiomedicineconstructsdiscreteensemble
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We introduce Temporal Ensemble Logic (TEL), a monadic, first-order modal logic for linear-time temporal reasoning. TEL includes primitive temporal constructs such as ``always up to $t$ time later'' ($\Box_t$), ``sometimes before $t$ time in the future'' ($\Diamond_t$), and ``$t$-time later'' $\varphi_t$. TEL has been motivated from the requirement for rigor and reproducibility for cohort specification and discovery in clinical and population health research, to fill a gap in formalizing temporal reasoning in biomedicine. Existing logical frameworks such as linear temporal logic are too restrictive to express temporal and sequential properties in biomedicine, or too permissive in semantic constructs, such as in Halpern-Shoham logic, to serve this purpose. In this paper, we first introduce TEL in a general set up, with discrete and dense time as special cases. We then focus on the theoretical development of discrete TEL on the temporal domain of positive integers $\mathbb{N}^+$, denoted as ${\rm TEL}_{\mathbb{N}^+}$. ${\rm TEL}_{\mathbb{N}^+}$ is strictly more expressive than the standard monadic second order logic, characterized by B\"{u}chi automata. We present its formal semantics, a proof system, and provide a proof for the undecidability of the satisfiability of ${\rm TEL}_{\mathbb{N}^+}$. We also include initial results on expressiveness and decidability fragments for ${\rm TEL}_{\mathbb{N}^+}$, followed by application outlook and discussions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Discrete Linear Ensemble Logic

    cs.LO 2026-08 conditional novelty 7.0 of 10

    Discrete Ensemble Logic over the natural numbers is Sigma-1-1-complete for satisfiability, sits between star-free and monadic Presburger arithmetic, and has an NP-complete existential fragment.

  2. A Logic-based Temporal Cohort Discovery Engine: Algorithms, Indices, and Experimental Results on the National Sleep Research Resource

    cs.DB 2026-07 conditional novelty 6.0 of 10

    A QEL temporal-logic model-checking engine with new 2DFC/FCFC indexes makes interval-based sleep cohort queries explicit and fast on large PSG repositories.

  3. Scaling Up Formal Representation of Clinical Trial Protocols in Ensemble Logic Using LLMs: A Preliminary Study

    cs.LO 2026-07 conditional novelty 6.0 of 10

    An LLM-based pipeline translated 23 Alzheimer's clinical trial protocols into Temporal Ensemble Logic, with back-translation semantic similarity suggesting—but not proving—that much of the temporal meaning is preserved.

Pith tools