Intuitionistic Linear Temporal Logics
Author(s) -
Philippe Balbiani,
Joseph Boudou,
Martín Diéguez,
David FernándezDuque
Publication year - 2019
Publication title -
acm transactions on computational logic
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.593
H-Index - 52
eISSN - 1557-945X
pISSN - 1529-3785
DOI - 10.1145/3365833
Subject(s) - decidability , bounded function , class (philosophy) , property (philosophy) , mathematics , temporal logic , order (exchange) , function (biology) , linear temporal logic , discrete mathematics , pure mathematics , algebra over a field , computer science , theoretical computer science , algorithm , artificial intelligence , epistemology , philosophy , mathematical analysis , finance , evolutionary biology , economics , biology
We consider intuitionistic variants of linear temporal logic with “next,” “until,” and “release” based on expanding posets: partial orders equipped with an order-preserving transition function. This class of structures gives rise to a logic that we denote ITLe, and by imposing additional constraints, we obtain the logics ITLp of persistent posets and ITLht of here-and-there temporal logic, both of which have been considered in the literature. We prove that ITLe has the effective finite model property and hence is decidable, while ITLp does not have the finite model property. We also introduce notions of bounded bisimulations for these logics and use them to show that the “until” and “release” operators are not definable in terms of each other, even over the class of persistent posets.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom