Computability in Europe 2008
Logic and Theory of Algorithms

Print current page  Print this page

Special Issue JLC

Editors: Arnold Beckmann (Swansea), Benedikt Löwe (Amsterdam)

Journal Webpage: Journal of Logic and Computation

Author Title Pages Status
Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen and Troels Bjerre Sørensen Deterministic Graphical Games Revisited 17 paper accepted
Antonina Kolokolova Expressing vs. proving: relating forms of complexity in logic 17 paper accepted
B. Godlin, E.Katz and J.A. Makowsky Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas 29 paper accepted
Lars Kristiansen Higher Types, Finite Domains and Resource Bounded Turing Machines 27 paper accepted
William Calhoun Triviality and Minimality in the Degrees of Monotone Complexity 11 paper accepted
Amir Ben-Amram, Bruno Loff and Isabel Oitavem Monotonicity conditions over characterisations of PSPACE 18 paper accepted
Paulo Oliva Hybrid functional interpretations of linear logic 24 paper accepted
Diana Ratiu and Trifon Trifonov Exploring the Computational Content of the Infinite Pigeonhole Principle 23 paper accepted
Pantelis E. Eleftheriou, Costas D. Koutras and Christos Nomikos Notions of Bisimulation for Heyting-Valued Modal Languages 27 paper accepted
Michiel De Smet and Andreas Weiermann Sharp thresholds for a phase transition related to weakly increasing sequences 7 paper accepted

websites: Arnold Beckmann 2008-09-08 Valid HTML 4.01! Valid CSS!