논문KCI 등재
A Note on Kruskal's Theorem
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
주제분류철학
초록
It is demonstrated that there is a simple, canonical way to show the independency of the Friedman-style miniaturization of Kruskal's theorem with respect to (∏^1_2 - BI)_0. This is done by a non-trivial combination of some well-known, non-trivial previous works concerning directly or indirectly the (proof-theoretic) strength of Kruskal's theorem.
Abstract
It is demonstrated that there is a simple, canonical way to show the independency of the Friedman-style miniaturization of Kruskal's theorem with respect to (∏^1_2 - BI)_0. This is done by a non-trivial combination of some well-known, non-trivial previous works concerning directly or indirectly the (proof-theoretic) strength of Kruskal's theorem.
참고문헌 (17)
- De Jongh, D. H. J, "Well-partial orderings and hierarchies", Indag. Math, 39(3), pp.195~207 (1977)
- Gallier, J. H., "What's so special about Kruskal's theorem and the ordinal? A survey of some results in proof theory", Ann. Pure Appl. Logic, 53(3), pp.199~260 (1991)
- Higman, G., "Ordering by divisibility in abstract algebras", Proc. London Math. Soc, 3(2), pp.326~336 (1952)
- Kolata, G., "Does Gödel's Theorem matter to mathematics?", Science, 218(4574), pp.779~780 (1982)
- König, D., "Über eine Schlußweise aus dem Endlichen ins Unendliche", Acta Szeged, 3, pp.121~130 (1927)
- Kruskal, J. B., "Well-quasi-ordering, the Tree Theorem, and Vazsonyi's conjecture", Trans. Amer. Math. Soc, 95, pp.210~225 (1960)
- Lee, G., "Phase transitions in axiomatic thought", 박사, pp.2005
- Loebl, M., "On undecidability of the weakened Kruskal theorem, In Logic and combinatorics", pp.275~280 (1987), Amer. Math. Soc
- Nash-Williams, C. St. J. A., "On well-quasi-ordering finite trees", Proc. Cambridge Phil. Soc, 59, pp.833~835 (1963)
- Otter, R., "The number of trees", Ann. of Math, 2(49), pp.583~599 (1948)
- Paris, J, "A Mathematical Incompleteness in Peano Arithmetic, In Handbook of Mathematical Logic" (1977)
- Rathjen, M, "Proof-theoretic investigations on Kruskal's theorem", Ann. Pure Appl. Logic, 60(1), pp.49~88 (1993)
- Schmidt, D., "Well-Partial Orderings and Their Maximal orderTypes" (1979), Habilitationsschrift
- Simpson, S. G., "Nonprovability of certain combinatorial properties of finite trees, Harvey Friedman's research on the foundations of mathematics", pp.87~117 (1985), Volume 117 of Stud. Logic Found. Math., North-Holland
- Smith, R. L., "The consistency strengths of some finite forms of the Higman and Kruskal theorems, In Harvey Friedman's research on the foundations of mathematics, Volume 117 of Stud. Logic Found. Math", pp.119~136 (1985), North-Holland
- Veldman, W., "An intuitionistic proof of Kruskal's theorem", Arch. Math. Log, 43(2), pp.215~264 (2004)
- Weiermann, A., "An application of graphical enumeration to PA", J. Symbolic Logic, 68(1), pp.5~16 (2003)
관련 논문AI추천
FRIEDMAN-WEIERMANN STYLE INDEPENDENCE RESULTS BEYOND PEANO ARITHMETIC이계식대한수학회 · 대한수학회지2014 · 제51권 제2호On G？del’s Program from Incompleteness to Speed-up현우식한국수학사학회 · 한국수학사학회지2002 · 제15권 제3호A reconstruction of the Gödel’s proof of the consistency of GCH and AC with the axioms of Zermelo-Fraenkel set theory최창순한국수학사학회 · 한국수학사학회지2011 · 제24권 제3호Refinement of Homogeneity and Ramsey numbers김화정, 이계식대한수학회 · 대한수학회논문집2018 · 제33권 제3호Variants of Essential Arity for Partial FunctionsErkko Lehtonen, Nareupanat Lekkoksung경북대학교 자연과학대학 수학과 · Kyungpook Mathematical Journal2020 · 제60권 제3호On Induction Principles in Frege’s Grundgesetze and in Systems Thereafter이계식한국논리학회 · 논리연구2016 · 제19권 제1호