Undecidability in number theory
From MaRDI portal
Recommendations
Cited in
(38)- First-order decidability and definability of integers in infinite algebraic extensions of the rational numbers
- Definability and decidability problems in number theory. Abstracts from the workshop held October 23--29, 2016
- The index of an algebraic variety
- Axiomatic (and non-axiomatic) mathematics
- Uniform positive existential interpretation of the integers in rings of entire functions of positive characteristic
- Generic undecidability of existential theory of integer numbers ring
- Unsolvability of some optimization problems
- Decidability of NP-complete problems
- The number of solutions of a Diophantine equation over a recursive ring
- Equations in nilpotent groups.
- Musielak-Orlicz-Sobolev spaces on metric measure spaces.
- Some proofs of undecidability of arithmetic
- The Heterogeneity of Mathematical Research
- Extensions of Hilbert's tenth problem: definability and decidability in number theory
- Large Numbers and Unprovable Theorems
- scientific article; zbMATH DE number 3880670 (Why is no real title available?)
- Undecidable problems: a sampler
- On an exponential predicate in polynomials over finite fields
- Decidability of sub-theories of polynomials over a finite field
- Diophantine sets of polynomials over number fields
- scientific article; zbMATH DE number 4106939 (Why is no real title available?)
- Questions of decidability and undecidability in Number Theory
- scientific article; zbMATH DE number 1101523 (Why is no real title available?)
- Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories
- More on the Hankel Pencil Conjecture—News on the Root Conjecture
- The number of certain integral polynomials and nonrecursive sets of integers, Part 2
- Undecidability of the Spectral Gap
- Undecidability of ℚ⁽²⁾
- Model theory in algebra, analysis and arithmetic: a preface
- Undecidability in number theory
- Computation paradigms in light of Hilbert's tenth problem
- Uniform definability of integers in reduced indecomposable polynomial rings
- Eager Equality for Rational Number Arithmetic
- Symmetric transrationals: the data type and the algorithmic degree of its equational theory
- Hilbert's tenth problem for weak theories of arithmetic
- On the undecidability of Markov properties for Lie superalgebras
- For rational numbers with Suppes-Ono division, equational validity is one-one equivalent with Diophantine unsolvability
- Undecidability of indecomposable polynomial rings
This page was built for publication: Undecidability in number theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588162)
