A tableau-based decision procedure for a fragment of set theory with iterated membership
DOI10.1007/S10817-004-8271-4zbMATH Open1085.03010OpenAlexW2023230345MaRDI QIDQ812437FDOQ812437
Authors: Calogero G. Zarba, Rosa Ruggeri Cannata, Domenico Cantone 
Publication date: 23 January 2006
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-004-8271-4
Recommendations
Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Axiomatics of classical set theory and its fragments (03E30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Verification: Theory and Practice
- Techniques of computable set theory with applications to proof verification
- The automation of syllogistic. II: Optimization and complexity issues
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: A tableau-based decision procedure for a fragment of set theory with iterated membership
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812437)
