# INSTANTIAL NEIGHBOURHOOD LOGIC

@article{Benthem2016INSTANTIALNL,
title={INSTANTIAL NEIGHBOURHOOD LOGIC},
author={Johan van Benthem and Nick Bezhanishvili and Sebastian Enqvist and Junhua Yu},
journal={The Review of Symbolic Logic},
year={2016},
volume={10},
pages={116 - 144}
}
• Published 19 December 2016
• Computer Science
• The Review of Symbolic Logic
Abstract This paper explores a new language of neighbourhood structures where existential information can be given about what kind of worlds occur in a neighbourhood of a current world. The resulting system of ‘instantial neighbourhood logic’ INL has a nontrivial mix of features from relational semantics and from neighbourhood semantics. We explore some basic model-theoretic behavior, including a matching notion of bisimulation, and give a complete axiom system for which we prove completeness…

### Duality for Instantial Neighbourhood Logic via Coalgebra

• Philosophy
CMCS
• 2020
Instantial Neighbourhood Logic (INL) has been introduced recently as a language for neighbourhood frames where existential information can be given about what kind of worlds occur in a neighbourhood

### A Propositional Dynamic Logic for Instantial Neighborhood Models

• Computer Science
LORI
• 2017
It is shown that a number of game constructors from game logic can be adapted to this setting to ensure invariance for instantial neighborhood bisimulations, which give the appropriate bisimulation concept for INL.

### Sahlqvist Correspondence Theory for Instantial Neighbourhood Logic

In the present paper, we investigate the Sahlqvist-type correspondence theory for instantial neighbourhood logic (INL), which can talk about existential information about the neighbourhoods of a

### Bisimulation for Weakly Expressive Coalgebraic Modal Logics

• Philosophy, Computer Science
CALCO
• 2017
This paper proposes a notion of \Lambda-bisimulation which is parametric in a collection of predicate liftings, and proves a Hennessy-Milner style theorem, which shows that (for finitary functors) \Lamba-bisimilarity exactly matches the expressiveness of the coalgebraic modal logic arising from \L Lambda.

### IPDL : a new modal logic of computation

• Computer Science
• 2017
It is shown that a number of game constructors from game logic can be adapted to this setting to ensure invariance for instantial neighborhood bisimulations, which give the appropriate bisimulation concept for INL.

### A Propositional Dynamic Logic for Instantial Neighborhood Semantics

• Computer Science
Stud Logica
• 2019
This work proposes a new perspective on logics of computation by combining instantial neighborhood logic with bisimulation safe operations adapted from PDL, and proves that the extended logic, IPDL, is a conservative extension of dual-free game logic, and its semantics generalizes the monotone neighborhood semantics of game logic.

### BISIMULATIONS FOR KNOWING HOW LOGICS

• Philosophy, Computer Science
The Review of Symbolic Logic
• 2021
This paper makes the first study of their model theoretical properties by introducing suitable notions of bisimulation for a family of five knowing how knowing how logics based on different notions of plans.

### Socially Friendly and Group Protecting Coalition Logics

• Computer Science
AAMAS
• 2018
Extensions of Coalition Logic which can express statements about inter-related powers of coalitions to achieve their respective goals are considered and two new extensions are introduced and studied.

### A Tableau System for Instantial Neighborhood Logic

• Junhua Yu
• Computer Science, Philosophy
LFCS
• 2018
This paper offers to the INL a tableau system that supports mechanical proof/counter-model search and there is a neighborhood of the current point in which $$\alpha _0$$ universally holds and none of $$\alpha_1,...,\alpha _j$$ universally fails.

## References

SHOWING 1-10 OF 41 REFERENCES

### Neighbourhood Structures: Bisimilarity and Basic Model Theory

• Mathematics
Log. Methods Comput. Sci.
• 2009
An analogue of Van Benthem's characterisation theorem and a model-theoretic proof of Craig interpolation for classical modal logic are proved and a notion of modal saturation for neighbourhood models is introduced, and its relationship with denability and image-niteness is investigated.

### Reasoning About Space: The Modal Way

• Philosophy
J. Log. Comput.
• 2003
This work investigates the topological interpretation of modal logic in modern terms, using a new notion of bisimulation, and presents a new proof of McKinsey and Tarski’s theorem on completeness of S4 with respect to the real line and a completeness proof for the logic of finite unions of convex sets of reals.

### PSPACE Bounds for Rank-1 Modal Logics

• Philosophy, Computer Science
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)
• 2006
All rank-1 logics enjoy a shallow model property and thus are, under mild assumptions on the format of their axiomatization, in PSPACE, which leads to a unified derivation of (known) tight PSPACE-bounds for a number of logics including K, coalition logic, and graded modal logic.

### Monotonic modal logics

• Philosophy
• 2003
Monotonic modal logics form a generalisation of normal modal logics in which the additivity of the diamond modality has been weakened to monotonicity: 3p∨3q → 3(p∨q). This generalisation means that

### FINITE MODELS CONSTRUCTED FROM CANONICAL FORMULAS

• L. Moss
• Mathematics
J. Philos. Log.
• 2007
This paper obtains the weak completeness and decidability results for standard systems of modal logic using models built from formulas themselves and develops a general model-construction method based on this definition.

### DYNAMIC ODDS & ENDS

The logic of guarded fragments of modal logic is developed as a form of process theory, which behaves much like a miniature of firstorder logic in its main system properties (effective axiomatizability, interpolation, preservation results).

### Tableau Methods for Modal and Temporal Logics

This chapter gives a systematic and unified introduction to tableau methods for automating deduction in modal and temporal logics and focuses on the propositional fragments restricted to a two-valued (classical) basis.

### Review: H. Jerome Keisler, Model Theory for Infinitary Logic. Logic with Countable Conjunctions and Finite Quantifiers

(BR) and the Godel-Mal'cev theorem (GM) for propositional calculus (which says that every formally consistent set of formulas is satisfiable). The proof that BR implies GM is only briefly sketched as

### Computation Tree Logic with Deadlock Detection

• Computer Science
Log. Methods Comput. Sci.
• 2009
An extension of CTL-X is proposed, or an alternative treatment of non-totality, that fills this hiatus and the equivalence induced is characterised as branching bisimulation equivalence with explicit divergence, which is shown to be the coarsest congruence contained in divergence sensitive branching bisiccation equivalence.

### Dynamic Logics of Evidence-Based Beliefs

• Philosophy
Stud Logica
• 2011
This paper adds evidence structure to standard models of belief, in the form of families of sets of worlds. We show how these more fine-grained models support natural actions of “evidence