{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T18:40:15Z","timestamp":1706985615184},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1995,2,1]],"date-time":"1995-02-01T00:00:00Z","timestamp":791596800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch Math Logic"],"published-print":{"date-parts":[[1995,2]]},"DOI":"10.1007\/bf02390458","type":"journal-article","created":{"date-parts":[[2006,4,10]],"date-time":"2006-04-10T17:46:38Z","timestamp":1144691198000},"page":"427-453","source":"Crossref","is-referenced-by-count":6,"title":["RSUV isomorphisms for TAC i , TNC i and TLS"],"prefix":"10.1007","volume":"33","author":[{"given":"G.","family":"Takeuti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02390458_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90057-S","volume":"53","author":"B. Allen","year":"1991","unstructured":"Allen B.: Arithmetizing uniform NC. Ann. Pure Appl. Logic53, 1\u201350 (1991)","journal-title":"Ann. Pure Appl. Logic"},{"key":"BF02390458_CR2","volume-title":"Bounded arithmetic","author":"S. Buss","year":"1986","unstructured":"Buss S.: Bounded arithmetic. Napoli: Biblopolis 1986"},{"key":"BF02390458_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0168-0072(92)90068-B","volume":"56","author":"P. Clote","year":"1992","unstructured":"Clote P., Takeuti G.: Bounded arithmetic for NC, ALOGTIME, L and NL. Ann. Pure Appl. Logic56, 73\u2013117 (1992)","journal-title":"Ann. Pure Appl. Logic"},{"key":"BF02390458_CR4","unstructured":"Colte P., Takeuti G.: First order bounded arithmetic and small boolean circuit complexity classes (to appear)"},{"key":"BF02390458_CR5","volume-title":"Computational limitations of small-depth circuits","author":"J. H\u00e5stad","year":"1987","unstructured":"H\u00e5stad J.: Computational limitations of small-depth circuits. Cambridge, Massachusetts: MIT Press 1987"},{"key":"BF02390458_CR6","volume-title":"Metamathematics of first-order arithmetic","author":"P. H\u00e1jek","year":"1991","unstructured":"H\u00e1jek P., Pudl\u00e1k P.: Metamathematics of first-order arithmetic. Berlin Heidelberg New York: Springer 1991"},{"key":"BF02390458_CR7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/978-1-4612-3466-1_15","volume-title":"Feasible mathematics","author":"J. Kraj\u00ed\u010dek","year":"1990","unstructured":"Kraj\u00ed\u010dek J., Takeuti G.: On bounded\u03a3 1 1 polynomial induction. In: Buss S., Scott P. (eds.) Feasible mathematics, pp. 259\u2013280. Basel: Birkh\u00e4user 1990"},{"key":"BF02390458_CR8","unstructured":"Takeuti G.: Proof theory, 2nd ed. Amsterdam: North-Holland"},{"key":"BF02390458_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01621092","volume":"29","author":"G. Takeuti","year":"1990","unstructured":"Takeuti G.:S 3 i and0V 2 i(BD) . Arch. Math. Logic29, 149\u2013169 (1990)","journal-title":"Arch. Math. Logic"},{"key":"BF02390458_CR10","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1093\/oso\/9780198536901.003.0016","volume-title":"Arithmetic, proof theory and computational complexity","author":"G. Takeuti","year":"1993","unstructured":"Takeuti G.: RSUV Isomorphisms. In: Clote P., Kraj\u00ed\u010dek J. (eds.) Arithmetic, proof theory and computational complexity, pp. 364\u2013386. Oxford: Oxford Univ. Press 1993"},{"key":"BF02390458_CR11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0168-0072(87)90066-2","volume":"35","author":"A.J. Wilkie","year":"1987","unstructured":"Wilkie A.J., Paris J.B.: On the scheme of induction for bounded arithmetical formulas. Ann. Pure Appl. Logic35, 261\u2013302 (1987)","journal-title":"Ann. Pure Appl. Logic"},{"key":"BF02390458_CR12","doi-asserted-by":"crossref","unstructured":"Yao A.: Separating the polynomial-time hierachy by oracles. Proceedings 26th Annual IEEE Symposium on Foundations of Computer Science, pp. 1\u201310 (1985)","DOI":"10.1109\/SFCS.1985.49"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02390458.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02390458\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02390458","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T18:20:12Z","timestamp":1706984412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02390458"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,2]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,2]]}},"alternative-id":["BF02390458"],"URL":"https:\/\/doi.org\/10.1007\/bf02390458","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,2]]}}}