New York: Springer. 1998/ 300 p. ISBN 978-0-7923-5335-5; ISBN 978-94-011-5292-1 (eBook)
This is a thorough treatment of first-order modal logic. The book covers such issues as quantification, equality (including a treatment of Frege's morning star/evening star puzzle), the notion of existence, non-rigid constants and function symbols, predicate abstraction, the distinction between nonexistence and nondesignation, and definite descriptions, borrowing from both Fregean and Russellian paradigms.
Table of contents
Preface
Propositional Modal Logic
What is a Modal?
Can There Be a Modal Logic?
What Are The Formulas?
Aristotle's Modal Square
Informal Inlcrprc tat ions
What Are the Models?
Examples
Some Important logics
Logical Consequence
Temporal Logic
Epistcmic Logic
Historical Highlights
Tableau Proof Systems
What Is a Proof
Tableaus
More Tableau Systems
Logical Consequence and Tableau*
Tableaus Work
Axiom Systems
What Is an Axiomatic Proof
More Axiom Systems
Logical Consequence. Axiomatically
Axiom Systems Work Too
Quantified Modal Logic
First-Order Formulas
An Informal Introduction
Necessity De Re and Dc Dicto
Is Quantified Modal l-ogic Possible?
What the Quantifiers Quantify Over
Constant Domain Models
Varying Domain Models
Different Media, Same Message
Barcan and Converse Bare an Formulas
First-order tableaus
Constant Domain Tableaus
Varying Domain Tableaus
Tableaus Still Work
First-Order Axiom Systems
A Classical First-Order Axiom System
Varying Domain Modal Axiom Systems
Constant Domain Systems
Miscellany
Equality
Classical Background
Frege's Puzzle
The Indiscernibility of Identicals
The Formal Details
Tableau Equality Rules
Tableau Soundness and Completeness
An Example
Existence and actualist quantification
To Be
Tableau Proofs
The Paradox of NonBcing
Deflationists
Parmenides' Principle
Inflationists
Unactualized Possibles
Barcan and Converse Barcan, Again
Using Validities in Tableaus
On Symmetry
Terms and Predicate Abstraction
Why constants should not be constant
Scope
Predicate Abstraction
Abstraction in the Concrete
Reading Predicate Abstracts
Abstraction continued
Equality
Rigidity
A Dynamic Logic Example
Rigid Designators
Existence
Tableau Rules, Varying Domain
Tableau Rules, Constant Domain
Designation
The Formal Machinery
Designation and Existence
Existence and Designation
Fiction
Tableau Rules
Definite Descriptions
Notation
Two Theories of Descriptions
The Semantics of Definite Descriptions
Some Examples
Hintikka's Schema and Variations
Varying Domain Tableaus
Russell's Approach
Possibilist Quantifiers
References
Index