- 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
Results regarding the axiomatization of partial propositional calculi
Notre Dame Journal of Formal Logic 9 (3):193-211 (1968)
Abstract
This article has no associated abstract. (fix it)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
Results Regarding the Axiomatization of Partial Propositional Calculi.W. E. Singletary - 1971 - Journal of Symbolic Logic 36 (1):172-172.
Review: W. E. Singletary, Results Regarding the Axiomatization of Partial Propositional Calculi. [REVIEW]Ronald Harrop - 1971 - Journal of Symbolic Logic 36 (1):172-172.
Singletary W. E.. Results regarding the axiomatization of partial prepositional calculi. Notre Dame journal of formal logic, vol. 9 no. 3 , pp. 193–211. [REVIEW]Ronald Harrop - 1971 - Journal of Symbolic Logic 36 (1):172-172.
Many-one degrees associated with partial propositional calculi.W. E. Singletary - 1974 - Notre Dame Journal of Formal Logic 15 (2):335-343.
Gentzen-like systems for partial propositional calculi. I.E. William Chapin - 1971 - Notre Dame Journal of Formal Logic 12 (1):75-80.
Gentzen-like systems for partial propositional calculi. II.E. William Chapin - 1971 - Notre Dame Journal of Formal Logic 12 (2):179-182.
On the recursive unsolvability of the provability of the deduction theorem in partial propositional calculi.D. Bollman & M. Tapia - 1972 - Notre Dame Journal of Formal Logic 13 (1):124-128.
The strong decidability of cut-logics. I. Partial propositional calculi.E. William Chapin - 1971 - Notre Dame Journal of Formal Logic 12 (3):322-328.
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. Iséki - 1975 - Journal of Symbolic Logic 40 (3):469.
Generalizability of the propositional and predicate calculi to infinite-valued calculi.Hermann F. Schott - 1970 - Notre Dame Journal of Formal Logic 11 (1):107-128.
Analytics
Added to PP
2010-08-24
Downloads
16 (#906,830)
6 months
3 (#1,209,684)
2010-08-24
Downloads
16 (#906,830)
6 months
3 (#1,209,684)
Historical graph of downloads
Citations of this work
Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi.Evgeny Zolin - 2014 - Studia Logica 102 (5):1021-1039.
On the number of variables in undecidable superintuitionistic propositional calculi.Grigoriy V. Bokov - 2016 - Logic Journal of the IGPL 24 (5).
Alfred Tarski and undecidable theories.George F. McNulty - 1986 - Journal of Symbolic Logic 51 (4):890-898.
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-6686886f5-5pqs9 uwo