Bringing together powerful new tools from set theory and the philosophy of language, this book proposes a solution to one of the few unresolved paradoxes from antiquity, the Paradox of the Liar. Treating truth as a property of propositions, not sentences, the authors model two distinct conceptions of propositions: one based on the standard notion used by Bertrand Russell, among others, and the other based on J.L. Austin's work on truth. Comparing these two accounts, the authors show that while the (...) Russellian conception of the relation between sentences, propositions, and truth is crucially flawed in limiting cases, the Austinian perspective has fruitful applications to the analysis of semantic paradox. In the course of their study of a language admitting circular reference and containing its own truth predicate, Barwise and Etchemendy also develop a wide range of model-theoretic techniques--based on a new set-theoretic tool, Peter Aczel's theory of hypersets--that open up new avenues in logical and formal semantics. (shrink)
The present volume collects some of Barwise's papers written since then, those directly concerned with relations among logic, situation theory, and situation semantics. Several papers appear here for the first time.
One effect of information technology is the increasing need to present information visually. The trend raises intriguing questions. What is the logical status of reasoning that employs visualization? What are the cognitive advantages and pitfalls of this reasoning? What kinds of tools can be developed to aid in the use of visual representation? This newest volume on the Studies in Logic and Computation series addresses the logical aspects of the visualization of information. The authors of these specially commissioned papers explore (...) the properties of diagrams, charts, and maps, and their use in problem solving and teaching basic reasoning skills. As computers make visual representations more commonplace, it is important for professionals, researchers and students in computer science, philosophy, and logic to develop an understanding of these tools; this book can clarify the relationship between visuals and information. (shrink)
Covers first-order language in method appropriate for first and second courses in logic. CD-ROM consists of a new book, 3 programs,and an Internet-based grading service.
In this paper I explore informationalism, a pragmatic theory of modality that seems to solve some serious problems in the familiar possible worlds accounts of modality. I view the theory as an elaboration of Stalnaker's moderate modal realism, though it also derives from Dretske's semantic theory of information. Informationalism is presented in Section 2 after the prerequisite stage setting in Section 1. Some applications are sketched in Section 3. Finally, a mathematical model of the theory is developed in Section 4.How (...) many times have I said to you that when you have eliminated the impossible, whatever remains, however improbable, must be the truth? (Arthur Conan Doyle)You've put me in an impossible situation. (Anonymous)[N]othing we imagine is absolutely impossible. (David Hume). (shrink)
Hyperproof is a system for learning the principles of analytical reasoning and proof construction, consisting of a text and a Macintosh software program. Unlike traditional treatments of first-order logic, Hyperproof combines graphical and sentential information, presenting a set of logical rules for integrating these different forms of information. This strategy allows students to focus on the information content of proofs, rather than the syntactic structure of sentences. Using Hyperproof the student learns to construct proofs of both consequence and nonconsequence using (...) an intuitive proof system that extends the standard set of sentential rules to incorporate information represented graphically. Hyperproof is compatible with various natural-deduction-style proof systems, including the system used in the authors' Language of First-Order Logic. (shrink)
Preservation and interpolation results are obtained for L ∞ω and sublogics $\mathscr{L} \subseteq L_{\infty\omega}$ such that equivalence in L can be characterized by suitable back-and-forth conditions on sets of partial isomorphisms.
Preservation and interpolation results are obtained for L ∞ω and sublogics $\mathscr{L} \subseteq L_{\infty\omega}$ such that equivalence in L can be characterized by suitable back-and-forth conditions on sets of partial isomorphisms.
We show that several theorems on ordinal bounds in different parts of logic are simple consequences of a basic result in the theory of global inductive definitions.
