| Fine Grained Theories of Time | p. 1 |
| Priorean Tense Logic | p. 3 |
| Referential Tense Logic | p. 7 |
| A First Look at Allen's System | p. 17 |
| A Sorted Interval-Based Language | p. 23 |
| Concluding Remarks | p. 30 |
| Revision Sequences and Computers With an Infinite Amount of Time | p. 37 |
| Introduction | p. 37 |
| The Gupta-Belnap Systems | p. 39 |
| Revision Sequences | p. 39 |
| The Systems S# and S* | p. 42 |
| Infinite Time Turing Machines | p. 45 |
| Revision Sequences Modeled by Infinite Time Turing Machines | p. 49 |
| The Limit Rule and Other Applications | p. 55 |
| Aftermath | p. 56 |
| On Frege's Nightmare: A Combination of Intuitionistic, Free and Paraconsistent Logics | p. 61 |
| Aims of This Paper | p. 62 |
| The Dialogical Approach to Free Logic | p. 63 |
| Dialogical Free Logic With and Without tertium non datur | p. 63 |
| Winning Strategies and Dialogical Tableaux for DFL | p. 68 |
| Many Quantifiers and Sorts of Objects--The Systems DFL[superscript n] and DFL[superscript (n)] | p. 73 |
| Combining DFLI and DFLC | p. 75 |
| Inconsistent Objects | p. 77 |
| Paraconsistency | p. 77 |
| The Dialogical Approach to Paraconsistent Logic and Frege's Nightmare | p. 79 |
| Conclusions | p. 85 |
| Truthmakers, Entailment and Necessity | p. 91 |
| Truthmakers | p. 92 |
| Entailment | p. 94 |
| Necessity | p. 97 |
| Reductionism | p. 100 |
| Proofs | p. 102 |
| Conclusion | p. 107 |
| Global Definability in Basic Modal Logic | p. 111 |
| Introduction | p. 111 |
| Basic Concepts | p. 113 |
| Local Definability | p. 114 |
| Global Definability | p. 117 |
| Hansoul's Theorem | p. 122 |
| Universal Classes | p. 127 |
| Concluding Remarks | p. 130 |
| Ackermann's Implication for Typefree Logic | p. 137 |
| Ackermann's Typefree Logic | p. 137 |
| Deductive and Combinatorial Completeness | p. 137 |
| A Deductive Interpretation of Implication | p. 139 |
| The Positive Fragments of Ackermann's Systems | p. 140 |
| The Two Deducibility Relation of [Sigma superscript +] | p. 144 |
| A Hierarchy of Deductive Systems | p. 149 |
| The Base Calculus K[subscript 0] | p. 151 |
| The Calculus K[subscript 1] | p. 153 |
| The Full Hierarchy | p. 155 |
| Algebraic Semantics | p. 158 |
| Ackermann Structures | p. 158 |
| The Canonical Ackermann Lattice | p. 160 |
| Why Dialogical Logic? | p. 165 |
| Introduction | p. 165 |
| Pluralism Concerning Logics and Logical Methodology | p. 166 |
| Dialogical Logic: A Short Outline | p. 167 |
| Prejudices Against Dialogical Logic | p. 171 |
| 'Dialogical Logic is a Constructivistic Logic' | p. 171 |
| 'Dialogical Logic is Limited to Classical and Intuitionistic Logic' | p. 172 |
| 'Dialogical Logic Complicates Things Unnecessarily' | p. 172 |
| Advantages of Dialogical Logic | p. 173 |
| The Distinction between General and Formal Truth | p. 173 |
| The Distinction between the Level of Games and the Level of Strategies | p. 175 |
| The Distinction between the Particle Rules and the Structural Rules | p. 177 |
| Concluding Remarks | p. 182 |
| Semantics for Constructive Negations | p. 187 |
| Preliminaries. A Hierarchy of Negations | p. 187 |
| Introduction. "Kripk-Approach" to Semantic Analysis | p. 189 |
| Formal Definitions of Constructive Negation and Informal Understanding of Negation in Intuitionism | p. 190 |
| State-Descriptions as a Method of Semantic Analysis. A Model for Positive Logic | p. 192 |
| Intuitionistic State-Descriptions. Models for Negation | p. 195 |
| The System M | p. 200 |
| The System I | p. 200 |
| The System D | p. 202 |
| The System E | p. 203 |
| The System C | p. 204 |
| Propositional Constants | p. 204 |
| Soundness | p. 205 |
| Completeness | p. 206 |
| Generalizations | p. 213 |
| Recent Trends in Paraconsistent Logic | p. 219 |
| Philosophical and Historical Background | p. 220 |
| A Few Historical Remarks | p. 220 |
| The Principle of Contradiction | p. 221 |
| Harnessing Paraconsistency | p. 223 |
| Mathematics | p. 223 |
| Automated Reasoning | p. 224 |
| Belief Revision | p. 226 |
| Philosophy and Methodology | p. 227 |
| Main Tendencies in Paraconsistent Logic | p. 228 |
| Da Costa's Systems | p. 228 |
| Many-Valued and Relevant Logic | p. 229 |
| Inconsistency Adaptive Logic | p. 231 |
| Non-Adjunctive Systems | p. 232 |
| Other Approaches | p. 239 |
| Will There be a Unification? | p. 240 |
| Obligations, Authorities, and History Dependence | p. 247 |
| Introduction | p. 247 |
| Identification of Obligations | p. 248 |
| Authorities and Addressees of Norms | p. 251 |
| History Dependence | p. 254 |
| Bibliography | p. 257 |
| Index | p. 259 |
| Table of Contents provided by Syndetics. All Rights Reserved. |
