دانلود کتاب Consequence Relations: An Introduction to the Lindenbaum-Tarski Method

فهرست مطالب :

Foreword
Preface
Acknowledgments
Contents
1. Introduction
1.1 Overview of the key concepts
1.2 Overview of the contents
2. Preliminaries
2.1 Preliminaries from set theory
2.2 Preliminaries from topology
2.3 Preliminaries from algebra
2.3.1 Subalgebras, homomorphisms, direct products and subdirect products
2.3.2 Class operators
2.3.3 Term algebra, varieties and quasi-varieties
2.3.4 Hilbert algebras
2.3.5 Distributive lattices
2.3.6 Brouwerian semilattices
2.3.7 Relatively pseudo-complemented lattices
2.3.8 Boolean algebras
2.3.9 Heyting algebras
2.4 Preliminaries from model theory
2.5 Preliminaries from computability theory
2.5.1 Algorithmic functions and relations on ℕ
2.5.2 Word sets and functions
2.5.3 Effectively denumerable sets
3. Sentential Formal Languages and Their Interpretation
3.1 Sentential formal languages
3.2 Semantics of sentential formal language
3.2.1 The logic of a two-valued matrix
3.2.2 The Łukasiewicz logic of a three-valued matrix
3.2.3 The Łukasiewicz modal logic of a three-valued matrix
3.2.4 The Gödel n-valued logics
3.2.5 The Dummett denumerable matrix
3.2.6 Two infinite generalizations of Łukasiewicz’s Ł₃
3.3 Historical notes
4. Logical Consequence
4.1 Consequence relations
4.2 Consequence operators
4.3 Realizations of abstract logic
4.3.1 Defining new abstract logics from given ones by substitution
4.3.2 Consequence operator via a closure system
4.3.3 Defining abstract logic semantically: a general approach
4.3.4 Consequence relation via logical matrices
4.3.5 Consequence relation via inference rules
4.4 Abstract logics defined by modus rules
4.4.1 General characterization
4.4.2 Abstract logics