CSLI Publications (2011)
__Language Proof and Logic_ is available as a physical book with the software included on CD and as a downloadable package of software plus the book in PDF format. The all-electronic version is available from Openproof at ggweb.stanford.edu._ The textbook/software package covers first-order language in a method appropriate for first and second courses in logic. An on-line grading services instantly grades solutions to hundred of computer exercises. It is designed to be used by philosophy instructors teaching a logic course to undergraduates in philosophy, computer science, mathematics, and linguistics. Introductory material is presented in a 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 software package includes four programs: 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
|Categories||categorize this paper)|
|Buy the book||$1.51 used (98% off) $221.07 new Amazon page|
|Call number||BC71.B25 2011|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
A Proof–Theoretic Study of the Correspondence of Hybrid Logic and Classical Logic.H. Kushida & M. Okada - 2006 - Journal of Logic, Language and Information 16 (1):35-61.
A Proof-Theoretic Study of the Correspondence of Classical Logic and Modal Logic.H. Kushida & M. Okada - 2003 - Journal of Symbolic Logic 68 (4):1403-1414.
A Modal Interpretation of the Logic of Interrogation.Rani Nelken & Chung-Chieh Shan - 2006 - Journal of Logic, Language and Information 15 (3):251-271.
Reductive Logic and Proof-Search: Proof Theory, Semantics, and Control.David J. Pym - 2004 - Oxford University Press.
On the Proof of Solovay's Theorem.Dick Jongh, Marc Jumelet & Franco Montagna - 1991 - Studia Logica 50 (1):51 - 69.
The Syllogistic with Unity.Ian Pratt-Hartmann - 2013 - Journal of Philosophical Logic 42 (2):391-407.
Uniqueness of Normal Proofs in Implicational Intuitionistic Logic.Takahito Aoto - 1999 - Journal of Logic, Language and Information 8 (2):217-242.
Logic, Language-Games and Information: Kantian Themes in the Philosophy of Logic.Jaakko Hintikka - 1973 - Oxford, Clarendon Press.
A New Correctness Criterion for Cyclic Proof Nets.V. Michele Abrusci & Elena Maringelli - 1998 - Journal of Logic, Language and Information 7 (4):449-459.
Added to index2011-05-21
Total downloads9 ( #463,889 of 2,171,976 )
Recent downloads (6 months)1 ( #326,556 of 2,171,976 )
How can I increase my downloads?