Permissive subsorted partial logic in CASL

DOI10.1007/BFB0000465MaRDI QIDQ4373553zbMATH OpenFDO

Authors Maura Cerioli, Bernd Krieg-Brückner, Till Mossakowski, Anne Elisabeth Haxthausen

Publication date 21 January 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

CoFI algebraic specification languageorder-sorted logicoverload resolution algorithmpermissive subsorted partial logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Applications of universal algebra in computer science (08A70) Abstract data types; algebraic specification (68Q65)

Recommendations

• Subsorted partial higher-order logic as an extension of CASL
• Substructural logic and partial correctness
• Subset-logic programs and their implementation
• Permissive-nominal logic: first-order logic over nominal terms and sets
• A paraconsistent and substructural conditional logic
• Substructural logics: a primer
• Combinatory logic and the semantics of substructural logics
• The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning
• Partial deduction for structured logic programming
• Substructural Logics in Natural Deduction

Cited in

(5)

• Amalgamation in the semantics of CASL
• CASL: the Common Algebraic Specification Language.
• Relating CASL with other specification languages: the institution level.
• Subsorted partial higher-order logic as an extension of CASL
• Generalized Theoroidal Institution Comorphisms

Describes a project that uses

Uses Software

• CoFI

This page was built for publication: Permissive subsorted partial logic in CASL

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