{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:06Z","timestamp":1725490266662},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749141"},{"type":"electronic","value":"9783540749158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_3","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"4-5","source":"Crossref","is-referenced-by-count":0,"title":["Proofs, Programs and Abstract Complexity"],"prefix":"10.1007","author":[{"given":"Arnold","family":"Beckmann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Beckmann, A.: Seperating fragments of bounded predicative arithmetic. PhD thesis, Westf\u00e4lische Wilhelms-Universit\u00e4t, M\u00fcnster (1996)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00153-002-0169-4","volume":"42","author":"A. Beckmann","year":"2003","unstructured":"Beckmann, A.: Dynamic ordinal analysis. Arch. Math. Logic\u00a042, 303\u2013334 (2003)","journal-title":"Arch. Math. Logic"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Beckmann, A.: Generalised dynamic ordinals-universal measures for implicit computational complexity. In: Logic Colloquium 2002, Assoc. Symbol. Logic, La Jolla, CA. Lect. Notes Log, vol.\u00a027, pp. 48\u201374 (2006)","DOI":"10.1017\/9781316755723.004"},{"key":"3_CR4","unstructured":"Buss, S.R.: Bounded arithmetic, Stud. Proof Theory, Lect. Notes. Bibliopolis, Naples, vol.\u00a03 (1986)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01201353","volume":"39","author":"G. Gentzen","year":"1935","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schlie\u00dfen i. Math. Z.\u00a039, 176\u2013210 (1935)","journal-title":"Math. Z."},{"key":"3_CR6","first-page":"19","volume":"4","author":"G. Gentzen","year":"1938","unstructured":"Gentzen, G.: Neue Fassung des Widerspruchsfreiheitsbeweises f\u00fcr die reine Zahlentheorie. Forsch. Logik Grundl. exakten Wiss.\u00a04, 19\u201344 (1938)","journal-title":"Forsch. Logik Grundl. exakten Wiss."},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1093\/oso\/9780198536901.003.0015","volume-title":"Arithmetic, proof theory, and computational complexity, Oxford Logic Guides","author":"R. Sommer","year":"1993","unstructured":"Sommer, R.: Ordinal arithmetic in I\u0394 0. In: Clote, P., Kraj\u00ed\u010dek, J. (eds.) Arithmetic, proof theory, and computational complexity, Oxford Logic Guides, pp. 320\u2013363. Oxford University Press, New York (1993)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T15:37:02Z","timestamp":1708184222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}