{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:06Z","timestamp":1725512106172},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_23","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T01:07:56Z","timestamp":1209431276000},"page":"258-269","source":"Crossref","is-referenced-by-count":2,"title":["A Characterisation of the Relations Definable in Presburger Arithmetic"],"prefix":"10.1007","author":[{"given":"Mathias","family":"Barra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Bennett, J.H.: On Spectra, Ph.D. thesis, Princeton University (1962)"},{"key":"23_CR2","volume-title":"Handbook of Computability Theory","author":"P. Clote","year":"1996","unstructured":"Clote, P.: Computation Models and Function Algebra. In: Handbook of Computability Theory, Elsevier, Amsterdam (1996)"},{"key":"23_CR3","volume-title":"A mathematical introduction to logic","author":"H.B. Enderton","year":"1972","unstructured":"Enderton, H.B.: A mathematical introduction to logic. Academic Press, Inc., San Diego (1972)"},{"key":"23_CR4","unstructured":"Grzegorczyk, A.: Some classes of recursive functions. In: Rozprawy Matematyczne, vol.\u00a0IV, Warszawa (1953)"},{"key":"23_CR5","unstructured":"Harrow, K.: Sub-elementary classes of functions and relations, Ph.D.Thesis, New York University (1973)"},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1002\/malq.19750210157","volume":"21","author":"K. Harrow","year":"1975","unstructured":"Harrow, K.: Small Grzegorczyk classes and limited minimum. Zeitscr. f. math. Logik und Grundlagen d. Math.\u00a021, 417\u2013426 (1975)","journal-title":"Zeitscr. f. math. Logik und Grundlagen d. Math."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(98)00357-0","volume":"228","author":"N.D. Jones","year":"1999","unstructured":"Jones, N.D.: Logspace and Ptime characterized by programming languages. Theoretical Computer Science\u00a0228, 151\u2013174 (1999)","journal-title":"Theoretical Computer Science"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1017\/S0956796800003889","volume":"11","author":"N.D. Jones","year":"2001","unstructured":"Jones, N.D.: The expressive power of higher-order types or, life without CONS. J. Functional Programming\u00a011, 55\u201394 (2001)","journal-title":"J. Functional Programming"},{"issue":"1","key":"23_CR9","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s00037-005-0191-0","volume":"14","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L.: Neat function algebraic characterizations of logspace and linspace. Computational Complexity\u00a014(1), 72\u201388 (2005)","journal-title":"Computational Complexity"},{"key":"23_CR10","unstructured":"Kristiansen, L.: Complexity-Theoretic Hierarchies Induced by Fragments of G\u00f6del\u2019s T: Theory of Computing Systems (2007), http:\/\/www.springerlink.com\/content\/e53l54627x063685\/"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/11494645_32","volume-title":"New Computational Paradigms","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L., Barra, M.: The small Grzegorczyk classes and the typed \u03bb-calculus. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol.\u00a03526, pp. 252\u2013262. Springer, Heidelberg (2005)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-540-45220-1_28","volume-title":"Computer Science Logic","author":"L. Kristiansen","year":"2003","unstructured":"Kristiansen, L., Voda, P.J.: The surprising power of restricted programs and G\u00f6del\u2019s functionals. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 345\u2013358. Springer, Heidelberg (2003)"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.ipl.2003.08.010","volume":"88","author":"L. Kristiansen","year":"2003","unstructured":"Kristiansen, L., Voda, P.J.: Complexity classes and fragments of C. Information Processing Letters\u00a088, 213\u2013218 (2003)","journal-title":"Information Processing Letters"},{"key":"23_CR14","first-page":"193","volume-title":"Proc. ${19}^\\text{\\tiny{th}}$ Annual Symp. on Foundations of Computer Science","author":"R.J. Lipton","year":"1978","unstructured":"Lipton, R.J.: Model theoretic aspects of computational complexity. In: Proc. ${19}^\\text{\\tiny{th}}$ Annual Symp. on Foundations of Computer Science, Silver Spring MD, pp. 193\u2013200. IEEE Computer Society, Los Alamitos (1978)"},{"key":"23_CR15","unstructured":"Presburger, M.: \u00dcber die Vollst\u00e4ndigket eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Sprawozdanie z I Kongresu Matematyk\u00f3w S\u0142owa\u0144skich, pp. 92\u2013101 (1930)"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1080\/014453409108837187","volume":"12","author":"M. Presburger","year":"1991","unstructured":"Presburger, M., Jaquette, D.: On the Completeness of a Certain System of Arithmetic of Whole Numbers in Which Addition Occurs as the Only Operation. History and Philosophy of Logic\u00a012, 225\u2013233 (1991)","journal-title":"History and Philosophy of Logic"},{"key":"23_CR17","doi-asserted-by":"crossref","DOI":"10.1515\/9781400882007","volume-title":"Theory of formal systems, (revised edition)","author":"R.M. Smullyan","year":"1961","unstructured":"Smullyan, R.M.: Theory of formal systems (revised edition). Princeton University Press, Princeton, New Jersey (1961)"},{"issue":"2","key":"23_CR18","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0207018","volume":"7","author":"C. Wrathall","year":"1978","unstructured":"Wrathall, C.: Rudimentary predicates and relative computation. SIAM J. Comput.\u00a07(2), 194\u2013209 (1978)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:17:46Z","timestamp":1606166266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_23","relation":{},"subject":[]}}