Annals of Pure and Applied Logic, Volume 141

Volume 141, Numbers 1-2, August 2006

• John Krueger:
  Adding clubs with square. 1-28
  
• Robert S. Lubarsky:
  CZF and Second Order Arithmetic. 29-34
  
• Marcelo P. Fiore, Roberto Di Cosmo, Vincent Balat:
  Remarks on isomorphisms in typed lambda calculi with empty and sum types. 35-50
  
• George Barmpalias, Andrew E. M. Lewis:
  The ibT degrees of computably enumerable sets are not dense. 51-60
  
• Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov, Andrei S. Morozov:
  Effective categoricity of equivalence structures. 61-78
  
• Angsheng Li, Guohua Wu, Yue Yang:
  Bounding computably enumerable degrees in the Ershov hierarchy. 79-88
  
• Philipp Gerhardy, Ulrich Kohlenbach:
  Strongly uniform bounds from semi-constructive proofs. 89-107
  
• Monica Van Dieren:
  Categoricity in abstract elementary classes with no maximal models. 108-147
  
• Franco Montagna:
  Interpolation and Beth's property in propositional many-valued logics: A semantic investigation. 148-179
  
• Valentin Goranko, Dimiter Vakarelov:
  Elementary canonical formulae: extending Sahlqvist's theorem. 180-217
  
• Pavel Naumov:
  On modal logic of deductive closure. 218-224
  
• Kosta Dosen, Zoran Petric:
  Coherence for star-autonomous categories. 225-242
  
• Nikolai V. Krupski:
  Typing in reflective combinatory logic. 243-256
  
• Hajime Ishihara, Erik Palmgren:
  Quotient topologies in constructive set theory and type theory. 257-265
  
• Yves Guiraud:
  The three dimensions of proofs. 266-295
  
• Hajime Ishihara, Ray Mines, Peter Schuster, Luminita Vîta:
  Quasi-apartness and neighbourhood spaces. 296-306
  

Volume 141, Number 3, September 2006

• Yuri Matiyasevich, Sergei N. Artëmov:
  Preface. 307
  
• Danièle Beauquier:
  Decidable properties for monadic abstract state machines. 308-319
  
• Anatoly Petrovich Beltiukov:
  A nonasymptotic lower time bound for a strictly bounded second-order arithmetic. 320-324
  
• A. V. Chernavsky, V. P. Leksine:
  Unrecognizability of manifolds. 325-335
  
• Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev:
  On complexity of verification of interacting agents' behavior. 336-362
  
• S. Fratani, Géraud Sénizergues:
  Iterated pushdown automata and sequences of rational numbers. 363-411
  
• Dima Grigoriev, S. Vakulenko:
  Algorithms and complexity in biological pattern formation problems. 412-428
  
• Edward A. Hirsch, Arist Kojevnikov:
  Several notes on the power of Gomory-Chvátal cuts. 429-436
  
• Andrej Muchnik, Alexei L. Semenov:
  Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets. 437-441
  
• Michael Rathjen, Sergei Tupailo:
  Characterizing the interpretation of set theory in Martin-Löf typetheory. 442-471
  
• Dan E. Willard:
  A generalization of the Second Incompleteness Theorem and some exceptions to it. 472-496