This is a review of Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena, written by Jon Barwise and Lawrence Moss and published by CSLI Publications in 1996.

This volume tackles the slippery subject of 'meaning'.

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)

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.

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)

The Language of First-Order Logic is a complete introduction to first-order symbolic logic, consisting of a computer program and a text. The program, an aid to learning and using symbolic notation, allows one to construct symbolic sentences and possible worlds, and verify that a sentence is well formed. The truth or falsity of a sentence can be determined by playing a deductive game with the computer.

The present essay is a critical study of Barwise and Perry’s book, emphasizing the logical and model-theoretical aspects of their work. I begin by presenting the authors’ criticism of the classical view of logic and semantics within the tradition of Frege, Russell and Tarski. In this connection, I discuss the so-called Frege argument (“the slingshot”). I try to show that the argument appears inconclusive, not only from a situation-theoretic perspective, but also from such alternative perspectives as orthodox Fregean semantics (...) or Russellian semantics. I then discuss the ontology of situation semantics and the way it is modeled within set theory. In particular, I compare the notion of an abstract situation with that of a possible world. The last two sections concern the model-theoretic aspects of the authors’ theory. In Section 7, I discuss how the “partial” perspective of situation semantics differs from that of classical model theory. Finally, in Section 8, different model-theoretic accounts of attitude reports within situation semantics are discussed, in particular the “relations to situations”-approach presented by the authors in Chapter 9 of S & A. The usual problems of “logical omniscience” that appear in standard Hintikka-style epistemic logic are avoided in situation semantics. I argue, however, that situation semantics is faced with analogous counter-intuitive results, unless the expressive power of the language under study is suitably restricted. (shrink)

Tarski's World 3.0 is an innovative and enjoyable way to introduce your students to the language of first-order logic. Using this program, students quickly master the meaning of the connectives and quantifiers, and soon become fluent in the symbolic language at the core of modern logic. Tarski's World allows the students to build three-dimensional worlds and describe them in first-order logic. They evaluate the sentences in the constructed worlds, and if their evaluation is incorrect, the program provides them with a (...) game that leads them to understand where they went wrong. The package is intended as a supplement to any standard logic text, or for use by anyone who wants to learn the language. The disk and manual contain over a hundred exercises from very basic to highly sophisticated. (shrink)

Turing's World is a self-contained introduction to Turing machines, one of the fundamental notions of logic and computer science. The text and accompanying diskette allow the user to design, debug, and run sophisticated Turing machines in a graphical environment on the Macintosh. Turning's World introduces users to the key concpets in computability theory through a sequence of over 100 exercises and projects. Within minutes, users learn to build simple Turing machines using a convenient package of graphical functions. Exercises then progress (...) through a significant portion of elementary computability theory, covering such topics as the Halting problem, the Busy Beaver function, recursive functions, and undecidability. Version 3.0 is an extensive revision and enhancement of earlier releases of the program, allowing the construction of one-way and two-way finite state machines (finite automata), as well as nondeterministic Turing and finite-state machines. Special exercises allow users to explore these alternative machines. (shrink)

This textbook/software package covers first-order language in a method appropriate for first and second courses in logic. The unique on-line grading services instantly grades solutions to hundred of computer exercises. It is specially devised to be used by philosophy instructors in a way that is useful to undergraduates of philosophy, computer science, mathematics, and linguistics. The book is a completely rewritten and much improved version of The Language of First-order Logic. Introductory material is presented in a more systematic and accessible (...) fashion. Advanced chapters include proofs of soundness and completeness for propositional and predicate logic, as well as an accessible sketch of Godel's first incompleteness theorem. The book is appropriate for a wide range of courses, from first logic courses for undergraduates to a first graduate logic course. The package includes four pieces of software: Tarski's World 5.0, a new version of the popular program that teaches the basic first-order language and its semantics; Fitch, a natural deduction proof environment for giving and checking first-order proofs; Boole, a program that facilitates the construction and checking of truth tables and related notions ; Submit, a program that allows students to submit exercises done with the above programs to the Grade Grinder, the automatic grading service. Grade reports are returned to the student and, if requested, to the student's instructor, eliminating the need for tedious checking of homework. All programs are available for Windows, Macintosh and Linux systems. Instructors do not need to use the programs themselves in order to be able to take advantage of their pedagogical value. More about the software can be found at lpl.stanford.edu. The price of a new text/software package includes one Registration ID, which must be used each time work is submitted to the grading service. Once activated, the Registration ID is not transferable. (shrink)