- 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 simple strong completeness proof for sentential logic
Notre Dame Journal of Formal Logic 21 (1):179-181 (1980)
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
A simple proof of functional completeness in many-valued logics based on Ł ukasiewicz's $C$ and $N$.Robert E. Clay - 1962 - Notre Dame Journal of Formal Logic 3 (2):114-117.
A new proof of completeness.R. L. Goodstein - 1972 - Notre Dame Journal of Formal Logic 13 (4):563-564.
A completeness proof for $C$-calculus.H. Hiż - 1973 - Notre Dame Journal of Formal Logic 14 (2):253-258.
A strong completeness theorem for $3$-valued logic. [REVIEW]H. Goldberg, H. Leblanc & G. Weaver - 1974 - Notre Dame Journal of Formal Logic 15 (2):325-330.
A note on the completeness proof for natural deduction.David W. Bennett - 1977 - Notre Dame Journal of Formal Logic 18 (1):145-146.
Errata: ``A completeness proof for $C$-calculus''.H. Hiż - 1976 - Notre Dame Journal of Formal Logic 17 (4):640-640.
An elementary completeness proof for a system of natural deduction.David W. Bennett - 1973 - Notre Dame Journal of Formal Logic 14 (3):430-432.
Henkin's completeness proof: forty years later.Hugues Leblanc, Peter Roeper, Michael Thau & George Weaver - 1991 - Notre Dame Journal of Formal Logic 32 (2):212-232.
A Simple Proof of Arithmetical Completeness for $\Pi_1$ -Conservativity Logic.Giorgi Japaridze - 1994 - Notre Dame Journal of Formal Logic 35 (3):346-354.
A strong completeness theorem for 3-valued logic. Part II.Hugues Leblanc - 1977 - Notre Dame Journal of Formal Logic 18:107.
Analytics
Added to PP
2010-08-24
Downloads
22 (#166,999)
6 months
5 (#1,552,255)
2010-08-24
Downloads
22 (#166,999)
6 months
5 (#1,552,255)
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-6686886f5-2nz2h uwo