Tableau Calculus for Dummett Logic Based on Present and Next State of Knowledge

16 pages•Published: May 15, 2012

Abstract

In this paper we use the Kripke semantics characterization of Dummett logic to introduce a new way of handling non-forced formulas in tableau proof systems. We pursue the aim of reducing the search space by strictly increasing the number of forced propositional variables after the application of non-invertible rules. The focus of the paper is on a new tableau system for Dummett logic, for which we have an implementation. The ideas presented can be extended to intuitionistic logic and intermediate logics as well.

Keyphrases: automated theorem proving, dummett logic, tableau calculi

In: Geoff Sutcliffe, Stephan Schulz and Eugenia Ternovska (editors). IWIL 2010. The 8th International Workshop on the Implementation of Logics, vol 2, pages 17-32.

Links:	https://easychair.org/publications/paper/BmZ
	https://doi.org/10.29007/dhz5

BibTeX entry

@inproceedings{IWIL2010:Tableau_Calculus_Dummett_Logic,
  author    = {Guido Fiorino},
  title     = {Tableau Calculus  for Dummett Logic Based on Present and Next State of Knowledge},
  booktitle = {IWIL 2010. The 8th International Workshop on the Implementation of Logics},
  editor    = {Geoff Sutcliffe and Stephan Schulz and Eugenia Ternovska},
  series    = {EPiC Series in Computing},
  volume    = {2},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/BmZ},
  doi       = {10.29007/dhz5},
  pages     = {17-32},
  year      = {2012}}

Download PDF Open PDF in browser