The decision problem for linear temporal logic.

Burgess, John P.; Gurevich, Yuri

doi:10.1305/ndjfl/1093870820

Cited by 60 publications

(66 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sources include [11,18,3]. Taken further, this becomes an extremely powerful model-theoretic method and we cite [16,22,7,5,17] as further reading.…”

Section: Construction Of Linear Modelsmentioning

confidence: 99%

Simple completeness proofs for some spatial logics of the real line

Hodkinson

2013

Proceedings of the 12th Asian Logic Conference

View full text Add to dashboard Cite

show abstract

“…Sources include [11,18,3]. Taken further, this becomes an extremely powerful model-theoretic method and we cite [16,22,7,5,17] as further reading.…”

Section: Construction Of Linear Modelsmentioning

confidence: 99%

Simple completeness proofs for some spatial logics of the real line

Hodkinson

2013

Proceedings of the 12th Asian Logic Conference

View full text Add to dashboard Cite

show abstract

“…In the previous chapter [Burgess, 2001], we saw a brief survey of the motivations for developing a tense logic. There are particular reasons for concentrating on the logic US / LT.…”

Section: Uses Of Us/ltmentioning

confidence: 99%

“…The system, which we will call Ax(U, S), was first presented in [Burgess, 1982] but was later simplified slightly in [Xu, 1988]. It has what are the usual inference rules for a temporal logic: i.e.…”

Section: An Axiomatization For the Logicmentioning

confidence: 99%

See 1 more Smart Citation

Advanced Tense Logic

Finger

Gabbay

Reynolds

2002

Handbook of Philosophical Logic

View full text Add to dashboard Cite

“…Nowadays, they belong to the standard repertoire of temporal logics in computer science; see [39]. A bisimulation variant which characterizes this language over arbitrary models was found by Kurtonina & de Rijke [36]; for some decidability results over classes of linear flows of time, see Burgess & Gurevich [12]. Our Theorem 7.4.8 and its proof are based on results and proofs related to the loosely guarded fragment that are due to van Benthem.…”

Section: Notesmentioning

confidence: 99%

Local Variations on a Loose Theme: Modal Logic and Decidability

Marx

Venema

Finite Model Theory and Its Applications

View full text Add to dashboard Cite

This chapter is about decidability and complexity issues in modal logic; more specifically, we confine ourselves to satisfiability (and the complementary validity) problems. The satisfiability problem is the following: for a fixed class of models, to determine whether a given formula ϕ is satisfiable in some model of that class (a more precise definition will follow). The general picture is that modal logic behaves quite well in this respect. In fact, many authors follow Vardi [58] in calling modal logic robustly decidable on the ground that most of the nice computational properties of modal logic are preserved if one considers extensions or variants of the basic system. The main aim of this chapter is to refine and analyze this picture.To start with, we should clarify what we are talking about when using the term "modal logic". Traditionally, propositional modal logic would be described as an extension of propositional logic with operators 2 and 3 for talking about the necessity and possibility of a formula being true. However, nowadays the term "modal logic" is used for a plethora of formalisms, with applications in various disciplines ranging from linguistics to economics, see [11,17,39,56] for a sample of applications in computer science.And while (propositional) modal logics will usually still be an extension of classical propositional logic with a number of modal operators, the intended meanings of these operators differ enormously. For instance, the formula 2 a ϕ could mean "player a knows that ϕ is the case" in a formalization of game theory, or "after the execution of program a, ϕ will be the case" in a formal language for program verification. Fortunately, on a technical level, all these formalisms still have a lot in common. That is why this chapter first introduces the notion of a modal system as a triple consisting of a (propositional) modal language, a class of models and a truth function. This definition covers most of the systems that appear in the literature under the name "modal logic"; in particular, the familiar system of basic modal logic, to be discussed in section 7.3.

show abstract

The decision problem for linear temporal logic.

Cited by 60 publications

References 12 publications

Simple completeness proofs for some spatial logics of the real line

Simple completeness proofs for some spatial logics of the real line

Advanced Tense Logic

Local Variations on a Loose Theme: Modal Logic and Decidability

Contact Info

Product

Resources

About