Pages that link to "Item:Q2252530"

The following pages link to Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate (Q2252530):

Displaying 2 items.

• Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership (Q2215960) (← links)
• Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)