Berghofer, Stefan.
Theorem Proving in Higher Order Logics 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings / [electronic resource] : edited by Stefan Berghofer, Tobias Nipkow, Christian Urban, Makarius Wenzel. - Berlin, Heidelberg : Springer Berlin Heidelberg, 2009. - digital. - Lecture Notes in Computer Science, 5674 0302-9743 ; . - Lecture Notes in Computer Science, 5674 .
9783642033599
10.1007/978-3-642-03359-9 doi
Computer science.
Computer software.
Logic design.
Computational complexity.
Computer Science.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Mathematics of Computing.
Discrete Mathematics in Computer Science.
Algorithm Analysis and Problem Complexity.
Models and Principles.
QA8.9-QA10.3
005.131
Theorem Proving in Higher Order Logics 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings / [electronic resource] : edited by Stefan Berghofer, Tobias Nipkow, Christian Urban, Makarius Wenzel. - Berlin, Heidelberg : Springer Berlin Heidelberg, 2009. - digital. - Lecture Notes in Computer Science, 5674 0302-9743 ; . - Lecture Notes in Computer Science, 5674 .
9783642033599
10.1007/978-3-642-03359-9 doi
Computer science.
Computer software.
Logic design.
Computational complexity.
Computer Science.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Mathematics of Computing.
Discrete Mathematics in Computer Science.
Algorithm Analysis and Problem Complexity.
Models and Principles.
QA8.9-QA10.3
005.131