Theorem proving in higher order logics. 18th international conference, TPHOLs 2005, Oxford, UK, August 22--25, 2005. Proceedings.

DOI10.1007/11541868zbMath1087.68005OpenAlexW2484880499MaRDI QIDQ2369295

No author found.

Publication date: 9 May 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11541868

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Related Items

A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle, Flyspeck II: The basic linear programs, Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations

Uses Software

• Coq