Independence: Logics and Concurrency

We consider Hintikka et al.'s 'independence-friendly first-order logic'. We apply it to a modal logic setting, defining a notion of 'independent' modal logic, and we examine the associated fixpoint logics.

[1]  Julian C. Bradfield.  The Modal µ-Calculus Alternation Hierarchy is Strict , 1998, Theor. Comput. Sci..

[2]  Kenneth L. McMillan,et al.  Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.

[3]  Wilfrid Hodges,et al.  Compositional Semantics for a Language of Imperfect Information , 1997, Log. J. IGPL.

[4]  Wojciech Penczek,et al.  Traces and Logic , 1995, The Book of Traces.

[5]  K. Jon Barwise,et al.  On branching quantifiers in English , 1979, J. Philos. Log..

[6]  H. Andersen.  Verification of Temporal Properties of Concurrent Systems , 1993 .

[7]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[8]  Douglas A. Cenzer,et al.  Monotone inductive definitions over the continuum , 1976, Journal of Symbolic Logic (JSL).

[9]  H. Enderton.  Finite Partially-Ordered Quantifiers , 1970 .

[10]  David Walker,et al.  A General Tableau Technique for Verifying Temporal Properties of Concurrent Programs , 1990 .

[11]  Wilbur John Walkoe,et al.  Finite Partially-Ordered Quantification , 1970, J. Symb. Log..

[12]  Antti Valmari.  A stubborn attack on state explosion , 1992, Formal Methods Syst. Des..

[13]  Georg Gottlob,et al.  Relativized logspace and generalized quantifiers over finite ordered structures , 1997, Journal of Symbolic Logic.

[14]  Julian C. Bradfield.  Fixpoint alternation: Arithmetic, transition systems, and the binary tree , 1999, RAIRO Theor. Informatics Appl..

[15]  Peter Niebert,et al.  Verification Based on Local States , 1998, TACAS.

[16]  Wojciech Penczek.  On Undecidability of Propositional Temporal Logics on Trace Systems , 1992, Inf. Process. Lett..

[17]  Andreas Blass,et al.  Henkin quantifiers and complete problems , 1986, Ann. Pure Appl. Log..

[18]  J. Hintikka.  A Revolution in Logic , 1998 .

[19]  Mogens Nielsen,et al.  Bisimulations, Games, and Logic , 1994 .

[20]  Robert S. Lubarsky.  μ-definable sets of integers , 1993, Journal of Symbolic Logic.

[21]  Gabriel Sandu,et al.  On the logic of informational independence and its applications , 1993, J. Philos. Log..

[22]  Julian C. Bradfield.  Fixpoint Alternation and the Game Quantifier , 1999, CSL.