Volume 143, January 2006

• 
  Ruy J. G. B. de Queiroz, Angus Macintyre, Guilherme Bittencourt: Preface. 1-4
• 
  Benjamín René Callejas Bedregal, Anderson Paiva Cruz: Propositional Logic as a Propositional Fuzzy Logic. 5-12
• 
  Anuj Dawar, David Richerby, Benjamin Rossman: Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract). 13-26
• 
  Itala M. Loffredo D'Ottaviano, Milton Augustinis De Castro: Analytical Tableaux for da Costa's Hierarchy of Paraconsistent Logics. 27-44
• 
  Santiago Figueira, André Nies, Frank Stephan: Lowness Properties and Approximations of the Jump. 45-57
• 
  Melvin Fitting: A Quantified Logic of Evidence. 59-71
• 
  Sven Hartmann, Sebastian Link: An Equivalence between Dependencies in Nested Databases and a Fragment of Propositional Logic. 73-85
• 
  Ozan Kahramanogullari: System BV is NP-complete. 87-99
• 
  Richard Lassaigne, Sylvain Peyronnet: Probabilistic Verification and Approximation. 101-114
• 
  Leonid Libkin: Locality of Queries and Transformations. 115-127
• 
  Ana Teresa C. Martins, Lília Ramalho Martins: Natural Deduction for Full S5 Modal Logic with Weak Normalization. 129-140
• 
  Casey McGinnis: Tableau Systems for Some Paraconsistent Modal Logics. 141-157
• 
  Grigori Mints: Cut Elimination for a Simple Formulation of PAepsilon. 159-169
• 
  Guilherme de Souza Rabello, Marcelo Finger: Approximations of Modal Logic K. 171-184
• 
  Thomas Scanlon: Nonstandard Meromorphic Groups. 185-196
• 
  Joel H. Spencer, Katherine St. John: The Complexity of Random Ordered Structures. 197-206
• 
  Hongwei Xi: Development Separation in Lambda-Calculus. 207-221

last updated on Thu May 23 04:11:01 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page