Pages that link to "Item:Q2215960"
From MaRDI portal
The following pages link to Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership (Q2215960):
Displaying 3 items.
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) (← links)
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)
- On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework (Q6649524) (← links)