dummett logic
Recently Published Documents


TOTAL DOCUMENTS

17
(FIVE YEARS 1)

H-INDEX

5
(FIVE YEARS 0)

Author(s):  
Gemma Robles ◽  
José M. Méndez

Let \(A_{0},A_{1},...,A_{n}\) be (possibly) distintict wffs, \(n\) being an odd number equal to or greater than 1. Intuitionistic Propositional Logic IPC plus the axiom \((A_{0}\rightarrow A_{1})\vee ...\vee (A_{n-1}\rightarrow A_{n})\vee (A_{n}\rightarrow A_{0})\) is equivalent to Gödel-Dummett logic LC. However, if \(n\) is an even number equal to or greater than 2, IPC plus the said axiom is a sublogic of LC.



2018 ◽  
Vol 59 (2) ◽  
pp. 368-374
Author(s):  
A. D. Yashin ◽  
A. G. Makarov
Keyword(s):  


10.29007/dhz5 ◽  
2018 ◽  
Author(s):  
Guido Fiorino

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.



10.29007/mbbq ◽  
2018 ◽  
Author(s):  
Guido Fiorino

We present a procedure to decide propositional Dummett logic. Such a procedure relies on a tableau calculus with a multiple premise rule and optimizations. The resulting implementation outperforms the state of the art graph-based procedure.







Author(s):  
Ewa Orłowska ◽  
Joanna Golińska-Pilarek
Keyword(s):  


Sign in / Sign up

Export Citation Format

Share Document