A fast saturation strategy for set-theoretic tableaux
From MaRDI portal
Publication:4610319
DOI10.1007/BFb0027409zbMath1412.68213OpenAlexW1568077868MaRDI QIDQ4610319
Publication date: 15 January 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0027409
Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)
Cites Work
- A tableau-based decision procedure for a fragment of set theory with iterated membership
- A method for simultaneous search for refutations and models by equational constraint solving
- Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
- Techniques of computable set theory with applications to proof verification
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item