Pages that link to "Item:Q5791204"
From MaRDI portal
The following pages link to Definability and decision problems in arithmetic (Q5791204):
Displaying 50 items.
- A note on definability in fragments of arithmetic with free unary predicates (Q365661) (← links)
- Definability of Frobenius orbits and a result on rational distance sets (Q504116) (← links)
- Computable dimensions of Pappusian and Desarguesian projective planes (Q694236) (← links)
- Decidability questions for a ring of Laurent polynomials (Q764281) (← links)
- A portrait of Alfred Tarski (Q809989) (← links)
- Further results on Hilbert's tenth problem (Q829448) (← links)
- Defining the integers in large rings of a number field using one universal quantifier (Q843611) (← links)
- More on generic dimension groups (Q894253) (← links)
- Semi-isolation and the strict order property (Q894254) (← links)
- Hilbert's tenth problem for fields of rational functions over finite fields (Q910434) (← links)
- Computational complexity of sentences over fields (Q937294) (← links)
- A view of computability on term algebras (Q1051428) (← links)
- A note on Parikh maps, abstract languages, and decision problems (Q1065555) (← links)
- Julia Robinson, in memoriam (Q1068805) (← links)
- Polynomial time algorithms for sentences over number fields (Q1187032) (← links)
- Complexity of logical theories involving coprimality (Q1202924) (← links)
- Self-injective regular algebras and function rings (Q1205175) (← links)
- Problemi di decidibilita in logica topologica (Q1255489) (← links)
- Extended order-generic queries (Q1302301) (← links)
- Ehrenfeucht games and ordinal addition (Q1377635) (← links)
- Queries with arithmetical constraints (Q1391932) (← links)
- On nonelementarily equivalent pairs of fields (Q1400607) (← links)
- Quantifier rank for parity of embedded finite models. (Q1401237) (← links)
- Hilbert's tenth problem for rings of rational functions (Q1430905) (← links)
- Predicate logics of expressively strong theories (Q1582839) (← links)
- First-order decidability and definability of integers in infinite algebraic extensions of the rational numbers (Q1659540) (← links)
- Definability, decidability, complexity (Q1817073) (← links)
- Decidability of certain theories of integers (Q1844663) (← links)
- On arithmetical first-order theories allowing encoding and decoding of lists (Q1960537) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- Universally defining finitely generated subrings of global fields (Q2062179) (← links)
- Axiomatic (and non-axiomatic) mathematics (Q2080664) (← links)
- Computable procedures for fields (Q2117796) (← links)
- Ordered fields dense in their real closure and definable convex valuations (Q2121257) (← links)
- On mutual definability of operations on fields (Q2186309) (← links)
- Termination of polynomial loops (Q2233526) (← links)
- The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
- All arithmetical sets of powers of primes are first-order definable in terms of the successor function and the coprimeness predicate (Q2266708) (← links)
- When is scalar multiplication decidable? (Q2311210) (← links)
- On decidability and axiomatizability of some ordered structures (Q2318170) (← links)
- On mathematical realism and applicability of hyperreals (Q2323044) (← links)
- Uniformly defining \(p\)-Henselian valuations (Q2344717) (← links)
- Definability and decidability in infinite algebraic extensions (Q2349099) (← links)
- Hilbert's tenth problem over function fields of positive characteristic not containing the algebraic closure of a finite field (Q2359446) (← links)
- Uniform first-order definitions in finitely generated fields (Q2370123) (← links)
- The Hilbert's-tenth-problem operator (Q2414521) (← links)
- An existential divisibility lemma for global fields (Q2494371) (← links)
- Integrality at a prime for global fields and the perfect closure of global fields of characteristic \(p > 2\) (Q2566189) (← links)
- First-order definitions of rational functions and \({\mathcal S}\)-integers over holomorphy rings of algebraic functions of characteristic 0 (Q2570137) (← links)
- Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries (Q2631966) (← links)