- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A generalization of the Gentzen Hauptsatz
Notre Dame Journal of Formal Logic 12 (4):499-504 (1971)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Luis E. Sanchis. Types in combinatory logic. Notre Dame journal of formal logic, vol. 5 no. 3 , pp. 161–180.Jean Ladriere - 1967 - Journal of Symbolic Logic 32 (3):420-421.
Gentzen systems for modal logic.Louis F. Goble - 1974 - Notre Dame Journal of Formal Logic 15 (3):455-461.
The Gentzen-Kripke construction of the intermediate logic LQ.Seiki Akama - 1991 - Notre Dame Journal of Formal Logic 33 (1):148-153.
Gentzen systems, resolution, and literal trees.Daniel J. Dougherty - 1986 - Notre Dame Journal of Formal Logic 27 (4):483-503.
Gentzen-like systems for partial propositional calculi. II.E. William Chapin - 1971 - Notre Dame Journal of Formal Logic 12 (2):179-182.
Gentzen-like systems for partial propositional calculi. I.E. William Chapin - 1971 - Notre Dame Journal of Formal Logic 12 (1):75-80.
E. William ChapinJr., Gentzen-like systems for partial propositional calculi. Notre Dame journal of formal logic, vol. 12 , pp. 75–80, and pp. 179–182. [REVIEW]K. Iseki - 1975 - Journal of Symbolic Logic 40 (3):469.
Generalization of a result of Halldén.Robert V. Kohn - 1975 - Notre Dame Journal of Formal Logic 16 (4):605-606.
A generalization of combinatorial operators.Anna Silverstein - 1978 - Notre Dame Journal of Formal Logic 19 (4):639-645.
A simple generalization of Turing computability.William J. Thomas - 1979 - Notre Dame Journal of Formal Logic 20 (1):95-102.
Analytics
Added to PP
2010-08-24
Downloads
32 (#705,389)
6 months
10 (#404,653)
2010-08-24
Downloads
32 (#705,389)
6 months
10 (#404,653)
Historical graph of downloads
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-559df78dcc-g6qm9 uwo