\(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs

DOI10.1016/0304-3975(93)90347-VzbMath0802.03026MaRDI QIDQ1311976

M. K. Valiev

Publication date: 12 December 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

undecidabilityconcurrencypropositional dynamic logiciterated shufflevalidity probleminfinite computations of one-counter machinespartial commutativity relations on primitive programs

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Propositional dynamic logic of nonregular programs
• Theory of traces
• Propositional dynamic logic of regular programs
• Decision complexity of variants of propositional dynamic logic
• An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
• Software Descriptions with Flow Expressions

This page was built for publication: \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs