|
|
Sold Out
Book Categories |
| Verified Lexical Analysis | 1 | |
| Extending Window Inference | 17 | |
| Program Abstraction in a Higher-Order Logic Framework | 33 | |
| The Village Telephone System: A Case Study in Formal Software Engineering | 49 | |
| Generating Embeddings from Denotational Descriptions | 67 | |
| An Interface between CLAM and HOL | 87 | |
| Classical Propositional Decidability via Nuprl Proof Extraction | 105 | |
| A Comparison of PVS and Isabelle/HOL | 123 | |
| Adding External Decision Procedures to HOL90 Securely | 143 | |
| Formalizing Basic First Order Model Theory | 153 | |
| Formalizing Dijkstra | 171 | |
| Mechanical Verification of Total Correctness through Diversion Verification Conditions | 189 | |
| A Type Annotation Scheme for Nuprl | 207 | |
| Verifying a Garbage Collection Algorithm | 225 | |
| Hot: A Concurrent Automated Theorem Prover Based on Higher-Order Tableaux | 245 | |
| Free Variables and Subexpressions in Higher-Order Meta Logic | 263 | |
| An LPO-based Termination Ordering for Higher-Order Terms without [lambda]-abstraction | 277 | |
| Proving Isomorphism of First-Order Logic Proof Systems in HOL | 295 | |
| Exploiting Parallelism in Interactive Theorem Provers | 315 | |
| I/O Automata and Beyond: Temporal Logic and Abstraction in Isabelle | 331 | |
| Object-Oriented Verification Based on Record Subtyping in Higher-Order Logic | 349 | |
| On the Effectiveness of Theorem Proving Guided Discovery of Formal Assertions for a Register Allocator in a High-Level Synthesis System | 367 | |
| Co-inductive Axiomatization of a Synchronous Language | 387 | |
| Formal Specification and Theorem Proving Breakthroughs in Geometric Modeling | 401 | |
| A Tool for Data Refinement | 423 | |
| Mechanizing Relevant Logics with HOL | 443 | |
| Case Studies in Meta-Level Theorem Proving | 461 | |
| Formalization of Graph Search Algorithms and Its Applications | 479 | |
| Author Index | 497 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Star Blanche
reviewed Theorem Proving in Higher Order Logics, Vol. 114 on October 02, 2007
Theorem Proving in Higher Order Logics
Interested in all the new theories of physics but have no head for the math? Neither does Tom Siegfried.
The book opens with a concession: Siegfried (a writer by trade, not a physicist) says, "OK, let's just assume that these very, very smart men have lots of math to support their theories. This book will be about their ideas, not their justifications for those ideas", and the book is better for it.
Siegfried writes with an engaging, informal style, and explains some of the newest, most interesting (and sometimes most outlandish-sounding) theories in modern science in a way that never seems obtuse or unapproachable.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Theorem Proving in Higher Order Logics, Vol. 114
X
This Item is in Your Inventory
Theorem Proving in Higher Order Logics, Vol. 114
X
You must be logged in to review the productsX
X
X
Add Theorem Proving in Higher Order Logics, Vol. 114, , Theorem Proving in Higher Order Logics, Vol. 114 to the inventory that you are selling on WonderClubX
X
Add Theorem Proving in Higher Order Logics, Vol. 114, , Theorem Proving in Higher Order Logics, Vol. 114 to your collection on WonderClub |