Equivalence and difference between institutions: simulating Horn Clause Logic with based algebras
DOI10.1017/S0960129500000712zbMATH Open0849.68080MaRDI QIDQ4856660FDOQ4856660
Till Mossakowski, Hans-Jörg Kreowski
Publication date: 4 November 1996
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
simulationinstitutionspartial algebrasHorn clause logicconditional equational logicalgebraic data type specificationsexpressiveness of logical frameworks
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Subsystems of classical logic (including intuitionistic logic) (03B20) Categorical logic, topoi (03G30) Abstract data types; algebraic specification (68Q65)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Institutions: abstract model theory for specification and programming
- Specifications in an arbitrary institution
- On the existence of free models in abstract algebraic institutions
- Partial algebras-survey of a unifying approach towards a two-valued model theory for partial algebras
- Equational type logic
- Partial abstract types
Cited In (4)
Recommendations
- Equality reasoning in sequent-based calculi 👍 👎
- On solving the equality problem in theories defined by Horn clauses 👍 👎
- Efficient deduction in equality Horn logic by Horn-completion 👍 👎
- An inference system for horn clause logic with equality 👍 👎
- A General Similarity Framework for Horn Clause Logic 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Equivalence and difference between institutions: simulating Horn Clause Logic with based algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4856660)
