Strong splitting rules in automated theorem proving

DOI10.1007/3-540-51517-8_147MaRDI QIDQ5393372zbMATH OpenOpenAlexFDO

Authors Matthias Baaz, Alexander Leitsch

Publication date 16 April 2011

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

Full work available at URL https://doi.org/10.1007/3-540-51517-8_147

Mathematics Subject Classification ID

Cited in

(1)

• Complexity of resolution proofs and function introduction

This page was built for publication: Strong splitting rules in automated theorem proving

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