Modal Logic: Graph. Darst
Cambridge University Press, 22 de ago de 2002 - 554 páginas
This is an advanced 2001 textbook on modal logic, a field which caught the attention of computer scientists in the late 1970s. Researchers in areas ranging from economics to computational linguistics have since realised its worth. The book is for novices and for more experienced readers, with two distinct tracks clearly signposted at the start of each chapter. The development is mathematical; prior acquaintance with first-order logic and its semantics is assumed, and familiarity with the basic mathematical notions of set theory is required. The authors focus on the use of modal languages as tools to analyze the properties of relational structures, including their algorithmic and algebraic aspects, and applications to issues in logic and computer science such as completeness, computability and complexity are considered. Three appendices supply basic background information and numerous exercises are provided. Ideal for anyone wanting to learn modern modal logic.
O que estão dizendo - Escrever uma resenha
Não encontramos nenhuma resenha nos lugares comuns.
Appendix B An Algebraic Toolkit
A Guide to the Literature
List of Notation 544
Outras edições - Visualizar todos
algebras with operators arbitrary atomic axioms basic modal language basic temporal language Benthem binary relation bisimulation boolean algebras bounded morphic image bounded morphism canonical model Chapter class of frames complete with respect completeness result computational contains correspondence countably decidable define Definition denote discussion disjoint union equivalent example EXPTIME extending filtration finite model property first-order formula first-order logic fragment hence Hintikka sets homomorphism hybrid logic induction isomorphic Lemma Lindenbaum-Tarski algebras MCSs modal formula modal operators modal similarity type models 90t natural numbers nodes normal logic normal modal logic notation notion ºſt polysize programs proof proposition letters propositional logic prove PSPACE quantifiers reader reflexive Sahlqvist formula satisfiability problem second-order semantics set of formulas simple standard translation subformula submodel subset suppose temporal logic tense logic Theorem theory tiling Turing machine ultrafilter ultrafilter extensions ultrapower ultraproducts undecidable valid valuation variables