Automated Reasoning in Higher-Order Logic: Set Comprehension and Extensionality in Church's Type Theory (Studies in Logic, . Logic and Cognitive Systems)
| Author | : | |
| Rating | : | 4.81 (711 Votes) |
| Asin | : | 1904987575 |
| Format Type | : | paperback |
| Number of Pages | : | 564 Pages |
| Publish Date | : | 2015-07-16 |
| Language | : | English |
DESCRIPTION:
In the second part of the book, an automated proof procedure for extensional type theory is described. Three families of sequent calculi are defined and proven sound and complete with respect to appropriate model classes. Using the model constructions in the book, different versions of Cantor's theorem are determined to not be provable in certain fragments. Consequently, higher-order logic has become an important topic of research. The fragments differ in the amount of extensionality and set comprehension principles included. Users of higher-order theorem provers can use the book to improve their understanding of the underlying logical systems.. In fact, some versions of Cantor's theorem are independent of other versions (in sufficiently weak fragments). /Automated Reasoning in Higher-Order Logic/ is an essential document for
Burse Jan said Broad Elementary Type Theory Introduction. The topic of this book is elementary type theory. This is a subset of Church's type theory. The strength of the book is the careful exposition of the topic, including some variants inside elementary type theory.By its historical inheritance the book also devotes a lot of time to expansion proofs. Al. looks nice I have just skimmed through the book. The author is a student of Peter Andrews at CMU, who was also a student of Church. Chad E Brown's research seems to be a further development in Andrews' direction. He is also the developer of the HOL theorem prover TPS, in Lisp.A lot of space is devoted to exten