Publisher
Springer Science and Business Media LLC
Reference16 articles.
1. Abadi M., Halpern J.Y.: Decidability and expressiveness for first-order logics of probability. Inf. Comput. 112(1), 1–36 (1994)
2. Bès, A.: A survey of arithmetical definability, A tribute to Maurice Boffa, Soc. Math. Belgique, 1–54 (2002)
3. Bès A., Richard D.: Undecidable extensions of Skolem Arithmetic. J. Symb. Log. 63(2), 379–401 (1998)
4. Downey, P.: Undecidability of Presburger Arithmetic with a Single Monadic Predicate Letter, Technical Report 18-72. Center for Research in Computing Technology, Harvard University, Cambridge (1972)
5. Ershov Yu.L., Lavrov I.A., Taimanov A.D., Taitslin M.A.: Elementary theories. Russ. Math. Surv. 20(4), 35–105 (1965)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献