Logical Methods in Computer Science

0	--	0	Nir Piterman. From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata
0	--	0	Klaus Aehlig. A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
0	--	0	Vladimir Sazonov. Inductive Definition and Domain Theoretic Properties of Fully Abstract Models for PCF and PCF+
0	--	0	Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu. Relating two standard notions of secrecy
0	--	0	Dimitar P. Guelev. Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems
0	--	0	Wojciech Moczydlowski. A Normalizing Intuitionistic Set Theory with Inaccessible Sets
0	--	0	Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger. Algorithms for Omega-Regular Games with Imperfect Information

runs on WebDSL

External Links