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

Journal of Symbolic Logic 67 (2):598-620 (2002)
  Copy   BIBTEX

Abstract

We use a new version of the Definability Theorem of Beth in order to unify classical theorems of Yuri Matiyasevich and Jan Denef in one structural statement. We give similar forms for other important definability results from Arithmetic and Number Theory.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,783

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On definability in multimodal logic.Joseph Y. Halpern, Dov Samet & Ella Segev - 2009 - Review of Symbolic Logic 2 (3):451-468.
Definability of Initial Segments.Akito Tsuboi & Saharon Shelah - 2002 - Notre Dame Journal of Formal Logic 43 (2):65-73.
Abstract Beth Definability in Institutions.Marius Petria & Răzvan Diaconescu - 2006 - Journal of Symbolic Logic 71 (3):1002 - 1028.
Arithmetic definability by formulas with two quantifiers.Shih Ping Tung - 1992 - Journal of Symbolic Logic 57 (1):1-11.
Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.
Undefinability vs. Definability of Satisfaction and Truth.Roman Murawski - 1999 - Vienna Circle Institute Yearbook 6:203-215.
Implicit Definability in Arithmetic.Stephen G. Simpson - 2016 - Notre Dame Journal of Formal Logic 57 (3):329-339.
Nonstandard definability.Stuart T. Smith - 1989 - Annals of Pure and Applied Logic 42 (1):21-43.
The isomorphism problem for ω-automatic trees.Dietrich Kuske, Jiamou Liu & Markus Lohrey - 2013 - Annals of Pure and Applied Logic 164 (1):30-48.
Arithmetical definability over finite structures.Troy Lee - 2003 - Mathematical Logic Quarterly 49 (4):385.

Analytics

Added to PP
2009-01-28

Downloads
34 (#468,926)

6 months
5 (#632,816)

Historical graph of downloads
How can I increase my downloads?