College Publications logo   College Publications title  
View Basket
Homepage Contact page
   
 
AiML
Algorithmics
Cadernos de Lógica e Computação
Cadernos de Lógica e Filosofia
Cahiers de Logique et d'Epistemologie
Communication, Mind and Language
Computing
Cuadernos de lógica, Epistemología y Lenguaje
DEON
Dialogues
Economics
Encyclopaedia of Logic
Filosofia
Handbooks
IfColog series in Computational Logic
IfColog Lecture series
IfColog Proceedings
Journals
Journal of Applied Logics - IfCoLoG Journal of Logics and their Applications
About
Editorial Board
Scope of the Journal
Submissions
Forthcoming papers
Law and Society
Logic PhDs
Logic, Methodology and Philosophy of Science
The Logica Yearbook
Neural Computing and Artificial Intelligence
Philosophy
Research
The SILFS series
Studies in Logic
Studies in Talmudic Logic
Systems
Texts in Mathematics
Tributes
Other
Digital Downloads
Information for authors
About us
Search for Books
 



Forthcoming papers


Back

Succinctness in Subsystems of the Spatial mu-calculu

David Fernández-Duque and Petar Iliev

In this paper we systematically explore questions of succinctness in modal logics employed in spatial reasoning.
We show that the closure operator, despite being less expressive, is exponentially more succinct than the limit-point operator, and that the $mu$-calculus is exponentially more succinct than the equally-expressive tangled limit operator. These results hold for any class of spaces containing at least one crowded metric space or containing all spaces based on ordinals below $omega^omega$, with the usual limit operator. We also show that these results continue to hold even if we enrich the less succinct language with the universal modality.

February 2018






© 2005–2018 College Publications / VFH webmaster