Pages that link to "Item:Q5791204"
From MaRDI portal
The following pages link to Definability and decision problems in arithmetic (Q5791204):
Displaying 20 items.
- Matrix-F5 algorithms over finite-precision complete discrete valuation fields (Q5891054) (← links)
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains (Q5899515) (← links)
- Logspace computations in graph products (Q5899516) (← links)
- Tame decompositions and collisions (Q5899518) (← links)
- Decidability of the theory of the natural integers with the Cantor pairing function and the successor (Q5941253) (← links)
- A list of arithmetical structures complete with respect to the first-order definability (Q5941257) (← links)
- The prime number theorem is PRA-provable (Q5941260) (← links)
- Computational complexity of quantifier-free negationless theory of field of rational numbers (Q5957912) (← links)
- The Woods-Erdős conjecture for polynomial rings (Q5957920) (← links)
- Strongly NIP almost real closed fields (Q6047712) (← links)
- DEFINABILITY OF HENSELIAN VALUATIONS BY CONDITIONS ON THE VALUE GROUP (Q6095974) (← links)
- INTERLEAVING LOGIC AND COUNTING (Q6199174) (← links)
- A TOPOLOGICAL APPROACH TO UNDEFINABILITY IN ALGEBRAIC EXTENSIONS OF (Q6199176) (← links)
- Universally defining Z$\mathbb {Z}$ in Q$\mathbb {Q}$ with 10 quantifiers (Q6200274) (← links)
- Cylindrical algebraic decomposition using local projections (Q6487176) (← links)
- Realizability modulo theories (Q6561346) (← links)
- Defining \(\mathbb{Z}\) using unit groups (Q6595585) (← links)
- Theoretical computer science: computability, decidability and logic (Q6602262) (← links)
- A survey of local-global methods for Hilbert's tenth problem (Q6611633) (← links)
- Positive existential Definability with unit, addition and coprimeness (Q6666557) (← links)
