Journal of Logic and Computation, Volume 17

Volume 17, Number 1, February 2007

• Heinrich Wansing:
  Introduction and Call for Papers. 5
  
• Sebastian Bauer:
  Axiomatizing the Monodic Fragment of QCTL. 7-30
  

• Víctor Dalmau, Andrei A. Krokhin, Benoit Larose:
  First-order Definable Retraction Problems for Posets and Reflexive Graphs. 31-51
  
• Marcelo Finger, Renata Wassermann:
  Anytime Approximations of Classical Logic from Above. 53-82
  
• Thomas Ågotnes, Natasha Alechina:
  The Dynamics of Syntactic Knowledge. 83-116
  
• Mark Reynolds:
  A Tableau for Bundled CTL. 117-132
  
• Ian Pratt-Hartmann:
  Complexity of the Guarded Two-variable Fragment with Counting Quantifiers. 133-155
  
• Francesco Ranzato, Francesco Tapparo:
  Generalized Strong Preservation by Abstract Interpretation. 157-197
  
• Wojciech Buszkowski:
  On Action Logic: Equational Theories of Action Algebras. 199-217
  

Volume 17, Number 2, April 2007

• Altaf Hussain:
  A New Modal Approach to the Logic of Intervals. 221-254
  
• Robin Hirsch:
  Peirce Algebras and Boolean Modules. 255-283
  
• Benedikt Löwe, Brian Semmes:
  The Extent of Constructive Game Labellings. 285-298
  
• Wojciech Zielonka:
  On Reduction Systems Equivalent to the Non-associative Lambek Calculus with the Empty String. 299-310
  
• Enrico Marchioni, Franco Montagna:
  Complexity and Definability Issues in L Pi 1/2. 311-331
  
• Ben C. Moszkowski:
  Using Temporal Logic to Analyse Temporal Logic: A Hierarchical Approach Based on Intervals. 333-409
  

Volume 17, Number 3, June 2007

• Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter, Michael Zakharyaschev:
  A Logic for Concepts and Similarity. 415-452
  
• Christian G. Fermüller, Reinhard Pichler:
  Model Representation over Finite and Infinite Signatures. 453-477
  
• Sven Ove Hansson:
  Contraction Based on Sentential Selection. 479-498
  
• Magdalena Ortiz, Mauricio Osorio:
  Strong Negation and Equivalence in the Safe Belief Semantics. 499-515
  
• Thomas Bolander, Patrick Blackburn:
  Termination for Hybrid Tableaus. 517-554
  
• Alexandru Baltag, Bob Coecke, Mehrnoosh Sadrzadeh:
  Epistemic Actions as Resources. 555-585
  
• Emil Jerábek:
  On Independence of Variants of the Weak Pigeonhole Principle. 587-604
  

• An Institution-independent Generalization of Tarski's Elementary Chain Theorem. 605
  

• Logics with Common Weak Completions. 607
  

Volume 17, Number 4, August 2007

• Ian Horrocks:
  Logic for Ontology Engineering Corner. 615
  

• Boris Motik:
  On the Properties of Metamodeling in OWL. 617-637
  
• Jeremy Forth, Rob Miller:
  Ramifications: An Extension and Correspondence Result for the Event Calculus. 639-685
  
• Nicolas Biri, Didier Galmiche:
  Models and Separation Logics for Resource Trees. 687-726
  
• Zhaohui Zhu, Wenjie Xiao:
  Two Representation Theorems for Non-monotonic Inference Relations. 727-747
  
• Stefano Aguzzoli, Manuela Busaniche, Vincenzo Marra:
  Spectral Duality for Finitely Generated Nilpotent Minimum Algebras, with Applications. 749-765
  
• Rajeev Goré, Alwen Tiu:
  Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5. 767-794
  
• Joseph Y. Halpern, Leandro Chaves Rêgo:
  Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic. 795-806
  
• Joey W. Coleman, Cliff B. Jones:
  A Structural Proof of the Soundness of Rely/guarantee Rules. 807-841
  

Volume 17, Number 5, October 2007

• Sheila A. McIlraith, Pavlos Peppas, Michael Thielscher:
  Preface. 847-849
  
• Alexander Bochman:
  A Causal Theory of Abduction. 851-869
  
• James P. Delgrande, Torsten Schaub, Hans Tompits:
  A General Framework for Expressing Preferences in Causal Reasoning and Planning. 871-907
  
• Olivier Gauwin, Sébastien Konieczny, Pierre Marquis:
  Conciliation through Iterated Belief Merging. 909-937
  
• Mark Hopkins, Judea Pearl:
  Causality and Counterfactuals in the Situation Calculus. 939-953
  
• Yves Moinard:
  Forgetting Literals with Varying Propositional Symbols. 955-982
  
• Steven Shapiro, Yves Lespérance, Hector J. Levesque:
  Goal Change in the Situation Calculus. 983-1018
  

Volume 17, Number 6, December 2007

• Arnold Beckmann, Benedikt Löwe, Dag Normann:
  Logical Approaches to Computational Barriers: CiE 2006. 1021-1023
  
• Bahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan:
  Post's Programme for the Ershov Hierarchy. 1025-1040
  
• George Barmpalias, Paul Brodhead, Douglas Cenzer, Seyyed Dashti, Rebecca Weber:
  Algorithmic Randomness of Closed Sets. 1041-1062
  
• Fredrik Dahlgren:
  Partial Continuous Functions and Admissible Domain Representations. 1063-1081
  
• Arnoud den Boer, Andreas Weiermann:
  A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions. 1083-1098
  
• A. Sirokofskich, Costas Dimitracopoulos:
  On a Problem of J. Paris. 1099-1107
  
• Roy Dyckhoff, Stéphane Lengrand:
  Call-by-Value lambda-calculus and LJQ. 1109-1134
  
• Oleg V. Kudinov, Victor L. Selivanov:
  Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests. 1135-1151
  
• Jiang Liu, Guohua Wu:
  Isolation, Infima and Diamond Embeddings. 1153-1166
  
• Alan Skelley:
  Third-Order Computation and Bounded Arithmetic. 1167-1191
  
• Ivan N. Soskov:
  The omega-Enumeration Degrees. 1193-1214
  
• Alexandra A. Soskova:
  Relativized Degree Spectra. 1215-1233
  
• Mariya Ivanova Soskova:
  Genericity and Non-bounding in the Enumeration degrees. 1235-1255