{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:24:04Z","timestamp":1725902644450},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662553855"},{"type":"electronic","value":"9783662553862"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-55386-2_20","type":"book-chapter","created":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T07:24:53Z","timestamp":1498634693000},"page":"281-294","source":"Crossref","is-referenced-by-count":2,"title":["Solovay\u2019s Completeness Without Fixed Points"],"prefix":"10.1007","author":[{"given":"Fedor","family":"Pakhomov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,29]]},"reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.2307\/2274474","volume":"55","author":"A Berarducci","year":"1990","unstructured":"Berarducci, A.: The interpretability logic of Peano arithmetic. J. Symbolic Logic 55(3), 1059\u20131089 (1990)","journal-title":"J. Symbolic Logic"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Boolos, G.: The Logic of Provability. Cambridge University Press, Cambridge (1995)","DOI":"10.1017\/CBO9780511625183"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Beklemishev, L., Visser, A.: Problems in the logic of provability. In: Gabbay, D.M., Goncharov, S.S., Zakharyaschev, M. (eds.) Mathematical Problems from Applied Logic I. International Mathematical Series, pp. 77\u2013136. Springer, New York (2006)","DOI":"10.1007\/0-387-31072-X_2"},{"key":"20_CR4","volume-title":"Model Theory","author":"CC Chang","year":"1990","unstructured":"Chang, C.C., Keisler, H.J.: Model Theory, vol. 73. Elsevier, Amsterdam (1990)"},{"issue":"1","key":"20_CR5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF00370387","volume":"50","author":"D Jongh de","year":"1991","unstructured":"de Jongh, D., Jumelet, M., Montagna, F.: On the proof of Solovay\u2019s theorem. Studia Logica: Int. J. Symbolic Logic 50(1), 51\u201369 (1991)","journal-title":"Studia Logica: Int. J. Symbolic Logic"},{"key":"20_CR6","unstructured":"G\u00f6del, K.: Ein Interpretation des intuitionistischen Aussagenkalk\u00fcls. In Ergebnisse eines mathematischen Kolloquiums, vol. 4, pp. 39\u201340. Oxford (1933). Reprinted: An Interpretation of the Intuitionistic Propositional Calculus, Feferman, S, ed. G\u00f6del Collected Works I publications, 1929\u20131936"},{"key":"20_CR7","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BFb0099487","volume-title":"Computation and Proof Theory","author":"P H\u00e1jek","year":"1984","unstructured":"H\u00e1jek, P.: On a new notion of partial conservativity. In: B\u00f6rger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds.) Computation and Proof Theory. LNM, vol. 1104, pp. 217\u2013232. Springer, Heidelberg (1984). doi: 10.1007\/BFb0099487"},{"issue":"11","key":"20_CR8","doi-asserted-by":"crossref","first-page":"5805","DOI":"10.1090\/S0002-9947-09-04847-8","volume":"361","author":"D Hirschfeldt","year":"2009","unstructured":"Hirschfeldt, D., Shore, R., Slaman, T.: The atomic model theorem and type omitting. Trans. Am. Math. Soc. 361(11), 5805\u20135837 (2009)","journal-title":"Trans. Am. Math. Soc."},{"key":"20_CR9","unstructured":"Japaridze, G.K.: The modal logical means of investigation of provability. Thesis in Philosophy, in Russian, Moscow (1986)"},{"issue":"1","key":"20_CR10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2307\/2275611","volume":"61","author":"H Kotlarski","year":"1996","unstructured":"Kotlarski, H.: An addition to Rosser\u2019s theorem. J. Symbolic Logic 61(1), 285\u2013292 (1996)","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"20_CR11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01633984","volume":"28","author":"J Kraj\u00ed\u010dek","year":"1989","unstructured":"Kraj\u00ed\u010dek, J., Pudl\u00e1k, P.: On the structure of initial segments of models of arithmetic. Arch. Math. Logic 28(2), 91\u201398 (1989)","journal-title":"Arch. Math. Logic"},{"issue":"02","key":"20_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.2307\/2266895","volume":"20","author":"MH L\u00f6b","year":"1955","unstructured":"L\u00f6b, M.H.: Solution of a problem of Leon Henkin. J. Symbolic Logic 20(02), 115\u2013118 (1955)","journal-title":"J. Symbolic Logic"},{"key":"20_CR13","unstructured":"Pakhomov, F.: Semi-provability predicates and extensions of $$\\sf GL$$ . In: 11th International Conference on Advances in Modal Logic, Short Presentations, pp. 110\u2013115 (2016)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Pudl\u00e1k, P.: On the length of proofs of finitistic consistency statements in first order theories. In: Logic Colloquium, vol. 84, pp. 165\u2013196. Amsterdam, North-Holland (1986)","DOI":"10.1016\/S0049-237X(08)70462-2"},{"key":"20_CR15","unstructured":"Segerberg, K.: An essay in classical modal logic. Ph.D. thesis, Uppsala:: Filosofiska F\u00f6reningen och Filosofiska Institutionen vid Uppsala Universitet (1971)"},{"key":"20_CR16","unstructured":"Shavrukov, V.Y.: The logic of relative interpretability over Peano arithmetic. Technical report, (5) (1988). Moscow: Steklov Mathematical Institute (in Russian)"},{"key":"20_CR17","unstructured":"Shipman, J.: Only one proof, 2009. FOM mailing list. http:\/\/cs.nyu.edu\/pipermail\/fom\/2009-August\/013994.html"},{"key":"20_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511581007","volume-title":"Subsystems of Second Order Arithmetic","author":"SG Simpson","year":"2009","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic, vol. 1. Cambridge University Press, Cambridge (2009)"},{"key":"20_CR19","first-page":"237","volume":"16","author":"TJ Smiley","year":"1963","unstructured":"Smiley, T.J.: The logical basis of ethics. Acta Philosophica Fennica 16, 237\u2013246 (1963)","journal-title":"Acta Philosophica Fennica"},{"key":"20_CR20","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02757006","volume":"25","author":"RM Solovay","year":"1976","unstructured":"Solovay, R.M.: Provability interpretations of modal logic. Israel J. Math. 25, 287\u2013304 (1976)","journal-title":"Israel J. Math."},{"key":"20_CR21","unstructured":"Solovay, R.M.: 12 May 1986. Letter by R. Solovay to E. Nelson"},{"issue":"1\u20132","key":"20_CR22","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0168-0072(89)90048-1","volume":"44","author":"RM Solovay","year":"1989","unstructured":"Solovay, R.M.: Injecting inconsistencies into models of PA. Ann. Pure Appl. Logic 44(1\u20132), 101\u2013132 (1989)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"03","key":"20_CR23","doi-asserted-by":"crossref","first-page":"785","DOI":"10.2307\/2275908","volume":"59","author":"R Verbrugge","year":"1994","unstructured":"Verbrugge, R., Visser, A.: A small reflection principle for bounded arithmetic. J. Symbolic Logic 59(03), 785\u2013812 (1994)","journal-title":"J. Symbolic Logic"},{"key":"20_CR24","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0049-237X(08)70042-9","volume":"126","author":"A Wilkie","year":"1989","unstructured":"Wilkie, A., Paris, J.: On the existence of end extensions of models of bounded induction. Stud. Logic Found. Math. 126, 143\u2013161 (1989)","journal-title":"Stud. Logic Found. Math."}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55386-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T05:19:18Z","timestamp":1569561558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55386-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662553855","9783662553862"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55386-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}