Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL

DOI10.1093/logcom/3.3.249zbMath0801.03016OpenAlexW2077311658MaRDI QIDQ4276172

Alberto Zanardo, José Carmo

Publication date: 5 December 1994

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/3.3.249

zbMATH Keywords

databasecompletenesssemanticsinformation systemsaxiomatizationconcurrent programnondeterministic timepast operatorsbranching-time temporal logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (9)

Axiomatization of a branching time logic with indistinguishability relations ⋮ Discrete tense logic with infinitary inference rules and systematic frame constants: A Hilbert-style axiomatization ⋮ \textit{Once} and \textit{for all} ⋮ Branching-time logic with quantification over branches: The point of view of modal logic ⋮ A hierarchy of temporal logics with past ⋮ An axiomatization of full Computation Tree Logic ⋮ Quantification over sets of possible worlds in branching-time semantics ⋮ Temporal Logics with Reference Pointers and Computation Tree Logics ⋮ An axiomatization of PCTL*

This page was built for publication: Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL