Logical Methods in Computer Science

1.	O-Minimal Hybrid Reachability Games
	Patricia Bouyer, Thomas Brihaye and Fabrice Chevalier


2.	A Graph Model for Imperative Computation
	Guy Andrew McCusker


3.	Bifinite Chu Spaces
	Manfred Droste and Guo-Qiang Zhang


4.	Guarded Second-Order Logic, Spanning Trees, and Network Flows
	Achim Blumensath


5.	Weighted Logics for Nested Words and Algebraic Formal Power Series
	Christian Mathissen


6.	On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
	Bernard Boigelot, Julien Brusten and Véronique Bruyère


7.	Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
	Jeroen Ketema and Jakob Grue Simonsen