On sets of relations definable by addition
- 1 September 1982
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 47 (3), 659-668
- https://doi.org/10.2307/2273595
Abstract
For every κ ∈ ω, there is an infinite set Aκ ⊆ ω and a d(κ) ∈ ω such that for all Q0, Q1, ⊆ Aκ where ∣Q0∣ = ∣ Q1∣, or d(κ) < ∣Q0∣, Q1∣ < ℵ0, the structures ‹ω, +, Q0› and ‹ω, +, Q1› are indistinguishable by first-order sentences of quantifier depth κ whose atomic formulas are of the form u = v, u + v = w, and Q(u), where u, v, and w are variables.Keywords
This publication has 11 references indexed in Scilit:
- Mathematical LogicPublished by Springer Science and Business Media LLC ,1976
- Monadic generalized spectraMathematical Logic Quarterly, 1975
- On boolean functions and connected setsTheory of Computing Systems, 1971
- Local definability theoryAnnals of Mathematical Logic, 1970
- Decidability of Second-Order Theories and Automata on Infinite TreesTransactions of the American Mathematical Society, 1969
- Concerning measures in first order calculiIsrael Journal of Mathematics, 1964
- Decision problems of finite automata design and related arithmeticsTransactions of the American Mathematical Society, 1961
- An application of games to the completeness problem for formalized theoriesFundamenta Mathematicae, 1960
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960
- Models of axiomatic theories admitting automorphismsFundamenta Mathematicae, 1956