First-Order Dialogical Games and Tableaux

Journal of Philosophical Logic 43 (4):785-801 (2014)
  Copy   BIBTEX

Abstract

We present a new proof of soundness/completeness of tableaux with respect to dialogical games in Classical First-Order Logic. As far as we know it is the first thorough result for dialogical games where finiteness of plays is guaranteed by means of what we call repetition ranks

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,164

External links

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

Through your library

Similar books and articles

Modal tableaux for reasoning about diagrams.Luis Fariñas del Cerro & Olivier Gasquet - 2006 - Poznan Studies in the Philosophy of the Sciences and the Humanities 91 (1):169-184.
The Complexity of Analytic Tableaux.Noriko H. Arai, Toniann Pitassi & Alasdair Urquhart - 2006 - Journal of Symbolic Logic 71 (3):777 - 790.
The Ground of Dialogical Bioethics.Abraham Rudnick - 2002 - Health Care Analysis 10 (4):391-402.
Relational dual tableaux for interval temporal logics.David Bresolin, Joanna Golinska-Pilarek & Ewa Orlowska - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):251–277.

Analytics

Added to PP
2013-07-12

Downloads
58 (#264,822)

6 months
10 (#213,340)

Historical graph of downloads
How can I increase my downloads?