Many-sorted logic and its applications
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.
42 pages matching implies in this book
Results 1-3 of 42
What people are saying - Write a review
We haven't found any reviews in the usual places.
On Bounds for the Specification of Finite Data Types
List of Contributors
U Pletat J V Tucker
13 other sections not shown
Other editions - View all
algebra Andreka arithmetical arity 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 extensional finite first-order logic Fjnu formal function symbols Henkin implies IndbuT 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 partial correctness Pasztor Pnueli's predicate logic problem program verification program verification methods proof of lemma propositional 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 logics theorem theory three-sorted time-oriented NLP Tord translation Tsuc unary unification universal algebra universe unsorted validity variables of sort Z-algebra Z-formulae