Equivalence and difference between institutions: simulating Horn Clause Logic with based algebras

DOI10.1017/S0960129500000712zbMath0849.68080MaRDI QIDQ4856660

Till Mossakowski, Hans-Joerg Kreowski

Publication date: 4 November 1996

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

simulationinstitutionspartial algebrasHorn clause logicconditional equational logicalgebraic data type specificationsexpressiveness of logical frameworks

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Categorical logic, topoi (03G30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items

What is a logic translation?, Comorphisms of structured institutions, Relating CASL with other specification languages: the institution level.

Cites Work

• Unnamed Item
• Unnamed Item
• Equational type logic
• On the existence of free models in abstract algebraic institutions
• Specifications in an arbitrary institution
• Partial abstract types
• Partial algebras-survey of a unifying approach towards a two-valued model theory for partial algebras
• Institutions: abstract model theory for specification and programming