Mathematical Structures in Computer Science, Volume 19

Volume 19, Number 1, February 2009

• Editors' note: bibliometrics and the curators of orthodoxy. 1-4
  
• Jin-yi Cai, S. Barry Cooper, Angsheng Li:
  Preface to Special Issue: Theory and Applications of Models of Computation (TAMC). 5-7
  
• Giordano Fusco, Eric Bach:
  Phase transition of multivariate polynomial systems. 9-23
  
• George Barmpalias, Anthony Morphett:
  Non-cupping, measure and computably enumerable splittings. 25-43
  
• Cristian S. Calude, Ludwig Staiger:
  On universal computably enumerable prefix codes. 45-57
  
• Klaus Weihrauch, Yongcheng Wu, Decheng Ding:
  Absolutely non-computable predicates and functions in analysis. 59-71
  
• Cong Tian, Zhenhua Duan:
  Complexity of propositional projection temporal logic with star. 73-100
  
• Yatao Xu, Tanja Grubba:
  On computably locally compact Hausdorff spaces. 101-117
  
• Iordanis Kerenidis:
  Quantum multiparty communication complexity and circuit lower bounds. 119-132
  
• Bakhadyr Khoussainov, Jiamou Liu, Mia Minnes:
  Unary automatic graphs: an algorithmic perspective. 133-152
  
• Angsheng Li, Weilin Li, Yicheng Pan, Linqing Tang:
  Principal filters definable by parameters in E_bT. 153-167
  
• Mariya Ivanova Soskova, Guohua Wu:
  Cupping Delta₂⁰ enumeration degrees to 0 _e'. 169-191
  
• Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao:
  A note on the feasibility of generalised universal composability. 193-205
  
• Yun Fan:
  The method of the Yu-Ding Theorem and its application. 207-215
  

Volume 19, Number 2, April 2009

• Masahito Hasegawa:
  On traced monoidal closed categories. 217-244
  
• Annegret Habel, Karl-Heinz Pennemann:
  Correctness of high-level transformation systems relative to nested conditions. 245-296
  
• Ugo Dal Lago, Andrea Masini, Margherita Zorzi:
  On a measurement-free quantum lambda calculus with classical control. 297-335
  
• M. Ali-Akbari, B. Honari, M. Pourmahdian, M. M. Rezaii:
  The space of formal balls and models of quasi-metric spaces. 337-355
  
• Robin Cockett, Ernie Manes:
  Boolean and classical restriction categories. 357-416
  
• Benno van den Berg:
  Three extensional models of type theory. 417-434
  

Volume 19, Number 3, June 2009

• Dominique Larchey-Wendling, Didier Galmiche:
  Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding. 435-500
  
• Klaus Keimel, Gordon D. Plotkin:
  Predicate transformers for extended probability and non-determinism. 501-539
  
• Salvador Romaguera, Oscar Valero:
  A quantitative computational model for complete partial metric spaces via formal balls. 541-563
  
• Mario Bravetti, Gianluigi Zavattaro:
  On the expressive power of process interruption and compensation. 565-599
  
• Mario Bravetti, Gianluigi Zavattaro:
  A theory of contracts for strong service compliance. 601-638
  

Volume 19, Number 4, August 2009

• Rasmus Ejlers Møgelberg:
  From parametric polymorphism to models of polymorphic FPC. 639-686
  
• Richard Garner:
  Two-dimensional models of type theory. 687-736
  
• Yun Shang, Xian Lu, Ruqian Lu:
  Automata theory based on unsharp quantum logic. 737-756
  
• Andrej Bauer, Paul Taylor:
  The Dedekind reals in abstract Stone duality. 757-838
  
• Michele Bugliesi, Dario Colazzo, Silvia Crafa, Damiano Macedonio:
  A type system for Discretionary Access Control. 839-875