http:^^csli-www.stanford.edu^hp^index.html

This data set contains WWW-pages collected from computer science departments of various universities

<HR size=4><P>

<A NAME="Tarski"><STRONG>Tarski "Lite"</STRONG> (Mac or PC)</A><P>

<CENTER> 
<TABLE BORDER=6 ALIGN=CENTER VALIGN=TOP CELLPADDING=7>

        <TR>
        <TD VALIGN=TOP >

<!WA32><A HREF="http://csli-www.stanford.edu/hp/Tarski-Mac-100.GIF"><!WA33><IMG SRC="http://csli-www.stanford.edu/hp/Tarski-Mac-25.GIF" border=0 ALT="Mac cover"></A> 

        </TD>
        <TD VALIGN=TOP>

 <!WA34><A HREF="http://csli-www.stanford.edu/hp/Tarski-IBM-100.GIF"><!WA35><IMG SRC="http://csli-www.stanford.edu/hp/Tarski-IBM-25.GIF" border=0 ALT="Windows cover"></A>

        </TD>
        </TR>
</TABLE>
</CENTER> 
<P>

  

<STRONG>Tarski's World</STRONG> 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.  <STRONG>Tarski's World</STRONG> allows the students to build
three-dimensional worlds and to 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.  <P>

<STRONG>Tarski's World</STRONG> is available in two ways, either alone (called <STRONG>Tarski's World 4.0</STRONG> or <STRONG>Tarski "Lite"</STRONG>) or as part of the logic textbook/software package called <STRONG>The Language of First-order Logic</STRONG>.<P>
  
<STRONG>Tarski "Lite"</STRONG>, the stand-alone 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.    

<BLOCKQUOTE>"If you have had a small amount of experience with a Macintosh and enjoy logical matters, then you will almost certainly enjoy using (or just playing with) this software for the Mac."  --George Boolos, Journal of Symbolic Logic</BLOCKQUOTE>

<BLOCKQUOTE>"The authors are pioneers.  [<STRONG>Tarski's World</STRONG>] is the only program that I know for teaching first-order semantics, and it sets a high standard.  I warmly recommend it."  --Wilfrid Hodges, Queen Mary College</BLOCKQUOTE>

<STRONG>Tarski "Lite"</STRONG> is available for Macintosh or Microsoft Windows.  A version of the software for computers running NeXTstep is also available.  To receive it, purchase a copy of either the Macintosh or Windows version and follow the instructions contained in the book.<P>

<!WA36><A HREF="http://csli-www.stanford.edu/hp/Ordering-info.html#Tarski"><!WA37><IMG SRC="http://csli-www.stanford.edu/hp/order-button.GIF" border=0> Ordering information</A>     <!WA38><A HREF="http://csli-www.stanford.edu/hp/Tarski1.html"><!WA39><IMG SRC="http://csli-www.stanford.edu/hp/tarski-button.GIF" border=0> Show me Tarski's World</A><P>
[<!WA40><A HREF="#Top">Top</A> | <!WA41><A HREF="http://csli-www.stanford.edu/hp/TarskiTOC.html">Tarski "Lite" Table of Contents</A> | <!WA42><A HREF="http://csli-www.stanford.edu/hp/Version-info.html">Information for current users</A> | <!WA43><A HREF="http://csli-www.stanford.edu/hp/Tarski5.html">Acknowledgements</A>] 
<HR size=4><P>
<A NAME="Turing"><STRONG>Turing's World</STRONG></A><P>

<CENTER> 
<TABLE BORDER=6 ALIGN=CENTER VALIGN=TOP CELLPADDING=7>

        <TR>
        <TD VALIGN=TOP >
<!WA44><A HREF="http://csli-www.stanford.edu/hp/Turing-Mac-100.GIF"><!WA45><IMG SRC="http://csli-www.stanford.edu/hp/Turing-Mac-25.GIF" border=0 ALT="Turing's World cover"></A>  
        </TD>
        </TR>
</TABLE>
</CENTER> 
<P>



<STRONG>Turing's World</STRONG> 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.<P>

<STRONG>Turing's World</STRONG> introduces users to the key concepts 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.<P>

 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 expore these alternative machines.

<BLOCKQUOTE>"<STRONG>Turing's World</STRONG> is a delight....I heartily recommend [it]."  --James Moor, Teaching Philosophy</BLOCKQUOTE>

<BLOCKQUOTE>"<STRONG>Turing's World</STRONG> quite literally revolutionizes the way the fundamental theoretical issues of computing can be taught."  
--Keith Devlin, The Guardian
</BLOCKQUOTE>
<BLOCKQUOTE>"There is not the slightest hint of jargon anywhere in [<STRONG>Turing's World</STRONG>].  The explanations are so direct that a beginner will understand them and an old hand will enjoy them."  
--Wilfrid Hodges, Queen Mary College
</BLOCKQUOTE>
<BLOCKQUOTE>"The program and manual are the best introduction to Turing machines the reviewer knows of, or can imagine."  
--George Boolos, Journal of Symbolic Logic
</BLOCKQUOTE>

<!WA46><A HREF="http://csli-www.stanford.edu/hp/Ordering-info.html#Turing"><!WA47><IMG SRC="http://csli-www.stanford.edu/hp/order-button.GIF" border=0> Ordering information</A>     <!WA48><A HREF="http://csli-www.stanford.edu/hp/Turing1.html"><!WA49><IMG SRC="http://csli-www.stanford.edu/hp/turing-button.GIF" border=0> Show me Turing's World</A><P>
[<!WA50><A HREF="#Top">Top</A> | <!WA51><A HREF="http://csli-www.stanford.edu/hp/TuringTOC.html">Turing's World Table of Contents</A> | <!WA52><A HREF="http://csli-www.stanford.edu/hp/Version-info.html">Information for current users</A> | <!WA53><A HREF="http://csli-www.stanford.edu/hp/Turing5.html">Acknowledgements</A>]

<HR size=4><P>

<!WA54><A HREF="http://csli-www.stanford.edu/hp/Barwise-Etch-100.GIF"><!WA55><IMG SRC="http://csli-www.stanford.edu/hp/Barwise-Etch-25.GIF" border=0></A>  <STRONG>John Etchemendy (left) and Jon Barwise (right) </STRONG><P>

<STRONG><!WA56><A HREF="http://www.phil.indiana.edu/~barwise/barwise.html">Jon Barwise</A></STRONG> is a professor of philosophy, mathematics, and computer science at Indiana University in Bloomington.  His email address is <!WA57><A HREF="mailto:[e-mail]">[e-mail].</A><P>

<STRONG><!WA58><A HREF="http://csli-www.stanford.edu/hp/etchemendy.html">John Etchemendy</A></STRONG> is a professor of philosophy and symbolic systems at Stanford University.  His email address is <!WA59><A HREF="mailto:[e-mail]">[e-mail].</A><P>

<HR size=4>

<!WA60><A HREF="http://www.stanford.edu/"><!WA61><IMG SRC="http://csli-www.stanford.edu/hp/stanford.seal56.gif" border=0> Stanford Home Page</A> <!WA62><A HREF="http://csli-www.stanford.edu/csli/"><!WA63><IMG SRC="http://csli-www.stanford.edu/hp/logo.csli.gif" border=0> CSLI Home Page;</A>  <!WA64><A HREF="http://csli-www.stanford.edu/publications/">CSLI Publications Home Page</A>  



<HR size=4>


</BODY>
</HTML>