Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-13T20:39:45.257Z Has data issue: false hasContentIssue false
  • English
  • Français

Analytic cut

Published online by Cambridge University Press:  12 March 2014

Raymond M. Smullyan
Raymond M. Smullyan*
Affiliation:
Belfer Graduate School of Science, Yeshtva University
Get accessRights & Permissions [Opens in a new window]

Extract

The real importance of cut-free proofs is not the elimination of cuts per se, but rather that such proofs obey the subformula principle. In this paper we accomplish this latter objective in a different manner.

In the usual formulations of Gentzen systems, there is only one axiom scheme; all the other postulates are inference rules. By contrast, we consider here some Gentzen type axiom systems for propositional logic and Quantification Theory in which there is only one inference rule; all the other postulates are axiom schemes. This admits of an unusually elegant axiomatization of logic.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 33 , Issue 4 , January 1969, pp. 560 - 564
Copyright
Copyright © Association for Symbolic Logic 1969

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1]Gentzen, G., Investigations into logical deduction, American philosophical quarterly, vol. 1 (1964).Google Scholar
[2]Kleene, S. C., Introduction to metamathematics. Van Nostrana, Princeton, N.J., 1950.Google Scholar
[3]Quine, W. V., Methods of logic, Henry Holt and Company, Inc., New York, 1959.Google Scholar
[4]Smullyan, R. M., Uniform Gentzen systems, this Journal this issue, pp. 549–559.Google Scholar