An isomorphism between monoids of external embeddings: About definability in arithmetic

DOI10.2178/JSL/1190150100zbMath1027.03008OpenAlexW2028626203MaRDI QIDQ3149985

Mihai Prunescu

Publication date: 4 December 2002

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.666.3471

zbMATH Keywords

definabilityHilbert's tenth problemexistential definability

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Interpolation, preservation, definability (03C40) Model theory (number-theoretic aspects) (11U09)

Cites Work

• The decision problem for exponential diophantine equations
• Unnamed Item
• Unnamed Item

This page was built for publication: An isomorphism between monoids of external embeddings: About definability in arithmetic