The following pages link to (Q4865517):
Displaying 9 items.
- Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator (Q795031) (← links)
- Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator (Q1096608) (← links)
- Union-freeness, deterministic union-freeness and union-complexity (Q2179325) (← links)
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) (← links)
- On the complexity of identifying head-elementary-set-free programs (Q3400962) (← links)
- (Q3981005) (← links)
- Undecidability results for restricted universally quantified formulae of set theory (Q4291741) (← links)
- Complexity of the decidability of the unquantified set theory with a rank operator (Q4311932) (← links)
- (Q4880812) (← links)
