``During cannot be expressed by ``after

DOI10.1016/0022-0000(86)90005-XzbMath0607.03008MaRDI QIDQ1085154

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

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

Related Items

Computational inductive definability

Cites Work

• Equivalences among logics of programs
• Some relationships between logics of programs and complexity theory
• Definability in dynamic logic
• Expressing program looping in regular dynamic logic
• Definability by programs in first-order structures
• Parity, circuits, and the polynomial-time hierarchy
• Unnamed Item
• Unnamed Item
• Unnamed Item

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