A Hybrid Treatment of Evolutionary Sets

This paper is about a synthesis of two quite different modal reasoning formalisms: the logic of subset spaces, and hybrid logic. Going beyond commonly considered languages we introduce names of objects involving sets and corresponding satisfaction operators, thus increase the expressive power to a large extent. The motivation for our approach is to logically model some general notions from topology like closeness, separation, and linearity, which are of fundamental relevance to spatial or temporal frameworks; in other words, since these notions represent basic properties of space and time we want them to be available to corresponding formal reasoning. We are interested in complete axiomatizations and effectivity properties of the associated logical systems, in particular.

[1]  Bernhard Heinemann,et al.  About the temporal decrease of sets , 2001, Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001.

[2]  Patrick Blackburn,et al.  Representation, Reasoning, and Relational Structures: a Hybrid Logic Manifesto , 2000, Log. J. IGPL.

[3]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[4]  Lawrence S. Moss,et al.  Topological Reasoning and the Logic of Knowledge , 1996, Ann. Pure Appl. Log..

[5]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[6]  Konstantinos Georgatos,et al.  Knowledge on Treelike Spaces , 1997, Stud Logica.

[7]  Patrick Blackburn,et al.  Hybrid Languages and Temporal Logic , 1999, Log. J. IGPL.

[8]  Maarten Marx,et al.  Multi-dimensional modal logic , 1997, Applied logic series.

[9]  Bernhard Heinemann Linear Tense Logics of Increasing Sets , 2002, J. Log. Comput..

[10]  Rohit Parikh,et al.  Completeness of Certain Bimodal Logics for Subset Spaces , 2002, Stud Logica.

[11]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[12]  Maarten Marx,et al.  A Road-Map on Complexity for Hybrid Logics , 1999, CSL.

[13]  Patrick Blackburn,et al.  Internalizing labelled deduction , 2000, J. Log. Comput..