Automatic theorem proving in set theory

DOI10.1016/0004-3702(78)90028-0zbMATH Open0374.68059OpenAlexW2024311864MaRDI QIDQ1245007FDOQ1245007

Authors: 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

Set theory (03Exx) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)

Cites Work

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

Cited In (7)

• 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
• SLIM: An automated reasoner for equivalences, applied to set theory
• MUSCADET: An automatic theorem proving system using knowledge and metaknowledge in mathematics
• Automated theorem proving in mathematics.
• Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini

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

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