The Woods-Erdős conjecture for polynomial rings

DOI10.1016/S0168-0072(01)00065-3zbMath0999.12015OpenAlexW2093736403WikidataQ123296768 ScholiaQ123296768MaRDI QIDQ5957920

Maxim Vsemirnov

Publication date: 1 December 2002

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(01)00065-3

zbMATH Keywords

undecidabilityfinite fieldspolynomial ringsdefinabilityWoods-Erdős conjecture

Mathematics Subject Classification ID

Decidability and field theory (12L05) Polynomials in general fields (irreducibility, etc.) (12E05) Decidability of theories and sets of sentences (03B25)

Related Items (1)

INTERPRETING ARITHMETIC IN THE FIRST-ORDER THEORY OF ADDITION AND COPRIMALITY OF POLYNOMIAL RINGS

Cites Work

• On the maximal length of two sequences of consecutive integers with the same prime divisors
• On the maximal length of two sequences of integers in arithmetic progressions with the same prime divisors
• All arithmetical sets of powers of primes are first-order definable in terms of the successor function and the coprimeness predicate
• Definability and decision problems in arithmetic
• What are weak arithmetic?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Woods-Erdős conjecture for polynomial rings