Classical logic has proved inadequate in various areas of computer science, artificial intelligence, mathematics, philosopy and linguistics This is an introduction to extensions of first order logic, based on the principle that many sorted logic MSL provides a unifying framework in which to place, for example, second order logic, type theory, modal and dynamic logics and MSL itself The aim is two fold only one theorem prover is needed proofs of the metaproperties of the different existing calculi can be avoided by borrowing them from MSL To make the book accessible to readers from different disciplines, whilst maintaining precision, the author has supplied detailed step by step proofs, avoiding difficult arguments, and continually motivating the material with examples Consequently this can be used as a reference, for self teaching or for first year graduate courses....
|Title||:||Extensions of First-Order Logic (Cambridge Tracts in Theoretical Computer Science)|
|Publisher||:||Cambridge University Press August 22, 2005|
|Number of Pages||:||412 pages|
|File Size||:||893 KB|
|Status||:||Available For Download|
|Last checked||:||21 Minutes ago!|