On the computational complexity of satisfiability in propositional logics of programs
type: Item
instance of: scholarly article
title: On the computational complexity of satisfiability in propositional logics of programs
zbMATH Open document ID: 0496.68020
DOI: 10.1016/0304-3975(89)90083-2
author: Bogdan S. Chlebus
published in: Theoretical Computer Science
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03B60
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 3782372
zbMATH Keywords: complexity classes
zbMATH Keywords: nondeterminism
zbMATH Keywords: alternating Turing machine
zbMATH Keywords: satisfiability problem
zbMATH Keywords: propositional algorithmic logic
zbMATH Keywords: propositional dynamic logic
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90083-2
OpenAlex ID: W2047769025
cites work: Alternation
cites work: Completeness Proofs for Some Logics of Programs
cites work: On the Decidability of Propositional Algorithmic Logic
cites work: Propositional dynamic logic of regular programs
cites work: Q5592246
cites work: Space-bounded reducibility among combinatorial problems
cites work: Q4047108
cites work: Q4164784
cites work: A near-optimal method for reasoning about action
cites work: Q5596237
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: Decision complexity of variants of propositional dynamic logic
description: scientific article; zbMATH DE number 3782372