Refutations by Matings
From MaRDI portal
Publication:4096457
DOI10.1109/TC.1976.1674698zbMath0331.68050MaRDI QIDQ4096457
Publication date: 1976
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items
On connections and higher-order logic, 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