Basic Model Theory for Memory Logics

Areces, Carlos; Carreiro, Facundo; Figueira, Santiago; Mera, Sergio

doi:10.1007/978-3-642-20920-8_8

Cited by 4 publications

(7 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proof is an immediate consequence of Corollary 12.35 (2), Fact 12.26, and Propositions 12.45 and 12.11 (10) and (11). Proof.…”

Section: Example 915 (All Rules Persistent Switching Reaction Rules)mentioning

confidence: 80%

“…11 t dependent on the route leading to t. Thus we get a new kind of semantics, the reactive semantics. Fault modality can have arrow-to-arrow deletions on many levels.…”

Section: J Van Benthem's Sabotage Modal Logicmentioning

confidence: 99%

“…• in memory logics one may keep the information that a certain world was visited, adding it to the memory of the model [11]; • in hyper-modalities the meaning of the modal operators depends on where in the formula they occur [69]; • in product logics one may think that while moving along one direction the valuation of the remaining hyper-plan is changing, for example modelling valuation change in time if that direction is a time flow [70].…”

Section: Changing Kripke Structuresmentioning

confidence: 99%

See 2 more Smart Citations

Reactive Kripke Semantics

Gabbay

2013

Cognitive Technologies

View full text Add to dashboard Cite

“…The proof is an immediate consequence of Corollary 12.35 (2), Fact 12.26, and Propositions 12.45 and 12.11 (10) and (11). Proof.…”

Section: Example 915 (All Rules Persistent Switching Reaction Rules)mentioning

confidence: 80%

“…11 t dependent on the route leading to t. Thus we get a new kind of semantics, the reactive semantics. Fault modality can have arrow-to-arrow deletions on many levels.…”

Section: J Van Benthem's Sabotage Modal Logicmentioning

confidence: 99%

Section: Changing Kripke Structuresmentioning

confidence: 99%

See 1 more Smart Citation

Reactive Kripke Semantics

Gabbay

2013

Cognitive Technologies

View full text Add to dashboard Cite

“…4 we see how these new arrows can represent a classical inheritance networks case. Figure 4: A classical inheritance networks example.…”

Section: Introductionmentioning

confidence: 95%

“…• in memory logics one may keep the information that a certain world was visited, adding it to the memory of the model [4];…”

Section: Introductionmentioning

confidence: 99%

Global View on Reactivity: Switch Graphs and their Logics

Gabbay

2013

Reactive Kripke Semantics

View full text Add to dashboard Cite

The notion of reactive graph generalises the one of graph by allowing the base accessibility relation to change when its edges are traversed. Can we represent these more general structures using points and arrows? We prove this can be done by introducing higher order arrows: the switches.The possibility of expressing the dependency of the future states of the accessibility relation on individual transitions by the use of higher-order relations, that is, coding meta-relational concepts by means of relations, strongly suggests the use of modal languages to reason directly about these structures. We introduce a hybrid modal logic for this purpose and prove its completeness.

show abstract

Graph Games and Logic Design

Benthem

Liu

2020

Knowledge, Proof and Dynamics

View full text Add to dashboard Cite

Graph games are interactive scenarios with a wide range of applications. This position paper discusses old and new graph games in tandem with matching logics, and identifies general questions behind this match. Throughout, we pursue two strands: logic as a way of analyzing existing games, and logic as an inspiration for designing new games. Our aim is modest: we propose a style of thinking that complements existing gametheoretic and computational ones, we raise questions, make observations, and suggest research directions-technical results are left to future work. But frankly, our main aim with this survey paper is to show that graph games are concrete, fun, easy to grasp, and yet challenging to study. 1 Two graph games Graph games are played on graphs, directed or undirected, with one or many relations, perhaps with annotations at vertices. This setting may seem specialized-but the scope of these games is broad, with applications to computation, argumentation, communication, social networks, warfare, and other scenarios. To introduce our perspective, we start with two concrete examples. For general background on logic and games presupposed in this paper, we refer to [10], [13].

show abstract

Basic Model Theory for Memory Logics

Cited by 4 publications

References 7 publications

Reactive Kripke Semantics

Reactive Kripke Semantics

Global View on Reactivity: Switch Graphs and their Logics

Graph Games and Logic Design

Contact Info

Product

Resources

About