The following pages link to (Q4268492):
Displaying 4 items.
- Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators (Q1854500) (← links)
- Undecidability results for restricted universally quantified formulae of set theory (Q4291741) (← links)
- Techniques of computable set theory with applications to proof verification (Q4884662) (← links)
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)
