A new use of an automated reasoning assistant: Open questions in equivalential calculus an the study of infinite domains
From MaRDI portal
(Redirected from Publication:759491)
Recommendations
- Shortest single axioms for the equivalential calculus with CD and RCD
- Searching for circles of pure proofs
- scientific article; zbMATH DE number 3904002
- scientific article; zbMATH DE number 3952747
- A finitely axiomatized formalization of predicate calculus with equality
- scientific article; zbMATH DE number 4049134
- The laws of Occam programming
- Remarks on Dudek's E-groupoids
- Automated reasoning contributes to mathematics and logic
- RETRPROV. A system that looks for axioms
Cites work
- scientific article; zbMATH DE number 3114382 (Why is no real title available?)
- scientific article; zbMATH DE number 4104410 (Why is no real title available?)
- scientific article; zbMATH DE number 3755913 (Why is no real title available?)
- scientific article; zbMATH DE number 3539186 (Why is no real title available?)
- scientific article; zbMATH DE number 3545629 (Why is no real title available?)
- scientific article; zbMATH DE number 3219316 (Why is no real title available?)
- scientific article; zbMATH DE number 3269848 (Why is no real title available?)
- scientific article; zbMATH DE number 3335866 (Why is no real title available?)
- scientific article; zbMATH DE number 3349331 (Why is no real title available?)
- scientific article; zbMATH DE number 3349334 (Why is no real title available?)
- scientific article; zbMATH DE number 3382303 (Why is no real title available?)
- scientific article; zbMATH DE number 3068529 (Why is no real title available?)
- scientific article; zbMATH DE number 3084360 (Why is no real title available?)
- 6th Conference on Automated Deduction, New York, USA, June 7-9, 1982
- A Machine-Oriented Logic Based on the Resolution Principle
- A shortest single axiom for the classical equivalential calculus
- An automatic theorem prover for substitution and detachment systems
- Axiomatizations of Logics with Values in Groups
- Complexity and related enhancements for automated theorem-proving programs
- Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions
- Notes on the axiomatics of the propositional calculus
- Problems and Experiments for and with Automated Theorem-Proving Programs
- Questions concerning possible shortest single axioms for the equivalential calculus: An application of automated theorem proving to infinite domains
- Semigroups, Antiautomorphisms, and Involutions: A Computer Solution to an Open Problem, I
- Shortest single axioms for the classical equivalential calculus
- The Concept of Demodulation in Theorem Proving
Cited in
(11)- Towards finding longer proofs
- scientific article; zbMATH DE number 3904002 (Why is no real title available?)
- The problem of selecting an approach based on prior success
- Meeting the challenge of fifty years of logic
- Automated reasoning contributes to mathematics and logic
- Vanquishing the XCB question: The methodological discovery of the last shortest single axiom for the equivalential calculus
- Problems on the generation of finite models
- The application of automated reasoning to questions in mathematics and logic
- Searching for circles of pure proofs
- A case study in automated theorem proving: Finding sages in combinatory logic
- The problem of choosing the type of subsumption to use
This page was built for publication: A new use of an automated reasoning assistant: Open questions in equivalential calculus an the study of infinite domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759491)
