Program-substitution and admissibility of rules in algorithmic logic

DOI10.1007/BF02737110zbMath0627.68031OpenAlexW1972914850MaRDI QIDQ1092655

Andrzej Biela

Publication date: 1988

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02737110

zbMATH Keywords

algorithmic logicadmissibility of rulesalgorithmic structural completenessnon- deterministic programsprogram substitution

Mathematics Subject Classification ID

Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)

Cites Work

• LAR: A logic of algorithmic reasoning
• Introduction to mathematical logic. Translated from the German by Diana Schmidt
• On the Decidability of Propositional Algorithmic Logic
• Structural completeness of the first‐order predicate calculus
• Algorithmic properties of structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Program-substitution and admissibility of rules in algorithmic logic