An isomorphism between monoids of external embeddings about definability in arithmetic
Journal of Symbolic Logic 67 (2):598-620 (2002)
| 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 | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesDenis Richard (1989). Definability in Terms of the Successor Function and the Coprimeness Predicate in the Set of Arbitrary Integers. Journal of Symbolic Logic 54 (4):1253-1287.
Douglas E. Miller (1979). An Application of Invariant Sets to Global Definability. Journal of Symbolic Logic 44 (1):9-14.
Anand Pillay (1998). Definability and Definable Groups in Simple Theories. Journal of Symbolic Logic 63 (3):788-796.
Julia Robinson (1949). Definability and Decision Problems in Arithmetic. Journal of Symbolic Logic 14 (2):98-114.
Juha Kontinen & Jakub Szymanik (2011). Characterizing Definability of Second-Order Generalized Quantifiers. In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
Jeremy Avigad & Jeffrey Helzner (2002). Transfer Principles in Nonstandard Intuitionistic Arithmetic. Archive for Mathematical Logic 41 (6):581-602.
George Weaver (1994). A Note on Definability in Equational Logic. History and Philosophy of Logic 15 (2):189-199.
Vladimir Kanovei (1996). On External Scott Algebras in Nonstandard Models of Peano Arithmetic. Journal of Symbolic Logic 61 (2):586-607.
M. Aiguier & F. Barbier (2007). An Institution-Independent Proof of the Beth Definability Theorem. Studia Logica 85 (3):333 - 359.
Marius Petria & Răzvan Diaconescu (2006). Abstract Beth Definability in Institutions. Journal of Symbolic Logic 71 (3):1002 - 1028.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads2 ( #232,211 of 548,969 )Recent downloads (6 months)1 ( #63,511 of 548,969 )How can I increase my downloads? |
My notes
Discussion
