Pages that link to "Item:Q2957964"
From MaRDI portal
The following pages link to A note on hereditarily Π10- and Σ10-complete sets of sentences (Q2957964):
Displaying 5 items.
- Elementary theories and hereditary undecidability for semilattices of numberings (Q1734277) (← links)
- The number of finitely axiomatizable completions (Q1814398) (← links)
- Computational complexity of theories of a binary predicate with a small number of variables (Q2696689) (← links)
- On \(1\over{} n\)-hereditary sets (Q3980682) (← links)
- On the complexity of reasoning in Kleene algebra with commutativity conditions (Q6605343) (← links)