| Preliminaries | p. 1 |
| Set Operations | p. 1 |
| Relations | p. 2 |
| Partial Functions and Functions | p. 4 |
| Indexed Families of Sets and Generalized Set Operations | p. 5 |
| Natural Numbers, Countable Sets | p. 5 |
| Equivalence Relations, Congruences | p. 6 |
| Orderings | p. 7 |
| Trees | p. 9 |
| Inductive Definitions | p. 10 |
| Abstract Algebras | p. 12 |
| Logical Matrices | p. 20 |
| Many-Valued Propositional Calculi | p. 23 |
| Remarks on History | p. 23 |
| The Definition of a Propositional Calculus | p. 25 |
| Many-Valued Calculi of Lukasiewicz | p. 27 |
| Finitely Valued Calculi of Lukasiewicz | p. 30 |
| The Formalized Language of Propositional Calculi | p. 30 |
| Algebraic Characterization of the n-valued Calculi of Lukasiewicz | p. 32 |
| Lattices | p. 32 |
| Quasi-Boolean Algebras and Heyting Algebra | p. 33 |
| Proper Lukasiewicz Algebras | p. 37 |
| The Lukasiewicz Implication | p. 39 |
| Stone Filters in Proper n-valued Lukasiewicz Algebras | p. 41 |
| The Axiom System for the n-valued Propositional Calculus of Lukasiewicz | p. 42 |
| Many-Valued Calculi of Post | p. 46 |
| Bibliographical Remarks | p. 46 |
| Post Algebras | p. 46 |
| Post Algebra Filters | p. 49 |
| The Axiom System for the n-valued Post Calculus | p. 51 |
| Many-Valued Post Calculi with Several Designated Truth Values | p. 54 |
| Definability of Functors in the n-valued Post Logic | p. 57 |
| Survey of Three-Valued Propositional Calculi | p. 63 |
| The Three-Valued Calculus of Lukasiewicz (L[subscript 3]) | p. 63 |
| The Three-Valued Calculus of Bochvar | p. 65 |
| The Three-Valued Calculus of Finn | p. 66 |
| The Three-Valued Calculus of Hallden | p. 68 |
| The Three-Va]ued Calculus of Aqvist | p. 69 |
| The Three-Valued Calculi of Segerberg | p. 70 |
| The Three-Valued Calculus of Pirog-Rzepecka | p. 71 |
| The Three-Valued Calculus of Heyting | p. 73 |
| The Three-Valued Calculus of Kleene | p. 74 |
| The Three-Valued Calculus of Reichenbach | p. 75 |
| The Three-Valued Calculus of Slupecki | p. 76 |
| The Three-Valued Calculus of Sobocinski | p. 77 |
| Some n-valued Propositional Calculi: A Selection | p. 79 |
| The Many-Valued Calculus of Slupecki | p. 79 |
| The Many-Valued Calculus of Sobocinski | p. 82 |
| The Many-Valued Calculi of Godel | p. 84 |
| The Many-Valued Calculus Cnr | p. 85 |
| Intuitionistic Propositional Calculus | p. 95 |
| The Intuitionistic Propositional Logic in an Axiomatic Setting | p. 95 |
| The Natural-Deduction Method for the Intuitionistic Propositional Logic | p. 98 |
| Characterization of the Intuitionistic Propositional Logic in Terms of the Consequence Operator Cn[subscript I] | p. 100 |
| Algebraic Characterization of the Intuitionistic Propositional Logic | p. 101 |
| Kripke's Semantics for the Intuitionistic Propositional Calculus | p. 102 |
| First-Order Predicate Calculus for Many-Valued Logics | p. 105 |
| The Language of the First-Order Predicate Calculus | p. 105 |
| Free Variables and Bound Variables | p. 107 |
| The Rule of Substitution for Individual Variables | p. 108 |
| Fundamental Semantic Notions | p. 109 |
| The Many-Valued First-Order Predicate Calculus of Post | p. 113 |
| The Method of Finitely Generated Trees in n-valued Logical Calculi | p. 123 |
| Introductory Remarks | p. 123 |
| Finitely Generated Trees for n-valued Propositional Calculi | p. 123 |
| The Existence of Models for the Propositional Calculus | p. 130 |
| Finitely Generated Trees for n-valued First-Order Predicate Calculi | p. 133 |
| Finitely Generated Trees for n-valued Quantifiers | p. 137 |
| Fuzzy Propositional Calculi | p. 143 |
| Introductory Remarks | p. 143 |
| Fuzzy Sets | p. 143 |
| Syntactic Introduction | p. 144 |
| Semantic Basis for Fuzzy Propositional Logics | p. 154 |
| Remarks on the Incompleteness of Fuzzy Propositional Calculi | p. 171 |
| First-Order Predicate Calculus for Fuzzy Logics | p. 192 |
| Introductory Remarks | p. 192 |
| Generalized Residual Lattices | p. 192 |
| The Language of the Fuzzy First-Order Predicate Calculus | p. 195 |
| Semantic Consequence Operation | p. 199 |
| Syntax of the Fuzzy First-Order Predicate Calculus | p. 202 |
| Syntactic Consequence Operation | p. 203 |
| An Axiom System for the Fuzzy First-Order Predicate Calculus | p. 204 |
| Fuzzy First-Order Theories | p. 206 |
| Approximation Logics | p. 209 |
| Introduction | p. 209 |
| Rough Sets | p. 209 |
| Rough Logics with a Chain of Indistinguishability Relations | p. 212 |
| Basic Concepts | p. 212 |
| Approximate Logical Systems | p. 214 |
| Approximation Theories | p. 219 |
| Approximation Logics with Partially Ordered Sets of Indiscernibility Relations | p. 221 |
| Plain Semi-Post Algebras | p. 221 |
| Approximation Logic of Type T | p. 225 |
| Approximation Logics of Type T with Many Indiscernibility Relations | p. 228 |
| Probability Logics | p. 231 |
| Introduction | p. 231 |
| Lukasiewicz' Idea of Logical Probability | p. 232 |
| An Algebraic Description of Probability Logic | p. 233 |
| Syntax | p. 233 |
| Semantics | p. 234 |
| Constructions | p. 237 |
| Probabilistic Consequence | p. 239 |
| Axiomatic Approach to Probability Logic | p. 243 |
| Syntax | p. 243 |
| Probability and Probabilistic Consequence | p. 245 |
| Completeness of Probability Logic | p. 247 |
| Applications | p. 252 |
| Unreasonable Inference | p. 253 |
| References | p. 255 |
| Index of Symbols | p. 285 |
| Author Index | p. 287 |
| Subject Index | p. 289 |
| Table of Contents provided by Blackwell. All Rights Reserved. |