From Dialogical Strategies to CTT Demonstrations

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


We now move to the demonstration of the left-to-right direction of the equivalence result. Let us assume that there is a winning \(\mathbf {P}\)-strategy in the dialogical game for \(\varphi \).


Winning Strategy Universal Quantification Natural Deduction Critical Node Elimination Rule 
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.


  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. Rahman, S., N. Clerbout, and L. Keiff. 2009. On dialogues and natural deduction. In Acts of Knowledge: History, Philosophy and Logic: Essays Dedicated to Göran Sundholm, ed. G. Primiero and S. Rahman, 301–336. London: College Publications.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