Foreword | p. v |
Seminormal Fine Measures on P[subscript kappa]([lambda]) | p. 1 |
Effective Baire Category Concepts | p. 13 |
Weak Presentations of Computable Partial Orderings | p. 31 |
Recursion Theory and Weak Fragments of Peano Arithmetic: A Study of Definable Cuts | p. 47 |
Lattice Embedding into d-r.e. Degrees Preserving 0 and 1 | p. 67 |
On Stationary Reflection Principles | p. 83 |
Definable Sets of Real Numbers, Infinite Games and Core Model Theory | p. 107 |
The Descriptive Classification of Some Classes of C*--algebras | p. 121 |
Decidability and Undecidability in the Enumerable Turing Degrees | p. 151 |
The Theory of Finite Models | p. 163 |
A Note on Weak Segments of PFA | p. 175 |
On Structual Inference Rules For Gentzen-Style Natural Deduction, Part I | p. 199 |
Linear Set Theory with Strict Comprehension | p. 223 |
A Solution to a Problem of Marek and Truszcynski | p. 247 |
Credulous Reasoning about Defaults | p. 255 |
Computational Complexity of Infinite-Valued Lukasiewicz Propositional Logic | p. 273 |
NDK and Natural Reasoning | p. 285 |
Default Logic and it's Variants: A Semantical View | p. 311 |
Adding Eventual Different Reals | p. 329 |
Asian Logic Conferences | p. 345 |
Table of Contents provided by Syndetics. All Rights Reserved. |