vix.ing · top · new · best · stats

A Godel Modal Logic

2009/03/16 by Xavier Caicedo, Caicedo, Xavier, Ricardo Óscar Rodríguez +2
Computer Science · Mathematics · #03B45 #03B50 #Advanced Algebra and Logic #FOS: Mathematics #Logic (math.LO) #Logic, Reasoning, and Knowledge #math.LO #msc:03B45 #msc:03B50 #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.0903.2767

arxiv created 2009/03/16 · openalex publication_date 2009/03/16 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we consider an approach where both propositions and the accessibility relation are infinitely many-valued over Gödel algebras. In particular, we consider separately the \Box -fragment and the \Diamond -fragment of our Gödel modal logic and prove that both logics are complete with respect to the class of models with values in the linear Hetying algebra [0,1]. In addition, we show that the first fragment is uniquely determined by the class of models having crisp accessibility relation but it has not the finite model property. On the contrary, the second fragment is not characterized by crisp accessibility models alone but it has the finite model property. Finally, we show that the approach can be extended to include finitely many rational truth-values à la Pavelka.

Related