From rzach at ucalgary.ca  Tue Feb 25 19:49:20 2014
From: rzach at ucalgary.ca (Richard Zach)
Date: Tue Feb 25 19:49:34 2014
Subject: [OpenLogic] News
Message-ID: <530D5630.8040304@ucalgary.ca>

Hi all,

1) I talked to Dana who said she's got some time to do some work, so I 
suggested she meet up with Nicole to get last term's notes/corrections 
into the repository.

2) Assuming that these include Turing machines, I've also tasked her to 
find the best/easiest/standard way to LaTeXify the state transition 
diagrams. If anyone's got ideas/suggestions for that or other 
Turing-machine-diagaram-related stuff, let her/us know.

3) Reminder that a) the functionality to automatically replace words 
(eg, formula/wff or stucture/intterpretation/model is there---to make 
the best use of it we should have a list of which words/terms should be 
so treated. Please add your favorite tokens to the end of: 
https://github.com/OpenLogicProject/OpenLogic/wiki/Tokenized-Text

4) Jeremy Avigad is going to provide the notes to his two advanced logic 
courses as well, so we'll have material for incompleteness and recursive 
functions as well.

-R

-- 
Richard Zach ..... http://www.ucalgary.ca/~rzach/
Professor,             Department  of  Philosophy
University of Calgary, Calgary AB T2N 1N4, Canada

From antonelli at ucdavis.edu  Tue Feb 25 22:29:40 2014
From: antonelli at ucdavis.edu (G. Aldo Antonelli)
Date: Tue Feb 25 22:30:24 2014
Subject: [OpenLogic] News
In-Reply-To: <530D5630.8040304@ucalgary.ca>
References: <530D5630.8040304@ucalgary.ca>
Message-ID: <530D7BC4.8070101@ucdavis.edu>

Sorry for the long radio silence -- super busy quarter.

On 2/25/14 6:49 PM, Richard Zach wrote:

> 2) Assuming that these include Turing machines, I've also tasked her to
> find the best/easiest/standard way to LaTeXify the state transition
> diagrams. If anyone's got ideas/suggestions for that or other
> Turing-machine-diagaram-related stuff, let her/us know.

TikZ is probably the best option. The learning curve is a bit steep (or 
at least was/still is for me) but the results are totally worth it.

> 4) Jeremy Avigad is going to provide the notes to his two advanced logic
> courses as well, so we'll have material for incompleteness and recursive
> functions as well.

I have an essentially complete set of notes for basic modal logic 
(completeness and correspondence for the systems obtained by the various 
combinations of K with D, T, B, 4, 5). Let me know when you need them 
and I'll send them along.

-- Aldo


*****************************************
G. Aldo Antonelli
Professor of Philosophy
University of California, Davis
http://www.aldo-antonelli.org
antonelli@ucdavis.edu +1 530 554 1368