Pages that link to "Item:Q5202171"
From MaRDI portal
The following pages link to Decidable fragments of field theories (Q5202171):
Displaying 6 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)
- The elementary theory of \(\omega\)-free \(Ax\) fields (Q1231942) (← links)
- Provability and Decidability of Arithmetical Universal-Existential Sentences (Q3720563) (← links)
- THE ∀∃ THEORY OF PEANO Σ<sub>1</sub> SENTENCES (Q5305060) (← links)