Refutations by Matings

DOI10.1109/TC.1976.1674698MaRDI QIDQ4096457zbMATH OpenFDO

Authors Peter B. Andrews

Publication date 1976

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1976.1674698

Mathematics Subject Classification ID

Cited in

(14)

• Using rewriting rules for connection graphs to prove theorems
• On the termination of clause graph resolution
• Clause trees: A tool for understanding and implementing resolution in automated reasoning
• A comparative study of several proof procedures
• The linked conjunct method for automatic deduction and related search techniques
• TPS: A theorem-proving system for classical type theory
• Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem
• Number representation of satisfiability
• scientific article; zbMATH DE number 7204450 (Why is no real title available?)
• Compressing propositional refutations
• Proof Search for the First-Order Connection Calculus in Maude
• The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem
• Deep inference and expansion trees for second-order multiplicative linear logic
• On connections and higher-order logic

This page was built for publication: Refutations by Matings

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