Many-sorted Logic and Its ApplicationsK. Meinke, J. V. Tucker Prominent experts present papers which discuss problems regarding this subject. Coverage includes case studies in the translation of logics for second-order and propositional dynamic logic; many-sorted algebras and equational logic; logical foundations of artificial intelligence along with a variety of methods that exist to encode information; program verification techniques such as Floyd-Hoare, intermittent assertion and temporal logic of programs. |
Contents
On Bounds for the Specification of Finite Data Types | 3 |
List of Contributors | 6 |
10 | 48 |
Copyright | |
14 other sections not shown
Other editions - View all
Common terms and phrases
a₁ Andréka Assume axioms b₁ Bergstra binary relation Burstall's calculus characteristic literals clauses Computer Science constant data types deduction defined definition denote domain dynamic logic E-algebra epimorphism equational specification equivalent expressions finite first-order logic formal function symbols Henkin Ind+ Indbur Indpnu Indqf induction interpretation knowledge base knowledge representation language logics of programs M(DR many-sorted algebra many-sorted logic many-sorted structure modal logic model theory Németi one-sorted OPER.SYM order-sorted unification paramodulation Pnueli's predicate logic problem program verification proof of lemma prove recursive relation symbols representation resolution Rng(s rules S₁ Sain second-order logic semantics signature single-sorted sort hierarchy sort literals sortal subset sucz syntactical t₁ t₂ taxonomic information temporal logic theorem theory time-oriented NLP Tord Tpnu Tucker unary universal algebra universe unsorted logic variables of sort x₁ z₁