The following pages link to (Q4503906):
Displayed 7 items.
- A tableau-based decision procedure for a fragment of set theory with iterated membership (Q812437) (← links)
- Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators (Q1854500) (← links)
- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership (Q2215960) (← links)
- A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT (Q2817912) (← links)
- Satisfiability Modulo Theories (Q3176369) (← links)
- (Q4553283) (← links)
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)