Pages that link to "Item:Q4276172"
From MaRDI portal
The following pages link to Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL (Q4276172):
Displaying 10 items.
- Axiomatization of a branching time logic with indistinguishability relations (Q288245) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- A hierarchy of temporal logics with past (Q672329) (← links)
- An extended branching-time Ockhamist temporal logic (Q1288173) (← links)
- Discrete tense logic with infinitary inference rules and systematic frame constants: A Hilbert-style axiomatization (Q1914372) (← links)
- Quantification over sets of possible worlds in branching-time semantics (Q2500778) (← links)
- An axiomatization of PCTL* (Q2566222) (← links)
- An axiomatization of full computation tree logic (Q2758043) (← links)
- Temporal Logics with Reference Pointers and Computation Tree Logics (Q4443400) (← links)
- Branching-time logic with quantification over branches: The point of view of modal logic (Q4879898) (← links)