Takeuti Gaisi and Yasugi Mariko. The ordinals of the systems of second order arithmetic with the provably -comprehension axiom and with the -comprehension axiom respectively. Japanese journal of mathematics, vol. 41 , pp. 1–67 [Book Review]

Journal of Symbolic Logic 48 (3):877-880 (1983)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273485

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,932

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: Gaisi Takeuti, Mariko Yasugi, The Ordinals of the Systems of Second Order Arithmetic with the Provably $triangle^12$-Comprehension Axiom and with the $triangle^12$- Comprehension Axiom Respectively. [REVIEW]Kurt Schutte - 1983 - Journal of Symbolic Logic 48 (3):877-878.
The Ordinals of the Systems of Second Order Arithmetic with the Provably ▵ 1 2 -Comprehension Axiom and with the ▵ 1 2 - Comprehension Axiom Respectively. [REVIEW]Gaisi Takeuti & Mariko Yasugi - 1983 - Journal of Symbolic Logic 48 (3):877-878.
Jan Krajíček, Pavel Pudlák, and Gaisi Takeuti. Bounded arithmetic and the polynomial hierarchy. Ibid., vol. 52 , pp. 143–153. - Samuel R. Buss. Relating the bounded arithmetic and polynomial time hierarchies. Ibid., vol. 75 , pp. 67–77. - Domenico Zambella. Notes on polynomially bounded arithmetic. The journal of symbolic logic, vol. 61 , pp. 942–966. [REVIEW]Stephen Cook - 1999 - Journal of Symbolic Logic 64 (4):1821-1823.
Internal Categoricity in Arithmetic and Set Theory.Jouko Väänänen & Tong Wang - 2015 - Notre Dame Journal of Formal Logic 56 (1):121-134.
Yasuyuki Imai and Kiyoshi Iséki. On axiom systems of propositional calculi. I. Proceedings of the Japan Academy, vol. 41 , pp. 436–439. - Yoshinari Arai. On axiom systems of propositional calculi. II.Proceedings of the Japan Academy, vol. 41 , pp. 440–442. - Yoshinari Arai. On axiom systems of propositional calculi. III.Proceedings of the Japan Academy, vol. 41 , pp. 570–574. - Kiyoshi Iséki. On axiom systems ofpropositional calculi. IV.Proceedings of the Japan Academy, vol. 41 , pp. 575–577. - Kiyoshi Iséki and Shôtarô Tanaka. On axiom systems of propositional calculi. V.Proceedings of the Japan Academy, vol. 41 , pp. 661–662. - Shôtarô Tanaka. On axiom systems ofpropositional calculi. VI.Proceedings of the Japan Academy, vol. 41 , pp. 663–666. - Yoshinari Arai and Kiyoshi Iséki. On axiom systems of propositional calculi. VII.Proceedings of the Japan Academy, vol. 41 , pp. 667–669. - Shôtarô Tanaka. On axiom systems of propositional calculi. VIII.Proceedings of the Japan Academy, vol. [REVIEW]Alan Rose - 1969 - Journal of Symbolic Logic 34 (1):122-124.
Logic and computation, Proceedings of a workshop held at Carnegie Mellon University, June 30–July 2, 1987, edited by Wilfried Sieg, Contemporary Mathematics, vol. 106, American Mathematical Society, Providence1990, xiv + 297 pp. - Douglas K. Brown. Notions of closed subsets of a complete separable metric space in weak subsystems of second order arithmetic. Pp. 39–50. - Kostas Hatzikiriakou and Stephen G. Simpson. WKL0 and orderings of countable abelian groups. Pp. 177–180. - Jeffry L. Hirst. Marriage theorems and reverse mathematics. Pp. 181–196. - Xiaokang Yu. Radon–Nikodym theorem is equivalent to arithmetical comprehension. Pp. 289–297. - Fernando Ferreira. Polynomial time computable arithmetic. Pp. 137–156. - Wilfried Buchholz and Wilfried Sieg. A note on polynomial time computable arithmetic. Pp. 51–55. - Samuel R. Buss. Axiomatizations and conservation results for fragments of bounded arithmetic. Pp. 57–84. - Gaisi Takeuti. Sharply bounded arithmetic and the function a – 1. Pp. 2. [REVIEW]Jörg Hudelmaier - 1996 - Journal of Symbolic Logic 61 (2):697-699.
Second order theories with ordinals and elementary comprehension.Gerhard Jäger & Thomas Strahm - 1995 - Archive for Mathematical Logic 34 (6):345-375.
Gaisi Takeuti. Proof theory. Studies in logic and the foundations of mathematics, vol. 81. North-Holland Publishing Company, Amsterdam and Oxford, and American Elsevier Publishing Company, New York, 1975, vii + 372 pp. - Gaisi Takeuti. Proof theory. Second edition of the preceding. Studies in logic and the foundations of mathematics, vol. 81. North-Holland, Amsterdam etc. 1987, x + 490 pp. - Georg Kreisel. Proof theory: some personal recollections. Therein, pp. 395–405. - Wolfram Pohlers. Contributions of the Schütte school in Munich to proof theory. Therein, pp. 406–431. - Stephen G. Simpson. Subsystems of Z2 and reverse mathematics. Therein, pp. 432–446. - Soloman Feferman. Proof theory: a personal report. Therein, pp. 447–485. [REVIEW]Dag Prawitz - 1991 - Journal of Symbolic Logic 56 (3):1094.
Thoralf Skolem. Bemerkungen zum Komprehensionsaxiom. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 3 , pp. 1–17. - C. C. Chang. The axiom of comprehension in infinite valued logic. Mathematica Scandinavica, vol. 13 , pp. 9–30. - Jens Erik Fenstad. On the consistency of the axiom of comprehension in the Łukasiewicz infinite valued logic. Mathematica Scandinavica, vol. 14 , pp. 65–74. - C. C. Chang. Infinite valued logic as a basis for set theory. Logic, methodology and philosophy of science, Proceedings of the 1964 International Congress, edited by Yehoshua Bar-Hillel, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1965, pp. 93–100. [REVIEW]Azriel Lévy - 1967 - Journal of Symbolic Logic 32 (1):128-129.
Ordinal inequalities, transfinite induction, and reverse mathematics.Jeffry L. Hirst - 1999 - Journal of Symbolic Logic 64 (2):769-774.

Analytics

Added to PP
2016-06-30

Downloads
14 (#993,837)

6 months
4 (#1,005,098)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references