First-orther dialogical games and tableaux

• Autores: Nicolas Clerbout
• Localización: Journal of Philosophical Logic, ISSN-e 1573-0433, Vol. 43, Nº. 4, 2014, págs. 785-801
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.