{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:37:58Z","timestamp":1725471478198},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540659228"},{"type":"electronic","value":"9783540488552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/10703163_15","type":"book-chapter","created":{"date-parts":[[2006,10,9]],"date-time":"2006-10-09T18:15:50Z","timestamp":1160417750000},"page":"204-223","source":"Crossref","is-referenced-by-count":0,"title":["Theorems of P\u00e9ter and Parsons in Computer Programming"],"prefix":"10.1007","author":[{"given":"J\u00e1n","family":"Komara","sequence":"first","affiliation":[]},{"given":"Paul J.","family":"Voda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","volume-title":"Logic, Methodology and Philosophy of Science IX","author":"S.R. Buss","year":"1994","unstructured":"Buss, S.R.: The witness function method and provably recursive functions of Peano arithmetic. In: Prawitz, D., Skyrms, B., Westerstahl, D. (eds.) Logic, Methodology and Philosophy of Science IX (1991). North-Holland, Amsterdam (1994)"},{"key":"15_CR2","first-page":"24","volume-title":"Logic, Methodology and Philosophy of Science II","author":"A. Cobham","year":"1965","unstructured":"Cobham, A.: The intristic computational difficulty of functions. In: Bar- Hillel, Y. (ed.) Logic, Methodology and Philosophy of Science II, pp. 24\u201330. North-Holland, Amsterdam (1965)"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0304-3975(91)90039-5","volume":"83","author":"L. Colson","year":"1991","unstructured":"Colson, L.: About primitive recursive algorithms. Theoretical Computer Science\u00a083(1), 57\u201369 (1991)","journal-title":"Theoretical Computer Science"},{"key":"15_CR4","volume-title":"Computability and Unsolvability","author":"M. Davis","year":"1985","unstructured":"Davis, M.: Computability and Unsolvability, 2nd edn. McGraw-Hill, New York (1985)","edition":"2"},{"key":"15_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22156-3","volume-title":"Metamathematics of First-Order Arithmetic","author":"P. H\u00e1jek","year":"1993","unstructured":"H\u00e1jek, P., Pudl\u00e1k, P.: Metamathematics of First-Order Arithmetic. Springer, Heidelberg (1993)"},{"key":"15_CR6","first-page":"1","volume":"50","author":"L. Kalm\u00e1r","year":"1943","unstructured":"Kalm\u00e1r, L.: A simple example of an undecidable arithmetical problem (Hungarian with German abstract). Matematikai \u00e9s Fizikai Lapok\u00a050, 1\u201323 (1943)","journal-title":"Matematikai \u00e9s Fizikai Lapok"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.2307\/2267457","volume":"17","author":"G. Kreisel","year":"1952","unstructured":"Kreisel, G.: On the interpretation of non-finitist proofs II. Journal of Symbolic Logic\u00a017, 43\u201358 (1952)","journal-title":"Journal of Symbolic Logic"},{"key":"15_CR8","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/3-540-59338-1_39","volume-title":"Theorem Proving with Analytic Tableaux and Related Methods","author":"J. Komara","year":"1995","unstructured":"Komara, J., Voda, P.J.: Syntactic reduction of predicate tableaux to prepositional tableaux. In: Baumgartner, P., Posegga, J., H\u00e4hnle, R. (eds.) TABLEAUX 1995. LNCS (LNAI), vol.\u00a0918, pp. 231\u2013246. Springer, Heidelberg (1995)"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF01117472","volume":"1","author":"G. Mints","year":"1973","unstructured":"Mints, G.: Quantifier-free and one-quantifier systems. Journal of Soviet Mathematics\u00a01, 71\u201384 (1973)","journal-title":"Journal of Soviet Mathematics"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/S0049-237X(08)70771-7","volume-title":"Intuitionism and Proof Theory: proceedings of the summer conference","author":"C. Parsons","year":"1970","unstructured":"Parsons, C.: On a number-theoretic choice schema and its relation to induction. In: Intuitionism and Proof Theory: proceedings of the summer conference, Buffalo, N.Y.(1968), pp. 459\u2013473. North-Holland, Amsterdam (1970)"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1007\/BF01448046","volume":"110","author":"R. P\u00e9ter","year":"1932","unstructured":"P\u00e9ter, R.: \u00dcber den Zusammenhang der verschiedenen Begriffe der rekursiven Funktion. Mathematische Annalen\u00a0110, 612\u2013632 (1932)","journal-title":"Mathematische Annalen"},{"key":"15_CR12","volume-title":"Recursive Functions","author":"R. P\u00e9ter","year":"1967","unstructured":"P\u00e9ter, R.: Recursive Functions. Academic Press, London (1967)"},{"key":"15_CR13","series-title":"Oxford Logic Guides","volume-title":"Subrecursion: Functions and Hierarchies","author":"H.E. Rose","year":"1982","unstructured":"Rose, H.E.: Subrecursion: Functions and Hierarchies. Oxford Logic Guides, vol.\u00a09. Clarendon Press, Oxford (1982)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BF01621477","volume":"30","author":"W. Sieg","year":"1991","unstructured":"Sieg, W.: Herbrand analyses. Archive for Mathematical Logic\u00a030, 409\u2013441 (1991)","journal-title":"Archive for Mathematical Logic"},{"key":"15_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-86718-7","volume-title":"First Order Logic","author":"R. Smullyan","year":"1968","unstructured":"Smullyan, R.: First Order Logic. Springer, Heidelberg (1968)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/BFb0022266","volume-title":"Computer Science Logic","author":"P.J. Voda","year":"1995","unstructured":"Voda, P.J.: Subrecursion as a basis for a feasible programming language. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol.\u00a0933, pp. 324\u2013338. Springer, Heidelberg (1995)"},{"key":"15_CR17","series-title":"Series F: Computer and Systems Sciences","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/978-3-642-59048-1_10","volume-title":"Logic of Computation","author":"S.S. Wainer","year":"1997","unstructured":"Wainer, S.S.: Basic proof theory and applications to computation. In: Schwichtenberg, H. (ed.) Logic of Computation. Series F: Computer and Systems Sciences, vol.\u00a0157, NATO Advanced Study Institute, International Summer School held in Marktoberdorf, Germany, July 25\u2013August 6 (1995), pp. 349\u2013394. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10703163_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T00:46:20Z","timestamp":1548463580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10703163_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540659228","9783540488552"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/10703163_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}