Theorem Proving in Higher Order Logics

DOI10.1007/11541868zbMATH Open1152.68517OpenAlexW2484880499MaRDI QIDQ5477647FDOQ5477647

Authors: Christoph Benzmüller, Chad E. Brown 

Publication date: 6 July 2006

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

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

Recommendations

• Progress in the Development of Automated Theorem Proving for Higher-Order Logic
• A Focused Sequent Calculus for Higher-Order Logic
• Higher-order semantics and extensionality
• On sets, types, fixed points, and checkerboards
• scientific article; zbMATH DE number 67454

Mathematics Subject Classification ID

Cited In (3)

• Progress in the Development of Automated Theorem Proving for Higher-Order Logic
• THF0 – The Core of the TPTP Language for Higher-Order Logic
• The higher-order prover \textsc{Leo}-II

Uses Software

• TPS
• TPTP
• ETPS
• Leo

This page was built for publication: Theorem Proving in Higher Order Logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5477647)