Let . By computation tree logic semantics, a state belongs to exactly when every infinite path in a transition system starting there stays in at every position, including position zero. There are no terminal states, so every state lies at the start of an infinite path in a transition system.
If , then . For any successor of , every infinite path in a transition system from can be prefixed with . Hence every such continuation stays in , so . Thus and .
Conversely, if , then and every successor belongs to . Every infinite path in a transition system from therefore has its first state in and its entire remaining tail in . Consequently . Both inclusions giveso the desired satisfaction set is a fixed point of .
Temporal logic Created 2026-10-31 Updated 2026-11-05
Temporal logic extends ordinary mathematical logic with assertions about successive states or times. Temporal operators express properties such as eventually holding, always holding, or holding until another condition occurs.
In linear temporal logic, says that every request is eventually answered along a trace. A safety property rules out a bad finite behavior; a liveness property requires future progress. Computation tree logic additionally distinguishes possible execution paths. The choice of linear or branching time determines exactly which system behaviors a formula quantifies over.