Pages that link to "Item:Q3720563"
From MaRDI portal
The following pages link to Provability and Decidability of Arithmetical Universal-Existential Sentences (Q3720563):
Displaying 5 items.
- Algorithms for sentences over integral domains (Q920964) (← links)
- Computational complexity of sentences over fields (Q937294) (← links)
- Polynomial time algorithms for sentences over number fields (Q1187032) (← links)
- Decidable Sentences Over Polynomial Rings (Q3784041) (← links)
- Decidable fragments of field theories (Q5202171) (← links)
