A Simplified System Of Sentential Logic

Annales Philosophici 2:35-40 (2011)
  Copy   BIBTEX

Abstract

In thinking about reducing the symbolization of sentential logic to a minimum , where the conditional no longer appears in system, and hence in no proof in the system, one might wonder what would become of the Rule of Conditional Proof. Where this rule is said to be essential for the completeness of the system, some rule or other needs to be developed to do the work of Conditional Proof. The author attempts to accomplish this while specifying a minimum set of rules and axioms for {~, v}

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Refutation Systems for a System of Nonsense-Logic.Robert Sochacki - 2011 - Logic and Logical Philosophy 20 (3):233-239.
Rasiowa-Sikorski proof system for the non-Fregean sentential logic SCI.Joanna Golinska-Pilarek - 2007 - Journal of Applied Non-Classical Logics 17 (4):509–517.
On Conditional Proof in Elementary Logic.Leigh S. Cauman - 2000 - Teaching Philosophy 23 (4):353-357.
A System of Logic Based on Conditional Proof.Stephen Pollard - 1987 - Teaching Philosophy 10 (2):129-134.
Connexive Extensions of Regular Conditional Logic.Yale Weiss - 2019 - Logic and Logical Philosophy 28 (3):611-627.

Analytics

Added to PP
2015-02-07

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references