scientific article

zbMath0648.03018MaRDI QIDQ3792662

Andrzej Salwicki, Grazyna Mirkowska

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexityChurch's thesisdeterminismconcurrencynondeterminismalgorithmic logicHilbert-style axiomatizationtheory of algorithmseffective computabilitymodal logics of programsLOGLAN programming languagealgorithmic properties of data structures

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithms in computer science (68W99)

Related Items

A complete axiomatic characterization of first-order temporal logic of linear time, Recursive \(\omega\)-rule for proof systems, Towards reasoning about Hoare relations, Contribution of Warsaw logicians to computational logic, Completeness of Hoare Logic Relative to the Standard Model, Axiomatizing fixpoint logics, On strictly arithmetical completeness in logics of programs, Fifty years of Hoare's logic, On an algorithm determining direct superclasses in Java and similar languages with inner classes-its correctness, completeness and uniqueness of solutions, An essay in combinatory dynamic logic, Two impossibility theorems on behaviour specification of abstract data types