Automatic theorem proving in set theory

DOI10.1016/0004-3702(78)90028-0zbMath0374.68059OpenAlexW2024311864MaRDI QIDQ1245007

Dominique Pastre

Publication date: 1978

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(78)90028-0

Mathematics Subject Classification ID

Related Items (6)

Automated theorem proving in mathematics. ⋮ MUSCADET: An automatic theorem proving system using knowledge and metaknowledge in mathematics ⋮ Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini ⋮ Specification methods and partial construction of theory by computer ⋮ Towards the automation of set theory and its logic ⋮ Set theory for verification. I: From foundations to functions

Cites Work

• Plane geometry theorem proving using forward chaining
• A relaxation approach to splitting in an automatic theorem prover
• Doing arithmetic without diagrams
• Towards the automation of set theory and its logic
• Experiment with an automatic theorem-prover having partial ordering inference rules
• Automated theorem-proving for the theories of partial and total ordering
• Unit Refutations and Horn Sets
• Theorem Proving with Lemmas
• Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automatic theorem proving in set theory