Axiomatization of a branching time logic with indistinguishability relations
From MaRDI portal
Publication:288245
DOI10.1007/s10992-015-9369-3zbMath1392.03027OpenAlexW1987512432MaRDI QIDQ288245
Publication date: 25 May 2016
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10992-015-9369-3
finite axiomatizationindistinguishabilitybranching-timebundled treeirreflexivity rulestrong completeness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Is the semantics of branching structures adequate for chronological modal logics?
- A hierarchy of temporal logics with past
- The temporal logic of branching time
- Using branching time temporal logic to synthesize synchronization skeletons
- A finite axiomatization of the set of strongly valid Ockhamist formulas
- Decidability for branching time
- Undivided and indistinguishable histories in branching-time logics
- Temporal logic. 1st International Conference, ICTL '94, Bonn, Germany, July 11-14, 1994. Proceedings
- Temporal logic. From ancient ideas to artificial intelligence
- Axiomatization of `Peircean' branching-time logic
- An axiomatization of PCTL*
- An axiomatization of full Computation Tree Logic
- “Sometimes” and “not never” revisited
- Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL
- Axioms for Branching Time
This page was built for publication: Axiomatization of a branching time logic with indistinguishability relations