Paper Info
Title
Refutation in dummett logic using a sign to express the truth at the next possible world
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 noninvertible rules. The focus of the paper is on a new tableau system for Dummett logic, for which we have an implementation.
Year
DOI
Venue
2011
10.5591/978-1-57735-516-8/IJCAI11-151
IJCAI
Keywords
Field
DocType
Kripke semantics characterization,Dummett logic,next possible world,tableau proof system,dummett logic,search space,forced propositional variable,non-forced formula,new tableau system,noninvertible rule
Discrete mathematics,Kripke semantics,Computer science,Propositional variable,Possible world
Conference
Citations 
PageRank 
References 
2
0.40
10
Authors
1
Name
Order
Citations
PageRank
Guido Fiorino19712.71