There's not much concrete I want to do in this period until I've got through
the ongoing work bringing SP 28 onto line. That said, I should be done by the
end of this month.
LPC has its origins in a discrete maths course I taught at Stony Brook in 2003.
It was the last academic post I held or am likely to hold. The course drew the wrath
of the old guard in the department who were going to arraign me in front of a committee.
I have somewhere a transcript of my resignation and statement of my position on teaching CS.
It is actually worth a read.
As regards LPC 2nd edition, it is less influenced by the requirements of Stony Brook CS dept.
than my original notes, but I'd planned a 3rd edition. I wanted to cover model theory for
first-order logic and then to discuss Skolem's Paradox and ontological reduction. Other
possible candidates for inclusion are Herbrand's theorem, Paradoxes of Strict Implication,
and possibly a soundness and completeness proof for the logic system in the book. The system
was specifically designed to encourage proof skills in students and is original to the book AFAIK.
This would be packaged with a new program described.
"my proposal is to separate LPC material from Shen intricacies for people who can be driven away by
this. One way, in my opinion, is to provide webpage with all the required bits: provedit!, afst,
resolution etc. It would make easier to control Shen version and concrete backend in order to ensure
we have working setup for users."
One thing that emerged from a poll of over 200 students at Stony Brook is that only 8 preferred using
paper to using a computer to do proofs. Sequent proofs really require some computer support
unlike Fitch or Lemmon's natural deduction systems which do lend themselves to paper.
The original program should still run but IMO it looks a bit clunky as my old code sometimes
does to me. There is a new program which is essentially a shell - it can be programmed to
work with any logic presentable in sequent notation. It is shorter, neater and more
generally usable than the old program. I have begun to link this up to a graphical interface
so that proof assistants for any logic can be run off easily. I stopped work on it because
of commitments elsewhere.
It is true that the program has become somewhat detached from the text and people have to hunt it down.
I expect that many people read the book w.o. even assaying a proof. I don't think that one need know
much Shen to do a proof - my students knew none. Only if you want to write tactics do you have to
program. LPC contains some gentle examples in a chapter.
The suggestions here are useful and the system certainly deserves its own space and when the current workload
is done I'll revisit this question next month.
Mark