Computational aspects of an order-sorted logic with term declarations
From MaRDI portal
Publication:1801289
zbMath0689.68001MaRDI QIDQ1801289
Publication date: 5 June 1993
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
68Q65: Abstract data types; algebraic specification
03B35: Mechanization of proofs and logical operations
68-02: Research exposition (monographs, survey articles) pertaining to computer science
03D03: Thue and Post systems, etc.
Related Items
Tableau methods for a logic with term declarations, Solving divergence in Knuth--Bendix completion by enriching signatures, A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics, A rewrite-based type discipline for a subset of computer algebra, The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning, Semantics of order-sorted specifications, An order-sorted logic for knowledge representation systems, An algebraic semantics of higher-order types with subtypes, A resolution principle for constrained logics, Reduction and unification in lambda calculi with a general notion of subtype, Another look at parameterization for oder-sorted algebraic specifications, On Skolemization in constrained logics, Unification in sort theories and its applications, An order-sorted resolution in theory and practice, Fuzzy types: A framework for handling uncertainty about types of objects, A typed resolution principle for deduction with conditional typing theory, A note on assumptions about Skolem functions, Unnamed Item
