On Argumentation Logic and Propositional Logic

Studia Logica 106 (2):237-279 (2018)
  Copy   BIBTEX

Abstract

This paper studies the relationship between Argumentation Logic, a recently defined logic based on the study of argumentation in AI, and classical Propositional Logic. In particular, it shows that AL and PL are logically equivalent in that they have the same entailment relation from any given classically consistent theory. This equivalence follows from a correspondence between the non-acceptability of sentences in AL and Natural Deduction proofs of the complement of these sentences. The proof of this equivalence uses a restricted form of ND proofs, where hypotheses in the application of the Reductio of Absurdum inference rule are required to be “relevant” to the absurdity derived in the rule. The paper also discusses how the argumentative re-interpretation of PL could help control the application of ex-falso quodlibet in the presence of inconsistencies.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 104,026

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2017-07-19

Downloads
43 (#566,870)

6 months
6 (#698,684)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

References found in this work

Untersuchungen über das logische Schließen. I.Gerhard Gentzen - 1935 - Mathematische Zeitschrift 35:176–210.
[Omnibus Review].Dag Prawitz - 1991 - Journal of Symbolic Logic 56 (3):1094-1096.
Minimally inconsistent LP.Graham Priest - 1991 - Studia Logica 50 (2):321 - 331.
The computational complexity of ideal semantics.Paul E. Dunne - 2009 - Artificial Intelligence 173 (18):1559-1591.

View all 10 references / Add more references