Recursively enumerable sets of polynomials over a finite field

DOI10.1016/j.jalgebra.2006.09.030zbMath1160.11051OpenAlexW2010442485MaRDI QIDQ875928

Jeroen Demeyer

Publication date: 16 April 2007

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://biblio.ugent.be/publication/373953

zbMATH Keywords

finite fieldsrecursively enumerable setsDiophantine setsHilbert's Tenth problem

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Polynomials over finite fields (11T06) Recursively (computably) enumerable sets and degrees (03D25) Model theory (number-theoretic aspects) (11U09)

Related Items (3)

Universality at an endpoint for orthogonal polynomials with Geronimus-type weights ⋮ Recursively enumerable sets of polynomials over a finite field are Diophantine ⋮ Diophantine sets of polynomials over number fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diophantine sets over polynomial rings
• Effective procedures in field theory
• Diophantine Sets Over Z[ T ]
• Undecidable existential theories of polynomial rings and function fields
• Hilbert's Tenth Problem is Unsolvable
• Computable Algebra, General Theory and Theory of Computable Fields

This page was built for publication: Recursively enumerable sets of polynomials over a finite field