Gödel logics and the fully boxed fragment of LTL

13 pages•Published: May 4, 2017

Abstract

In this paper we show that a very basic fragment of FO-LTL, the monadic fully boxed fragment (all connectives and quantifiers are guarded by P) is not recursively enumerable wrt validity and 1-satisfiability if three predicates are present. This result is obtained by reduction of the fully boxed fragment of FO-LTL to the Gödel logic G↓, the infinitely valued Gödel logic with truth values in [0,1] such that all but 0 are isolated. The result on 1-satisfiability is in no way symmetric to the result on validity as in classical logic: this is demonstrated by the analysis of G↑, the related infinitely-valued Gödel logic with truth values in [0, 1] such that all but 1 are isolated. Validity of the monadic fragment with at least two predicates is not recursively enumerable, 1-satisfiability of the monadic fragment is decidable.

Keyphrases: gödel logic, ltl, monadic fragment

In: Thomas Eiter and David Sands (editors). LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 46, pages 404-416.

Links:	https://easychair.org/publications/paper/xfX
	https://doi.org/10.29007/bdbm

BibTeX entry

@inproceedings{LPAR-21:Gödel_logics_fully_boxed,
  author    = {Matthias Baaz and Norbert Preining},
  title     = {Gödel logics and the fully boxed fragment of LTL},
  booktitle = {LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Thomas Eiter and David Sands},
  series    = {EPiC Series in Computing},
  volume    = {46},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/xfX},
  doi       = {10.29007/bdbm},
  pages     = {404-416},
  year      = {2017}}

Download PDF Open PDF in browser