{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:24Z","timestamp":1771024224353,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2013,4,6]],"date-time":"2013-04-06T00:00:00Z","timestamp":1365206400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s00153-013-0328-9","type":"journal-article","created":{"date-parts":[[2013,4,5]],"date-time":"2013-04-05T07:16:07Z","timestamp":1365146167000},"page":"507-516","source":"Crossref","is-referenced-by-count":13,"title":["A note on definability in fragments of arithmetic with free unary predicates"],"prefix":"10.1007","volume":"52","author":[{"given":"Stanislav O.","family":"Speranski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,6]]},"reference":[{"issue":"1","key":"328_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1994.1049","volume":"112","author":"M. Abadi","year":"1994","unstructured":"Abadi M., Halpern J.Y.: Decidability and expressiveness for first-order logics of probability. Inf. Comput. 112(1), 1\u201336 (1994)","journal-title":"Inf. Comput."},{"key":"328_CR2","unstructured":"B\u00e8s, A.: A survey of arithmetical definability, A tribute to Maurice Boffa, Soc. Math. Belgique, 1\u201354 (2002)"},{"issue":"2","key":"328_CR3","doi-asserted-by":"crossref","first-page":"379","DOI":"10.2307\/2586837","volume":"63","author":"A. B\u00e8s","year":"1998","unstructured":"B\u00e8s A., Richard D.: Undecidable extensions of Skolem Arithmetic. J. Symb. Log. 63(2), 379\u2013401 (1998)","journal-title":"J. Symb. Log."},{"key":"328_CR4","unstructured":"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)"},{"issue":"4","key":"328_CR5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1070\/RM1965v020n04ABEH001188","volume":"20","author":"Yu.L. Ershov","year":"1965","unstructured":"Ershov Yu.L., Lavrov I.A., Taimanov A.D., Taitslin M.A.: Elementary theories. Russ. Math. Surv. 20(4), 35\u2013105 (1965)","journal-title":"Russ. Math. Surv."},{"key":"328_CR6","doi-asserted-by":"crossref","unstructured":"Gaifman, H.: On local and nonlocal properties. In: Proceedings of the Herbrand Symposium \u201981, Studies in Logic and the Foundations of Mathematics 107, pp. 105\u2013135. North-Holland, Amsterdam (1982)","DOI":"10.1016\/S0049-237X(08)71879-2"},{"issue":"1","key":"328_CR7","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1090\/S0002-9939-1974-0325378-3","volume":"42","author":"S. Garfunkel","year":"1974","unstructured":"Garfunkel S., Schmerl J.H.: The undecidability of theories of groupoids with an extra predicate. Proc. AMS 42(1), 286\u2013289 (1974)","journal-title":"Proc. AMS"},{"key":"328_CR8","first-page":"479","volume-title":"Model-Theoretic Logics","author":"Yu. Gurevich","year":"1985","unstructured":"Gurevich Yu.: Monadic second-order theories. In: Barwise, J., Feferman, S. (eds.) Model-Theoretic Logics, pp. 479\u2013506. Springer, Berlin (1985)"},{"issue":"2","key":"328_CR9","doi-asserted-by":"crossref","first-page":"637","DOI":"10.2307\/2274706","volume":"56","author":"J.Y. Halpern","year":"1991","unstructured":"Halpern J.Y.: Presburger arithmetic with unary predicates is $${\\Pi_1^1}$$ complete. J. Symb. Log. 56(2), 637\u2013642 (1991)","journal-title":"J. Symb. Log."},{"issue":"2","key":"328_CR10","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0022-0000(83)90014-4","volume":"26","author":"D. Harel","year":"1983","unstructured":"Harel D., Pnueli A., Stavi J.: Propositional dynamic logic of nonregular programs. J. Comput. Syst. Sci. 26(2), 222\u2013243 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"328_CR11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0304-3975(00)00113-4","volume":"257","author":"I. Korec","year":"2001","unstructured":"Korec I.: A list of arithmetical structures complete with respect to the first-order definability. Theor. Comput. Sci. 257, 115\u2013151 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"328_CR12","doi-asserted-by":"crossref","first-page":"39","DOI":"10.2307\/2964057","volume":"22","author":"H. Putnam","year":"1957","unstructured":"Putnam H.: Decidability and essential undecidability. J. Symb. Log. 22, 39\u201354 (1957)","journal-title":"J. Symb. Log."},{"key":"328_CR13","doi-asserted-by":"crossref","first-page":"98","DOI":"10.2307\/2266510","volume":"14","author":"J. Robinson","year":"1949","unstructured":"Robinson J.: Definability and decision problems in arithmetic. J. Symb. Log. 14, 98\u2013114 (1949)","journal-title":"J. Symb. Log."},{"key":"328_CR14","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)"},{"key":"328_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511581007","volume-title":"Subsystems of Second Order Arithmetic","author":"S.G. Simpson","year":"2009","unstructured":"Simpson S.G.: Subsystems of Second Order Arithmetic. Cambridge University Press, Cambridge (2009)"},{"key":"328_CR16","doi-asserted-by":"crossref","unstructured":"Speranski, S.O.: Complexity for probability logic with quantifiers over propositions. J. Log. Comput. (2012). doi: 10.1093\/logcom\/exs041","DOI":"10.1093\/logcom\/exs041"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-013-0328-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-013-0328-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-013-0328-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T18:00:21Z","timestamp":1562868021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-013-0328-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,6]]},"references-count":16,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["328"],"URL":"https:\/\/doi.org\/10.1007\/s00153-013-0328-9","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,6]]}}}