Definability in the monadic second-order theory of successor
- 25 July 1969
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 34 (2), 166-170
- https://doi.org/10.2307/2271090
Abstract
Let be a relational system whereby D is a nonempty set and P1 is an m1-ary relation on D. With we associate the (weak) monadic second-order theory consisting of the first-order predicate calculus with individual variables ranging over D; monadic predicate variables ranging over (finite) subsets of D; monadic predicate quantifiers; and constants corresponding to P1, P2, …. We will often use ambiguously to mean also the set of true sentences of .Keywords
This publication has 5 references indexed in Scilit:
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successorThe Journal of Symbolic Logic, 1966
- Restricted set-theoretical definitions in arithmeticProceedings of the American Mathematical Society, 1958
- Hierarchies of number-theoretic predicatesBulletin of the American Mathematical Society, 1955
- Introduction to Metamathematics. By S. C. Kleene. Pp. x, 550, Fl. 32.50. 1952. (Noordhoff, Groningen; North-Holland Publishing Co., Amsterdam)The Mathematical Gazette, 1954