From total equational to partial first-order logic

MaRDI QIDQ4702593zbMATH OpenFDO

Authors Maura Cerioli, Till Mossakowski, Horst Reichel

Publication date 24 November 1999

zbMATH Keywords

algebraic frameworksconditional fragmentsdata type specificationerror algebrasfree modelsorder-sortednesspartial first-order logic

Mathematics Subject Classification ID

Classical first-order logic (03B10) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)

Recommendations

• Equational type logic
• A first order logic for partial functions (extended abstract)
• A first order logic for partial functions
• Free objects and equational deduction for partial conditional specifications
• Near-equational and equational systems of logic for partial functions. I

Cited in

(8)

• Equational methods in first order predicate calculus
• CASL: the Common Algebraic Specification Language.
• Relating CASL with other specification languages: the institution level.
• Some co-Birkhoff type theorems
• scientific article; zbMATH DE number 4112566 (Why is no real title available?)
• scientific article; zbMATH DE number 176127 (Why is no real title available?)
• Inversive meadows and divisive meadows
• Dynamic Reconfiguration via Typed Modalities

This page was built for publication: From total equational to partial first-order logic

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