On explicit definability in arithmetic

MaRDI QIDQ5393633zbMATH OpenFDO

Authors Lou van den Dries

Publication date 23 October 2006

zbMATH Keywords

arithmetic functionscomputability with bounded complexityexplicit definabilitygreatest common divisorinteger divisionnonstandard rings of integers

Mathematics Subject Classification ID

Applications of model theory (03C98) Complexity of computation (including implicit computational complexity) (03D15) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Model theory (number-theoretic aspects) (11U09)

Recommendations

• scientific article; zbMATH DE number 3941535
• Functions definable by arithmetic circuits
• scientific article; zbMATH DE number 4110684
• Definability in terms of the successor function and the coprimeness predicate in the set of arbitrary integers
• Arithmetic definability by formulas with two quantifiers

Cited in

(7)

• Structure and definability in general bounded arithmetic theories
• scientific article; zbMATH DE number 1670489 (Why is no real title available?)
• Implicit definability in arithmetic
• Functions definable by arithmetic circuits
• Arithmetic definability by formulas with two quantifiers
• On two questions about feasibly constructive arithmetic
• scientific article; zbMATH DE number 1985597 (Why is no real title available?)

This page was built for publication: On explicit definability in arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5393633)