Advertisement

Building a Winning \(\mathbf {P}\)-strategy Out of a CTT Demonstration

  • Nicolas ClerboutEmail author
  • Shahid Rahman
Chapter
  • 430 Downloads
Part of the SpringerBriefs in Philosophy book series (BRIEFSPHILOSOPH)

Abstract

In this brief chapter we will consider the other direction of the equivalence result between the valid fragments of the CTT framework and the dialogical framework. That is, we will show that if there is a CTT demonstration for \(\varphi \) then there is a winning \(\mathbf {P}\)-strategy in the dialogical game for \(\varphi \).

Keywords

Identical Posit Elimination Rule Introduction Rule Translation Procedure Elementary Expression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Clerbout, N. 2014a. First-order dialogical games and tableaux. Journal of Philosophical Logic 43(4): 785–801. [Published first online 2013. doi: 10.1007/s10992-013-9289-z].
  2. Clerbout, N. 2014b. La Sémantique Dialogique. Notions Fondamentales et Éléments de Metathéorie. London: College Publications.Google Scholar
  3. Felscher, W. 1985. Dialogues as a foundation for intuitionistic logic. In Handbook of Philosophical Logic, vol. 3, ed. D. Gabbay and F. Guenthner, 341–372. Dordrecht: Kluwer.Google Scholar

Copyright information

© The Author(s) 2015

Authors and Affiliations

  1. 1.Instituto de Filosofía; CDHACSUniversidad de ValparaísoValparaísoChile
  2. 2.UMR-CNRS 8163: STLUniversity of Lille IIIVilleneuve d’AscqFrance

Personalised recommendations