Decidability of the Natural Numbers with the Almost-All Quantifier

Simple item page
dc.creatorMarker, David
dc.creatorSlaman, Theodore A.
dc.date2006-02-20
dc.date.accessioned2026-07-07T07:34:33Z
dc.date.available2026-07-07T07:34:33Z
dc.descriptionWe consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of arithmetic is decidable.
dc.identifierhttps://arxiv.org/abs/math/0602415
dc.identifierhttp://arxiv.org/abs/math/0602415
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119801
dc.subjectLogic
dc.subjectMathematical Physics
dc.subject03F30
dc.titleDecidability of the Natural Numbers with the Almost-All Quantifier
dc.typetext

Files

Collections

arXiv