{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:03Z","timestamp":1725455643055},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540571841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022567","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:14:45Z","timestamp":1131862485000},"page":"187-189","source":"Crossref","is-referenced-by-count":0,"title":["On the meaning of essentially unprovable theorems in the presburger theory of addition"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Faglia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(90)90080-L","volume":"48","author":"K.J. Compton","year":"1990","unstructured":"Compton, K.J., Henson, C.W.: A uniform method for proving lower bounds on the computational complexity of logical theories. Annals of Pure and Applied Logic, 48 (1990) 1\u201379.","journal-title":"Annals of Pure and Applied Logic"},{"key":"21_CR2","volume-title":"PhD thesis","author":"G. Faglia","year":"1993","unstructured":"Faglia, G.: Double exponential inseparability of theories of addition. PhD thesis, Dottorato di Ricerca in Informatica, Universit\u00e0 di Torino e Milano, Via Comelico 39, I-20135 Milano MI, Italy, February 1993. In Italian."},{"key":"21_CR3","unstructured":"Faglia, G.: Double Exponential Inseparability of the Robinson Subsystem Q+ from the Unsatisfiable Sentences in the Language of Addition. This volume."},{"key":"21_CR4","unstructured":"Faglia, G., Young, P.: On The Meaning Of Essentially Unprovable Theorems In The Presburger Theory Of Addition. In Theoretical Computer Science \u2014 Proceedings of the 4th Italian Conference World Scientific Publishing Co. Pte. Ltd., (1992) 214\u2013228."},{"key":"21_CR5","unstructured":"Fischer, M.J., Rabin, M.: Super-Exponential Complexity of Presburger Arithmetic. In Complexity of Computation, SIAM-AMS, (1974) 27\u201348."},{"key":"21_CR6","first-page":"729","volume":"1","author":"R.M. Robinson","year":"1950","unstructured":"Robinson, R.M.: An Essentially Undecidable Axiom System. In Proceedings of the International Congress of Mathematicians. Cambridge, 1, (1950) 729\u201330.","journal-title":"Proceedings of the International Congress of Mathematicians. Cambridge"},{"key":"21_CR7","unstructured":"Young, P.: G\u00f6del Theorems, Exponential Difficulty and Undecidability of Arithmetic Theories: An Exposition. In Proceedings of Symposia in Pure Mathematics, American Mathematical Society, (1985) 503\u2013522."}],"container-title":["Lecture Notes in Computer Science","Computational Logic and Proof Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022567.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:49:04Z","timestamp":1607550544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540571841"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0022567","relation":{},"subject":[]}}