Completeness of algorithmic logic

DOI10.1007/BF01069325zbMATH Open0459.68002MaRDI QIDQ3909986FDOQ3909986

B. A. Trakhtenbrot

Publication date: 1979

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

programming languagesnondeterminismmodalitiesprocedure calls

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Other nonclassical logic (03B60) Abstract data types; algebraic specification (68Q65) Algorithms in computer science (68W99)

Cites Work

• Title not available (Why is that?)
• Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems

This page was built for publication: Completeness of algorithmic logic

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