A new sorted logic

DOI10.1007/BFB0018991MaRDI QIDQ4261067zbMATH OpenFDO

Authors Christoph Weidenbach

Publication date 2 September 1999

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

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

Mathematics Subject Classification ID

Classical first-order logic (03B10) Mechanization of proofs and logical operations (03B35)

Recommendations

• Simultaneous rigid sorted unification
• scientific article; zbMATH DE number 67965
• Unification in sort theories and its applications
• Simultaneous rigid sorted unification for tableaux

Cited in

(12)

• A more expressive formulation of many sorted logic
• Completing sort hierarchies
• Converting untyped formulas to typed ones
• On Skolemization in constrained logics
• Simultaneous rigid sorted unification for tableaux
• Resolution for label-based formulas in hierarchical representation
• scientific article; zbMATH DE number 4168655 (Why is no real title available?)
• A many sorted logic with possibly empty sorts
• scientific article; zbMATH DE number 549956 (Why is no real title available?)
• Simultaneous rigid sorted unification
• Sort it out with monotonicity. Translating between many-sorted and unsorted first-order logic
• Order-sorted logic programming with predicate hierarchy

This page was built for publication: A new sorted logic

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