Cut-eliminability in Second Order Logic Calculus

Annals of the Japan Association for Philosophy of Science 27:45-60 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.4288/jafpos.27.0_45

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,748

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

Cut-Elimination in the Intuitionistic Many-Valued Logic Based on a Partial Order.Mitio Takano - 1988 - Annals of the Japan Association for Philosophy of Science 7 (3):117-123.
A Sequent Calculus for the Lesniewskian Modal Logic.Mitio Takano - 1994 - Annals of the Japan Association for Philosophy of Science 8 (4):191-201.
Explanation: From Ethics to Logic.Gilles Dowek - 2023 - Annals of the Japan Association for Philosophy of Science 32:1-16.
Intuitionistic Predicate Calculus with ^|^epsilon;-Symbol.Kokio Shirai - 1971 - Annals of the Japan Association for Philosophy of Science 4 (1):49-67.
Weak Logical Constants and Second Order Definability of the Full-Strength Logical Constants.Mitsuhiro Okada - 1989 - Annals of the Japan Association for Philosophy of Science 7 (4):163-172.
Ontology as a natural extension of predicate calculus with identity equipped with description.Toshiharu Waragai - 1990 - Annals of the Japan Association for Philosophy of Science 7 (5):23-40.
A Survey of Determinacy of Infinite Games in Second Order Arithmetic.Keisuke Yoshii - 2017 - Annals of the Japan Association for Philosophy of Science 25:35-44.
Toshiyasu Arai. Consistency proof via pointwise induction. Archive for mathematical logic, vol. 37 no. 3 , pp. 149–165. [REVIEW]Andreas Weiermann - 2002 - Bulletin of Symbolic Logic 8 (4):536-537.
Maehara Shôji. Cut-elimination theorem concerning a formal system for ramified theory of types which admits quantifications on types. Annals of the Japan Association for Philosophy of Science, vol. 2 no. 2 , pp. 55–64. [REVIEW]Moto-O. Takahashi - 1970 - Journal of Symbolic Logic 35 (2):325-325.

Analytics

Added to PP
2018-11-01

Downloads
29 (#839,596)

6 months
6 (#683,963)

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

Subrecursion: functions and hierarchies.H. E. Rose - 1984 - New York: Oxford University Press.
Syntactical and semantical properties of simple type theory.Kurt Schütte - 1960 - Journal of Symbolic Logic 25 (4):305-326.
Hauptsatz for higher order logic.Dag Prawitz - 1968 - Journal of Symbolic Logic 33 (3):452-457.

View all 6 references / Add more references