Comparing approaches to resolution based higher-order theorem proving

DOI10.1023/A:1020840027781zbMATH Open1020.03011OpenAlexW2021219068MaRDI QIDQ1868166FDOQ1868166

Authors: Christoph Benzmüller 

Publication date: 27 April 2003

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020840027781

Recommendations

• scientific article; zbMATH DE number 1303338
• Higher order E-unification
• scientific article; zbMATH DE number 1341621
• scientific article; zbMATH DE number 1552534
• The Clausal Theory of Types

zbMATH Keywords

higher-order logicfull extensionalityHenkin completenesshigher-order resolutionresolution-based higher-order theorem proving

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Cited In (6)

• Resolution-Like Theorem Proving for High-Level Conditions
• The higher-order prover \textsc{Leo}-II
• Set-of-support strategy for higher-order logic
• Combined reasoning by automated cooperation
• A Clausal Approach to Proof Analysis in Second-Order Logic
• CERES in higher-order logic

Uses Software

• TPS
• Leo

This page was built for publication: Comparing approaches to resolution based higher-order theorem proving

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