scientific article; zbMATH DE number 5066355

zbMATH Open1107.03042MaRDI QIDQ5393633

Lou van den Dries

Publication date: 23 October 2006

Title of this publication is not available (Why is that?)

zbMATH Keywords

greatest common divisorarithmetic functionsinteger divisionexplicit definabilitycomputability with bounded complexitynonstandard rings of integers

Mathematics Subject Classification ID

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

Related Items (4)

Title not available (Why is that?) ⋮ Arithmetic definability by formulas with two quantifiers ⋮ Structure and definability in general bounded arithmetic theories ⋮ On two questions about feasibly constructive arithmetic

This page was built for publication:

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