Process logic: Expressiveness, decidability, completeness
type: Item
instance of: scholarly article
title: Process logic: Expressiveness, decidability, completeness
zbMATH Open document ID: 0494.03016
DOI: 10.1016/0022-0000(82)90003-4
author: David Harel
author: Dexter Kozen
author: Rohit Parikh
published in: Journal of Computer and System Sciences
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 3777459
zbMATH Keywords: process logic
zbMATH Keywords: extending propositional dynamic logic
zbMATH Keywords: temporal logic
zbMATH Keywords: axiomatization
MaRDI profile type: Publication
full work available at URL: 0022-0000(82)90003-4
OpenAlex ID: W1967494119
cites work: Q4130976
cites work: Q3917484
cites work: Equations between Regular Terms and an Application to Process Logic
cites work: Propositional dynamic logic of regular programs
cites work: First-order dynamic logic
cites work: Two results on process logic
cites work: Q3897035
cites work: An elementary proof of the completeness of PDL
cites work: Q4190096
cites work: Q4090322
cites work: Definability in dynamic logic
cites work: Descriptively complete process logic
cites work: Q5581604
cites work: Q4187287
cites work: A practical decision method for propositional dynamic logic (Preliminary Report)
cites work: A near-optimal method for reasoning about action
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q5596237
description: scientific article; zbMATH DE number 3777459