Pages that link to "Item:Q4311932"
From MaRDI portal
The following pages link to Complexity of the decidability of the unquantified set theory with a rank operator (Q4311932):
Displaying 7 items.
- On the Cantor-Bendixson rank of a set that is searchable in Gödel's \(T\) (Q2799751) (← links)
- Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of Σ(x)={{y}|y εx} (Q3726080) (← links)
- (Q3981005) (← links)
- Undecidability results for restricted universally quantified formulae of set theory (Q4291741) (← links)
- (Q4865517) (← links)
- (Q4880812) (← links)
- Ranking Sets of Objects: The Complexity of Avoiding Impossibility Results (Q5026251) (← links)
