- 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 note on finite axiomatization of partial propositional calculi
Journal of Symbolic Logic 32 (3):352-354 (1967)
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
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.
Results regarding the axiomatization of partial propositional calculi.W. E. Singletary - 1968 - Notre Dame Journal of Formal Logic 9 (3):193-211.
On Some Method Of Axiomatization Of Some Propositional Calculi.Zdzislaw Dywan - 1986 - Bulletin of the Section of Logic 15 (2):52-56.
On the Existence of Finite Models and Decision Procedures for Propositional Calculi.R. Harrop - 1960 - Journal of Symbolic Logic 25 (2):180-181.
A note on some intermediate propositional calculi.Branislav R. Boričić - 1984 - Journal of Symbolic Logic 49 (2):329-333.
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.
A note on the deductive completeness of m-valued propositional calculi.J. B. Rosser & A. R. Turquette - 1949 - Journal of Symbolic Logic 14 (4):219-225.
Analytics
Added to PP
2009-01-28
Downloads
46 (#484,404)
6 months
17 (#177,808)
2009-01-28
Downloads
46 (#484,404)
6 months
17 (#177,808)
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.
Translations and structure for partial propositional calculi.E. William Chapin - 1974 - Studia Logica 33 (1):35-57.
References found in this work
A detailed argument for the Post-Linial theorems.Mary Katherine Yntema - 1964 - Notre Dame Journal of Formal Logic 5 (1):37-50.
The Post-Lineal theorems for arbitrary recursively enumerable degrees of unsolvability.Ann H. Ihrig - 1965 - Notre Dame Journal of Formal Logic 6 (1):54-72.
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-648784bb4d-72rpk uwo