{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T16:51:25Z","timestamp":1725382285458},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.29007\/dhz5","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T17:57:34Z","timestamp":1516730254000},"page":"17-0","source":"Crossref","is-referenced-by-count":0,"title":["Tableau Calculus  for Dummett Logic Based on Present and Next State of Knowledge"],"prefix":"10.29007","volume":"2","author":[{"given":"Guido","family":"Fiorino","sequence":"first","affiliation":[]}],"member":"11545","event":{"name":"IWIL 2010. The 8th International Workshop on the Implementation of Logics"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T17:57:35Z","timestamp":1516730255000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/BmZ"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/dhz5","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}