Logic and the Modalities in the Twentieth CenturyDov M. Gabbay, John Woods Elsevier, 2006 M05 10 - 732 pages Logic and the Modalities in the Twentieth Century is an indispensable research tool for anyone interested in the development of logic, including researchers, graduate and senior undergraduate students in logic, history of logic, mathematics, history of mathematics, computer science and artificial intelligence, linguistics, cognitive science, argumentation theory, philosophy, and the history of ideas. This volume is number seven in the eleven volume Handbook of the History of Logic. It concentrates on the development of modal logic in the 20th century, one of the most important undertakings in logic’s long history. Written by the leading researchers and scholars in the field, the volume explores the logics of necessity and possibility, knowledge and belief, obligation and permission, time, tense and change, relevance, and more. Both this volume and the Handbook as a whole are definitive reference tools for students and researchers in the history of logic, the history of philosophy, and any discipline, such as mathematics, computer science, artificial intelligence, for whom the historical background of his or her work is a salient consideration. · Detailed and comprehensive chapters covering the entire range of modal logic. · Contains the latest scholarly discoveries and interpretative insights that answer many questions in the field of logic. |
From inside the book
Results 1-5 of 76
Page 1
... programs behave and to express dynamical properties of transitions between states. Over a period of three decades or so from the early 1930's there evolved two kinds of mathematical semantics for modal logic. Algebraic semantics ...
... programs behave and to express dynamical properties of transitions between states. Over a period of three decades or so from the early 1930's there evolved two kinds of mathematical semantics for modal logic. Algebraic semantics ...
Page 3
... program finishes after all terminating executions the program enables there is a terminating execution such that It is now common to use the symbol P for a modality of universal character, and Q for its existential dual. In systems ...
... program finishes after all terminating executions the program enables there is a terminating execution such that It is now common to use the symbol P for a modality of universal character, and Q for its existential dual. In systems ...
Page 62
... program a, then q holds afterwards. Although I was skeptical at first, a weekend with Hughes and Cresswell convinced me that a most harmonious union between modal logic and programs was possible. The union promised to be of interest to ...
... program a, then q holds afterwards. Although I was skeptical at first, a weekend with Hughes and Cresswell convinced me that a most harmonious union between modal logic and programs was possible. The union promised to be of interest to ...
Page 63
... program correctness and termination can be formalised by combining [π] with other connectives, including modalities for other programs. The connective [π] is interpreted, not as an accessibility relation between possible worlds, but as ...
... program correctness and termination can be formalised by combining [π] with other connectives, including modalities for other programs. The connective [π] is interpreted, not as an accessibility relation between possible worlds, but as ...
Page 64
... programs having associated modalities. Deterministic programs are modelled by requiring Rπ to be a functional relation. Program predicates may be used to express computational behaviour of particular programs, such as loop(π), meaning ...
... programs having associated modalities. Deterministic programs are modelled by requiring Rπ to be a functional relation. Program predicates may be used to express computational behaviour of particular programs, such as loop(π), meaning ...
Contents
1 | |
Epistemic Logic Paul Gochet and Pascal Gribomont | 99 |
Deontic Logic Paul McNamara | 197 |
Relevant and Substructural Logics Greg Restall | 289 |
A N Priors Logic Peter Øhrstrøm and Per F V Hasle | 399 |
The Philosophical Background Peter Øhrstrøm and Per F V Hasle | 447 |
Common terms and phrases
½ ½ A.N. Prior accessibility relation agent algebra axiom axiomatisation belief Belnap Benthem bisimulation Boolean calculus characterised classical coalgebra complete Computer Science conjunction construction context defined definition deontic logic described situation disjunction doxastic doxastic logic dynamic logic entailment epistemic logic equivalent example expresses fact finite first-order formal formula frame function Gabbay Goldblatt Hintikka implication infon instance interpretation intuitionistic intuitionistic logic Journal of Symbolic Kripke language lattice linear logic Lorenzen means Meyer modal logic negation notion Ô Õ Ô obligations obligatory ÔÕ operator Philosophical Logic possible worlds predicate problem programs proof theory propositional content propositional logic provable quantifier relevant logic result satisfies Segerberg semantics sentence situation semantics statement structural rules substructural logics Symbolic Logic Tarski temporal logic tense logic theorem true truth utterance valid variables
References to this book
Lectures on the Curry-Howard Isomorphism, Volume 10 Morten Heine Sørensen,Paweł Urzyczyn No preview available - 2006 |