Many-sorted Logic and its Applications
K. Meinke, J. V. Tucker
Wiley, Mar 9, 1993 - Computers - 416 pages
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
List of Contributors
U Pletat J V Tucker
Germany Singleton Park Swansea SA2
12 other sections not shown
Andreka arithmetical Assume axioms binary relation Burstall's calculus characterisation characteristic literals clauses Computer Science congruence data domain data types deduction defined definition denote domain dynamic logic elements equations equivalent expressions extended first-order extensional finite first-order logic formal function symbols Henkin implies Indbm Indbu Indcl Indqf interpretation language Let p e logics of programs many-sorted logic many-sorted structure modal logic model theory multimodal logics Nemeti non-standard Nxt<p one-sorted OPER.SYM order-sorted Pasztor Pnueli's predicate logic program verification program verification methods proof of lemma proposition provable prove recursive relation symbols Rng(s rules Sain second-order logic semantics signature similarity type sort hierarchy sort literals sortal sound and complete subset sucz syntactical temporal logic theorem theory three-sorted time-oriented NLP Tord translation Tsuc unary unification universal algebra universe unsorted logic validity variables of sort Z-algebra Z-formula