Let σ be a signature and a σ-structure with domain . Say that a monadic second-order σ-formula is iff it has the form
with set variables and ψ containing no set quantifiers. Consider the following properties:
for each positive integer n, the set of -σ-sentences true in is -complete;
for each positive integer n, if a set of natural numbers is -definable (i.e. by a -formula) in the standard model of arithmetic and closed under automorphisms of , then it is -definable in .
We use ∣ and ⊥ to denote the divisibility relation and the coprimeness relation respectively. Given a prime p, let be the function which maps every pair of natural numbers into . In this article we prove: and all have both and ; in effect, even has . Notice – these results readily generalise to arbitrary arithmetical expansions of the corresponding structures, provided that the extended signature is finite.
A.Bès, On Pascal triangles modulo a prime power, Annals of Pure and Applied Logic89 (1997), 17–35.
2.
A.Bès, A survey of arithmetical definability, in: A Tribute to Maurice Boffa, M.Crabbéet al., eds, Société Mathématique de Belgique, 2002, pp. 1–54.
3.
A.Bès and I.Korec, Definability within structures related to Pascal’s triangle modulo an integer, Fundamenta Mathematicae156 (1998), 111–129.
4.
A.Bès and D.Richard, Undecidable extensions of Skolem arithmetic, Journal of Symbolic Logic63 (1998), 379–401.
5.
J.R.Büchi, On a decision method in restricted second order arithmetic, in: Logic, Methodology and Philosophy of Science, E.Nagel, P.Suppes and A.Tarski, eds, Stanford University Press, 1962, pp. 1–11.
6.
P.Cegielski, Definability, decidability, complexity, Annals of Mathematics and Artificial Intelligence16 (1996), 311–341.
7.
J.Y.Halpern, Presburger arithmetic with unary predicates is complete, Journal of Symbolic Logic56 (1991), 637–642.
8.
I.Korec, Definability of arithmetic operations in Pascal triangle modulo an integer divisible by two primes, Grazer Mathematische Berichte318 (1993), 53–62.
9.
I.Korec, Elementary theories of structures containing generalized Pascal triangles modulo a prime, in: Discrete Mathematics and Applications, Blagoevgrad/Predel, 1994, S.Shtrakov and I.Mirchev, eds, Blagoevgrad, 1995, pp. 91–102.
10.
I.Korec, A list of arithmetical structures complete with respect to the first-order definability, Theoretical Computer Science257 (2001), 115–151.
11.
F.Maurin, The theory of integer multiplication with order restricted to primes is decidable, Journal of Symbolic Logic62 (1997), 123–130.
12.
M.O.Rabin, Decidability of second-order theories and automata on infinite trees, Transactions of the American Mathematical Society141 (1969), 1–35.
13.
J.Robinson, Definability and decision problems in arithmetic, Journal of Symbolic Logic14 (1949), 98–114.
14.
S.O.Speranski, A note on definability in fragments of arithmetic with free unary predicates, Archive for Mathematical Logic52 (2013), 507–516.
15.
S.O.Speranski, Quantifying over events in probability logic: an introduction, Mathematical Structures in Computer Science (2015), accepted for publication.