Abstract
We consider the logical theory of the monoid of subsets of ℕ endowed solely with addition lifted to sets: no other set theoretical predicate or function, no constant (contrarily to previous work by J̇ez and Okhotin cited below). We prove that the class of true Σ5 formulas is undecidable and that the whole theory is recursively isomorphic to second-order arithmetic. Also, each ultimately periodic set A (viewed as a predicate X = A) is Π4 definable and their collection is Σ6. Though these undecidability results are not surprising, they involve technical difficulties witnessed by the following facts: 1) no elementary predicate or operation on sets (inclusion, union, intersection, complementation, adjunction of 0) is definable, 2) The class of subsemigroups is not definable though that of submonoids is easily definable. To get our results, we code integers by a Π3 definable class of submonoids and arithmetic operations on ℕ by Δ5 operations on this class.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Choffrut, C., Grigorieff, S.: Logical theory of the monoid of languages over a non tally alphabet (in preparation)
Cohn, L.: On the submonoids of the additive group of integers, http://www.macs.citadel.edu/cohnl/submonoids2002.pdf
Fischer, M.J., Rabin, M.O.: Super-exponential complexity of presburger arithmetic. In: SIAM-AMS Symposium in Applied Mathematics, vol. 7, pp. 27–41 (1974)
García-Sánchez, P.A.: Numerical semigroups minicourse, http://www.ugr.es/~pedro/minicurso-porto.pdf
Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pacific J. Math. 16, 285–296 (1966)
J̇ez, A., Okhotin, A.: Equations over sets of natural numbers with addition only. In: STACS, pp. 577–588 (2009)
Odifreddi, P.: Classical recursion theory. The theory of functions and sets of natural integers, vol. 1. North Holland (1989)
Ramaré, O.: On Shnirelman’s constant 22(4), 645–706 (1995)
Ramírez-Alfonsín, J.L.: The Diophantine Frobenius Problem. Oxford University Press (2005)
Rogers, H.: Theory of recursive functions and effective computability. McGraw Hill (1967)
Rosales, J.C., García-Sánchez, P.A.: Numerical semigroups. Developments in Mathematics, vol. 20. Springer (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Choffrut, C., Grigorieff, S. (2015). Logical Theory of the Additive Monoid of Subsets of Natural Integers. In: Adamatzky, A. (eds) Automata, Universality, Computation. Emergence, Complexity and Computation, vol 12. Springer, Cham. https://doi.org/10.1007/978-3-319-09039-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-09039-9_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09038-2
Online ISBN: 978-3-319-09039-9
eBook Packages: EngineeringEngineering (R0)