Theoretical Computer Science (forthcoming)
Authors |
|
Abstract |
In this paper we provide a proof theoretical investigation of logical argumentation, where arguments are represented by sequents, conflicts between arguments are represented by sequent elimination rules, and deductions are made by dynamic proof systems extending standard sequent calculi. The idea is to imitate argumentative movements in which certain claims are introduced or withdrawn in the presence of counter-claims. This is done by a dynamic evaluation of sequences of sequents, in which the latter are considered ‘derived’ or ‘not derived’ according to the content of the sequence. We show that decisive conclusions of such a process correspond to well-accepted consequences of the underlying argumentation framework. The outcome is therefore a general and modular proof-theoretical approach for paraconsistent and non-monotonic reasoning with argumentation systems.
|
Keywords | Logical argumentation Sequent calculi Dynamic derivations |
Categories | (categorize this paper) |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
No references found.
Citations of this work BETA
A Generalized Proof-Theoretic Approach to Logical Argumentation Based on Hypersequents.AnneMarie Borg, Christian Straßer & Ofer Arieli - 2021 - Studia Logica 109 (1):167-238.
Similar books and articles
Sequent-Based Logical Argumentation.Ofer Arieli & Christian Straßer - 2015 - Argument and Computation 6 (1):73-99.
Dynamic Derivations for Sequent-Based Logical Argumentation.Ofer Arieli & Christian Straßer - 2014 - In Simon Parsons, Nir Oren, Chris Reed & Federico Cerutti (eds.), Proceedings COMMA 2014. IOS Press. pp. 89--100.
Deductive Argumentation by Enhanced Sequent Calculi and Dynamic Derivations.Ofer Arieli & Christian Straßer - 2016 - Electronic Notes in Theoretical Computer Science 323:21–37.
Proof Theory for Positive Logic with Weak Negation.Marta Bílková & Almudena Colacito - 2020 - Studia Logica 108 (4):649-686.
Cut-Elimination and Proof-Search for Bi-Intuitionistic Logic Using Nested Sequents.Rajeev Goré, Linda Postniece & Alwen Tiu - 2008 - In Carlos Areces & Robert Goldblatt (eds.), Advances in Modal Logic, Volume 7. CSLI Publications. pp. 43-66.
Normative Reasoning by Sequent-Based Argumentation.Christian Straßer & Ofer Arieli - 2015 - Journal of Logic and Computation 29 (3):387-415.
Gentzen's Proof Systems: Byproducts in a Work of Genius.Jan von Plato - 2012 - Bulletin of Symbolic Logic 18 (3):313-367.
An Ecumenical Notion of Entailment.Elaine Pimentel, Luiz Carlos Pereira & Valeria de Paiva - forthcoming - Synthese:1-23.
Simple Cut Elimination Proof for Hybrid Logic.Andrezj Indrzejczak - 2016 - Logic and Logical Philosophy 25 (2):129-141.
A Survey of Nonstandard Sequent Calculi.Andrzej Indrzejczak - 2014 - Studia Logica 102 (6):1295-1322.
Sequents for Non-Wellfounded Mereology.Paolo Maffezioli - 2016 - Logic and Logical Philosophy 25 (3):351-369.
Partial and Paraconsistent Three-Valued Logics.Vincent Degauquier - 2016 - Logic and Logical Philosophy 25 (2):143-171.
Modular Sequent Calculi for Classical Modal Logics.David R. Gilbert & Paolo Maffezioli - 2015 - Studia Logica 103 (1):175-217.
A Simulation of Natural Deduction and Gentzen Sequent Calculus.Daniil Kozhemiachenko - 2018 - Logic and Logical Philosophy 27 (1):67-84.
Analytics
Added to PP index
2020-01-31
Total views
5 ( #1,138,129 of 2,410,766 )
Recent downloads (6 months)
1 ( #538,938 of 2,410,766 )
2020-01-31
Total views
5 ( #1,138,129 of 2,410,766 )
Recent downloads (6 months)
1 ( #538,938 of 2,410,766 )
How can I increase my downloads?
Downloads