``During cannot be expressed by ``after

DOI10.1016/0022-0000(86)90005-XzbMATH Open0607.03008MaRDI QIDQ1085154FDOQ1085154

Authors: Paweł Urzyczyn 

Publication date: 1986

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

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

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)

Cites Work

• Parity, circuits, and the polynomial-time hierarchy
• Title not available (Why is that?)
• Equivalences among logics of programs
• Definability in dynamic logic
• Expressing program looping in regular dynamic logic
• Definability by programs in first-order structures
• Some relationships between logics of programs and complexity theory
• Title not available (Why is that?)
• Title not available (Why is that?)

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)