Journal of Logic and Computation

Original Articles

• Select this article
  • Daniel Andersson,
  • Kristoffer Arnsfelt Hansen,
  • Peter Bro Miltersen,
  • and Troels Bjerre Sørensen

  Deterministic Graphical Games Revisited

  J Logic Computation (2012) 22(2): 165-178 first published online February 9, 2010 doi:10.1093/logcom/exq001
  • Abstract
  • Full Text (PDF)
  • References
• Select this article
  • Amir M. Ben-Amram,
  • Bruno Loff,
  • and Isabel Oitavem

  Monotonicity Constraints in Characterizations of PSPACE

  J Logic Computation (2012) 22(2): 179-195 first published online February 17, 2010 doi:10.1093/logcom/exq002
  • Abstract
  • Full Text (PDF)
  • References
• Select this article
  • William C. Calhoun

  Triviality and Minimality in the Degrees of Monotone Complexity

  J Logic Computation (2012) 22(2): 197-206 first published online February 4, 2010 doi:10.1093/logcom/exq003
  • Abstract
  • Full Text (PDF)
  • References
• Select this article
  • Michiel De Smet and
  • Andreas Weiermann

  Sharp Thresholds for a Phase Transition Related to Weakly Increasing Sequences

  J Logic Computation (2012) 22(2): 207-211 first published online February 9, 2010 doi:10.1093/logcom/exq004
  • Abstract
  • Full Text (PDF)
  • References
• Select this article
  • Pantelis E. Eleftheriou,
  • Costas D. Koutras,
  • and Christos Nomikos

  Notions of Bisimulation for Heyting-Valued Modal Languages

  J Logic Computation (2012) 22(2): 213-235 first published online February 9, 2010 doi:10.1093/logcom/exq005
  • Abstract
  • Full Text (PDF)
  • References
• Select this article
  • B. Godlin,
  • E. Katz,
  • and J. A. Makowsky

  Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas

  J Logic Computation (2012) 22(2): 237-265 first published online February 15, 2010 doi:10.1093/logcom/exq006
  • Abstract
  • Full Text (PDF)
  • References
• Select this article
  • Antonina Kolokolova

  Expressing versus Proving: Relating Forms of Complexity in Logic

  J Logic Computation (2012) 22(2): 267-280 first published online February 9, 2010 doi:10.1093/logcom/exq008
  • Abstract
  • Full Text (PDF)
  • References
• Select this article
  • Lars Kristiansen

  Higher Types, Finite Domains and Resource-bounded Turing Machines

  J Logic Computation (2012) 22(2): 281-304 first published online February 17, 2010 doi:10.1093/logcom/exq009
  • Abstract
  • Full Text (PDF)
  • References
• Select this article
  • Paulo Oliva

  Hybrid Functional Interpretations of Linear and Intuitionistic Logic

  J Logic Computation (2012) 22(2): 305-328 first published online February 9, 2010 doi:10.1093/logcom/exq007
  • Abstract
  • Full Text (PDF)
  • References
• Select this article
  • Diana Ratiu and
  • Trifon Trifonov

  Exploring the Computational Content of the Infinite Pigeonhole Principle

  J Logic Computation (2012) 22(2): 329-350 first published online February 21, 2010 doi:10.1093/logcom/exq011
  • Abstract
  • Full Text (PDF)
  • References