Linear Temporal Logic with Non-transitive Time, Algorithms for Decidability and Verification of Admissibility

In Sergei Odintsov (ed.), Larisa Maksimova on Implication, Interpolation, and Definability. Cham, Switzerland: Springer Verlag (2018)
  Copy   BIBTEX

Abstract

We investigate linear temporal logic LTLNT\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathscr {LT L}_{{ NT}}$$\end{document} with non-transitive time and operators NEXT and UNTIL, as well as some possible interpretations of logical knowledge operators in this context. We assume time to be non-transitive, linear and discrete, the former being a major innovative part of this paper. We provide motivation for our approach along with ideas of why we might want to consider time to be non-transitive, and comment on possible interpretations of logical knowledge operators. The main result of Sect. 11.5 is a solution for decidability problem for LTLNT\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathscr {LT L}_{{ NT}}$$\end{document}, for which we describe in details the decision algorithm. In Sect. 11.6 we introduce non-transitive linear temporal logic LTLNT\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathscr {LT L}_{{ NT}}$$\end{document} with uniform bound for non-transitivity. There we also solve the admissibility problem for LTLNT\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathscr {LT L}_{{ NT}}$$\end{document}, that is we provide an algorithm for verifying admissibility of inference rules in LTLNT\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathscr {LT L}_{{ NT}}$$\end{document}. Last section contains description of remaining interesting open problems.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

$$I_0$$ I 0 and combinatorics at $$\lambda ^+$$ λ +.Nam Trang & Xianghui Shi - 2017 - Archive for Mathematical Logic 56 (1-2):131-154.
Hard Provability Logics.Mojtaba Mojtahedi - 2021 - In Mojtaba Mojtahedi, Shahid Rahman & MohammadSaleh Zarepour (eds.), Mathematics, Logic, and their Philosophies: Essays in Honour of Mohammad Ardeshir. Springer. pp. 253-312.
Two-cardinal diamond and games of uncountable length.Pierre Matet - 2015 - Archive for Mathematical Logic 54 (3-4):395-412.
Peter Fishburn’s analysis of ambiguity.Mark Shattuck & Carl Wagner - 2016 - Theory and Decision 81 (2):153-165.

Analytics

Added to PP
2019-01-28

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references