- 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
Modal Provability Foundations for Argumentation Networks
Studia Logica 93 (2-3):147-180 (2009)
Abstract
Given an argumentation network we associate with it a modal formula representing the ‘logical content’ of the network. We show a one-to-one correspondence between all possible complete Caminada labellings of the network and all possible models of the formula.Author Profiles
My notes
Similar books and articles
A proof-theoretic treatment of λ-reduction with cut-elimination: λ-calculus as a logic programming language.Michael Gabbay - 2011 - Journal of Symbolic Logic 76 (2):673 - 699.
The Role of Quantifier Alternations in Cut Elimination.Philipp Gerhardy - 2005 - Notre Dame Journal of Formal Logic 46 (2):165-171.
Non-effective Quantifier Elimination.Mihai Prunescu - 2001 - Mathematical Logic Quarterly 47 (4):557-562.
Quantifier Elimination and Other Model-Theoretic Properties of BL-Algebras.Tommaso Cortonesi, Enrico Marchioni & Franco Montagna - 2011 - Notre Dame Journal of Formal Logic 52 (4):339-379.
Quantifier Elimination for a Class of Intuitionistic Theories.Ben Ellison, Jonathan Fleischmann, Dan McGinn & Wim Ruitenburg - 2008 - Notre Dame Journal of Formal Logic 49 (3):281-293.
Quantifier elimination in valued Ore modules.Luc Bélair & Françoise Point - 2010 - Journal of Symbolic Logic 75 (3):1007-1034.
Quantifier elimination for the theory of algebraically closed valued fields with analytic structure.Yalin Firat Çelikler - 2007 - Mathematical Logic Quarterly 53 (3):237-246.
Quantifier elimination for neocompact sets.H. Jerome Keisler - 1998 - Journal of Symbolic Logic 63 (4):1442-1472.
Characterizing Definability of Second-Order Generalized Quantifiers.Juha Kontinen & Jakub Szymanik - 2011 - In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
Dung’s Argumentation is Essentially Equivalent to Classical Propositional Logic with the Peirce–Quine Dagger.Dov M. Gabbay - 2011 - Logica Universalis 5 (2):255-318.
Analytics
Added to PP
2014-03-11
Downloads
6 (#1,454,046)
6 months
3 (#967,057)
2014-03-11
Downloads
6 (#1,454,046)
6 months
3 (#967,057)
Historical graph of downloads
Author Profiles
Citations of this work
A Logical Account of Formal Argumentation.Martin W. A. Caminada & Dov M. Gabbay - 2009 - Studia Logica 93 (2-3):109-145.
Semantics for Higher Level Attacks in Extended Argumentation Frames Part 1: Overview.Dov M. Gabbay - 2009 - Studia Logica 93 (2-3):357 - 381.
Semantics for Higher Level Attacks in Extended Argumentation Frames Part 1: Overview.Dov M. Gabbay - 2009 - Studia Logica 93 (2-3):357-381.
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-55b469568f-jnntz uwo