Decidability of the Natural Numbers with the Almost-All Quantifier

Authors David Marker, Theodore A. Slaman

Publication date 20 February 2006

First-order arithmetic and fragments (03F30)

Abstract: We 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.

This page was built for publication: Decidability of the Natural Numbers with the Almost-All Quantifier

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