``During cannot be expressed by ``after

DOI10.1016/0022-0000(86)90005-XMaRDI QIDQ1085154zbMATH OpenFDO

Authors Paweł Urzyczyn

Publication date 1986

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

nondeterminismBoolean circuit complexitytemporal operatorsflowchartsarray assignmentsrich teststree schemes

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70)

Recommendations

• scientific article; zbMATH DE number 3968564
• A generalized nexttime operator in temporal logic
• The temporal logic of branching time
• scientific article; zbMATH DE number 17797
• scientific article; zbMATH DE number 3848600

Cites work

• scientific article; zbMATH DE number 3848600 (Why is no real title available?)
• scientific article; zbMATH DE number 3968564 (Why is no real title available?)
• scientific article; zbMATH DE number 3675301 (Why is no real title available?)
• Definability by programs in first-order structures
• Definability in dynamic logic
• Equivalences among logics of programs
• Expressing program looping in regular dynamic logic
• Parity, circuits, and the polynomial-time hierarchy
• Some relationships between logics of programs and complexity theory

Cited in

(1)

• Computational inductive definability

This page was built for publication: ``During cannot be expressed by ``after

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085154)