Theorem Proving in Higher Order Logics
12th International Conference, TPHOLs'99, Nice, France, September 14-17, 1999, Proceedings (Lecture Notes in Computer Science)
1 edition
Our rough guess is there are 89,750 words in this book.
At a pace averaging 250 words per minute, this book will take 5 hours and 59 minutes to read. With a half hour per day, this will take 12 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Contributions
- Yves Bertot (Editor) - Contributor
- Gilles Dowek (Editor) - Contributor
- Andre Hirschowitz (Editor) - Contributor
- Christine Paulin (Editor) - Contributor
- Laurent Thery (Editor) - Contributor
Publication
1999-09-29 - Springer
Language
English
Word Count
89,750 words, Guess
Page Count
359 pages
Physical Format
Paperback
Identifiers
- Open LibraryOL9901511M
- ISBN-139783540664635
- ISBN-103540664637
- OCLC Control Number42389534
- OCLC Control Numbertheoremprovingin0000tpho_z3w5
and 2 more
- Library of Congress Control Number99044586
- Goodreads2607677
Classifications
- LCCQA76.9.A96 T655 1999
Subjects
Topics
Other Editions
- Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs'99, Nice, France, September 14-17, 1999, Proceedings (Lecture Notes in Computer Science)
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!