{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T05:28:40Z","timestamp":1735968520658,"version":"3.32.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch math Logik"],"published-print":{"date-parts":[[1985,12]]},"DOI":"10.1007\/bf02007556","type":"journal-article","created":{"date-parts":[[2005,8,11]],"date-time":"2005-08-11T12:49:28Z","timestamp":1123764568000},"page":"45-65","source":"Crossref","is-referenced-by-count":16,"title":["Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher B\u00e4ume","Unprovability of certain combinatorial properties of finite trees"],"prefix":"10.1007","volume":"25","author":[{"given":"Stephen G.","family":"Simpson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02007556_CR1","unstructured":"Buchholz, W.: A new system of proof-theoretic ordinal functions, in Vorbereitung."},{"key":"BF02007556_CR2","doi-asserted-by":"crossref","unstructured":"Buchholz, W., Feferman, S., Pohlers, W., Sieg, W.: Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies, Lecture Notes in Math.897, Springer-Verlag, 1981, 383 Seiten.","DOI":"10.1007\/BFb0091894"},{"key":"BF02007556_CR3","unstructured":"Buchholz, W., Sch\u00fctte, K.: Ein Ordinalzahlensystem f\u00fcr die beweistheoretische Abgrenzung der \u03a0 2 1 -Separation und Bar-Induktion, Sitzungsberichte der Bayerischen Akademie der Wiss., Math. Naturw. Klasse, 99\u2013132 (1983)."},{"key":"BF02007556_CR4","unstructured":"Buchholz, W., Sch\u00fctte, K.: Proof Theoretic Ordinals of Impredicative Subsystems of Analysis, in Vorbereitung."},{"key":"BF02007556_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2269764","volume":"29","author":"S. Feferman","year":"1964","unstructured":"Feferman, S.: Systems of predictive analysis. J. Symb. Logic.29, 1\u201330 (1964);33, 193\u2013220 (1968).","journal-title":"J. Symb. Logic."},{"key":"BF02007556_CR6","unstructured":"Friedman: Some systems of second order arithmetic and their use, Proceedings of the International Congress of Mathematicians (Vancouver, 1974),1, Canadian Mathematical Congress, 235\u2013242 (1975)."},{"key":"BF02007556_CR7","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1017\/S0022481200051410","volume":"41","author":"H. Friedman","year":"1976","unstructured":"Friedman, H.: Systems of second order arithmetic with restricted induction (abstracts). J. Symb. Logic41, 557\u2013559 (1976).","journal-title":"J. Symb. Logic"},{"key":"BF02007556_CR8","volume-title":"Independence results in finite graph theory I\u2013VII, nicht ver\u00f6ffentlichte Manuskripte","author":"H. Friedman","year":"1981","unstructured":"Friedman, H.: Independence results in finite graph theory I\u2013VII, nicht ver\u00f6ffentlichte Manuskripte, Ohio State University, Februar-M\u00e4rz 1981, 76 Seiten."},{"key":"BF02007556_CR9","unstructured":"Friedman, H.: Beyond Kruskal's theorem I\u2013III, nicht ver\u00f6ffentlichte Manuskripte, Ohio State University, Juni-Juli 1982, 48 Seiten."},{"key":"BF02007556_CR10","unstructured":"Friedman, H., McAloon, K., Simpson, S.G.: A finite combinatorial principle which is equivalent to the 1-consistency of predicative analysis. Patras Logic Symposion (redigiert von G. Metakides), North-Holland, 197\u2013230 (1982)."},{"key":"BF02007556_CR11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0168-0072(83)90012-X","volume":"25","author":"H. Friedman","year":"1983","unstructured":"Friedman, H., Simpson, S.G., Smith, R.L.: Countable algebra and set existence axioms. Annals of Pure and Applied Logic25, 141\u2013181 (1983).","journal-title":"Annals of Pure and Applied Logic"},{"key":"BF02007556_CR12","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc.2, 326\u2013336 (1952).","journal-title":"Proc. Lond. Math. Soc."},{"key":"BF02007556_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02007140","volume":"24","author":"G. J\u00e4ger","year":"1984","unstructured":"J\u00e4ger, G.: \u03d6-inaccessible ordinals, collapsing functions, and a recursive notation system. Arch. math. Logik24, 49\u201362 (1984).","journal-title":"Arch. math. Logik"},{"key":"BF02007556_CR14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.2307\/2274140","volume":"49","author":"G. J\u00e4ger","year":"1984","unstructured":"J\u00e4ger, G.: The strength of admissibility without foundation. J. Symb. Logic49, 233\u2013245 (1984).","journal-title":"J. Symb. Logic"},{"key":"BF02007556_CR15","unstructured":"J\u00e4ger, G., Pohlers, W.: Admissible Proof Theory. Springer-Verlag (in Vorbereitung)"},{"key":"BF02007556_CR16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1112\/blms\/14.4.285","volume":"14","author":"L. Kirby","year":"1982","unstructured":"Kirby, L., Paris, J.: Accessible independence results for Peano arithmetic. Bull. Lond. Math. Soc.14, 285\u2013293 (1982).","journal-title":"Bull. Lond. Math. Soc."},{"key":"BF02007556_CR17","first-page":"121","volume":"3","author":"D. K\u00f6nig","year":"1927","unstructured":"K\u00f6nig, D.: \u00dcber eine Schlu\u00dfweise aus dem Endlichen ins Unendliche. Acta Litterarum ac Scientarum (Ser. Sci. Math.) Szeged3, 121\u2013130 (1927).","journal-title":"Acta Litterarum ac Scientarum (Ser. Sci. Math.) Szeged"},{"key":"BF02007556_CR18","first-page":"210","volume":"95","author":"J. Kruskal","year":"1960","unstructured":"Kruskal, J.: Well-quasi-ordering, the three theorem, and V\u00e1zsonyi's conjecture. Trans. Am. Math. Soc.95, 210\u2013225 (1960).","journal-title":"Trans. Am. Math. Soc."},{"key":"BF02007556_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S030500410005204X","volume":"79","author":"R. Laver","year":"1976","unstructured":"Laver, R.: Well-quasi-orderings and sets of finite sequences. Math. Proc. Cambridge Phil. Soc.79, 1\u201310 (1976).","journal-title":"Math. Proc. Cambridge Phil. Soc."},{"key":"BF02007556_CR20","first-page":"31","volume":"1","author":"R. Laver","year":"1978","unstructured":"Laver, R.: Better-quasi-orderings and a class of trees, Studies in Foundations and Combinatorics. Adv. Math. Suppl. Stud.1, 31\u201348 (1978).","journal-title":"Adv. Math. Suppl. Stud."},{"key":"BF02007556_CR21","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0095-8956(72)90015-9","volume":"12","author":"W. Mader","year":"1972","unstructured":"Mader, W.: Wohlquasigeordnete Klassen endlicher Graphen. J. Comb. Theory B12, 105\u2013122 (1972).","journal-title":"J. Comb. Theory B"},{"key":"BF02007556_CR22","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1017\/S0305004100003844","volume":"59","author":"C.St.J.A. Nash-Williams","year":"1963","unstructured":"Nash-Williams, C.St.J.A.: On well-quasi-ordering finite trees. Proc. Cambridge Phil. Soc.59, 833\u2013835 (1963).","journal-title":"Proc. Cambridge Phil. Soc."},{"key":"BF02007556_CR23","doi-asserted-by":"crossref","unstructured":"Paris, J., Harrington, L.: A mathematical incompleteness in Peano arithmetic. Handbook of Mathematical Logic (redigiert von J. Barwise). North-Holland, 1133\u20131142 (1977).","DOI":"10.1016\/S0049-237X(08)71130-3"},{"key":"BF02007556_CR24","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BFb0079558","volume":"500","author":"W. Pohlers","year":"1975","unstructured":"Pohlers, W.: An upper bound for the probability of transfinite induction in systems withn-times iterated inductive definitions. Proof Theory Symposium (Kiel 1974). Lecture Notes in Mathematics500, 271\u2013289, Springer-Verlag 1975.","journal-title":"Lecture Notes in Mathematics"},{"key":"BF02007556_CR25","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F.P. Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc.30, 264\u2013286 (1930).","journal-title":"Proc. London Math. Soc."},{"key":"BF02007556_CR26","doi-asserted-by":"crossref","first-page":"423","DOI":"10.2307\/2273152","volume":"47","author":"J.H. Schmerl","year":"1982","unstructured":"Schmerl, J.H., Simpson, S.G.: On the role of Ramsey quantifiers in first order arithmetic. J. Symb. Logic47, 423\u2013435 (1982).","journal-title":"J. Symb. Logic"},{"key":"BF02007556_CR27","volume-title":"Well-partial orderings and their maximal order types","author":"D. Schmidt","year":"1979","unstructured":"Schmidt, D.: Well-partial orderings and their maximal order types. Habilitationsschrift, Heidelberg, 1979, 77 Seiten."},{"key":"BF02007556_CR28","doi-asserted-by":"crossref","unstructured":"Sch\u00fctte, K.: Predicative well-orderings. Formal Systems and Recursive Functions (redigiert von J. Crossley und M. Dummett) 280\u2013303. North-Holland 1965.","DOI":"10.1016\/S0049-237X(08)71694-X"},{"key":"BF02007556_CR29","doi-asserted-by":"crossref","unstructured":"Sch\u00fctte, K.: Proof Theory, 299 Seiten. Springer-Verlag 1977.","DOI":"10.1007\/978-3-642-66473-1"},{"key":"BF02007556_CR30","doi-asserted-by":"crossref","unstructured":"Shelah, S.: On logical sentences in PA, Fr\u00fchjahr 1983, 15 Seiten.","DOI":"10.1016\/S0049-237X(08)71815-9"},{"key":"BF02007556_CR31","unstructured":"Simpson, S.G.: BQO theory and Fraisse's conjecture, Kapitel 9 von: R. Mansfield und G. Weitkamp, Descriptive Set Theory. Oxford Logic Guides, 127 Seiten (1985)."},{"key":"BF02007556_CR32","doi-asserted-by":"crossref","unstructured":"Simpson, S.G.: \u03a3 1 1 and \u03a0 1 1 transfinite induction. Logic Colloquium '80 (redigiert von D. van Dalen, D. Lascar und J. Smiley), pp. 239\u2013253. North-Holland 1982.","DOI":"10.1016\/S0049-237X(09)70514-2"},{"key":"BF02007556_CR33","doi-asserted-by":"crossref","unstructured":"Simpson, S.G.: Set theoretic aspects ofATR 0. Logic Colloquium '80 (redigiert von D. van Dalen, D. Lascar und J. Smiley), pp. 254\u2013271. North-Holland 1982.","DOI":"10.1016\/S0049-237X(09)70515-4"},{"key":"BF02007556_CR34","doi-asserted-by":"crossref","first-page":"361","DOI":"10.2307\/2274131","volume":"49","author":"S.G. Simpson","year":"1984","unstructured":"Simpson, S.G.: Which set existence axioms are needed to prove the Cauchy\/Peano theorem for ordinary differential equations? J. Symb. Logic49, 361\u2013380 (1984).","journal-title":"J. Symb. Logic"},{"key":"BF02007556_CR35","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1090\/pspum\/042\/791071","volume":"42","author":"S.G. Simpson","year":"1985","unstructured":"Simpson, S.G.: Reverse Mathematics. Proceedings of the AMS Summer Institute in Recursion Theory (redigiert von A. Nerode und R. Shore). Proc. Symp. Pure Math.42, 461\u2013471 (1985).","journal-title":"Proc. Symp. Pure Math."},{"key":"BF02007556_CR36","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic (in Vorbereitung)."},{"key":"BF02007556_CR37","unstructured":"Steel, J.: Determinateness and subsystems of analysis. Ph. D. Thesis, pp. 107. Berkeley 1976."},{"key":"BF02007556_CR38","doi-asserted-by":"crossref","first-page":"386","DOI":"10.2969\/jmsj\/00940386","volume":"9","author":"G. Takeuti","year":"1957","unstructured":"Takeuti, G.: Ordinal diagrams. J. Math. Soc. Jpn.9, 386\u2013394 (1957);12, 385\u2013391 (1960).","journal-title":"J. Math. Soc. Jpn."},{"key":"BF02007556_CR39","unstructured":"Takeuti, G.: Proof Theory, 372 Seiten. North-Holland 1975."},{"key":"BF02007556_CR40","unstructured":"Takeuti, G.: Two Applications of Logic to Mathematics. Iwanami Shoten und Princeton University Press, 139 Seiten. (1978)."}],"container-title":["Archiv f\u00fcr Mathematische Logik und Grundlagenforschung"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02007556.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02007556\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02007556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T10:29:27Z","timestamp":1735900167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02007556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["BF02007556"],"URL":"https:\/\/doi.org\/10.1007\/bf02007556","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"type":"print","value":"0933-5846"},{"type":"electronic","value":"1432-0665"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}