Submitted by Richard Zach on Tue, 03/24/2009 - 11:13pm
We're having a little logic conference this weekend in Calgary. If you're in the area, please come! All talks in 1253 Social Sciences, University of Calgary. Relevant papers may be found by following the links below
Nuel Belnap (Pittsburgh)
Friday, March 27, 4 pm
Submitted by Richard Zach on Tue, 03/03/2009 - 1:56am
Submitted by Richard Zach on Sat, 02/28/2009 - 7:19pm
Submitted by Richard Zach on Sat, 02/28/2009 - 6:26pm
On March 27, 2009, the people behind Language Proof and Logic will have a little meeting on the various courseware packages they have now and are currently developing:
Openproof day will be a day of events discussing a variety of topics related to the work of the project, including:
* Presentation of existing courseware packages including plans for future improvements,
Submitted by Richard Zach on Tue, 02/24/2009 - 6:01am
Submitted by Richard Zach on Tue, 02/24/2009 - 1:32am
With the kind permission of Brian Leiter, here's a breakout of the Canadian philosophy departments by specialty according to the 2009 Philosophical Gourmet Report. Major changes over the last (2008-10) edition: The Guelph-Laurier-McMaster program is no longer ranked, and neither is Waterloo. The "local means", i.e., mean scores from Canadian evaluators, are no longer reported. That's a bit unfortunate, but it probably makes no difference as far as the rank-ordering goes.
Submitted by Richard Zach on Tue, 02/24/2009 - 1:18am
The Conservative government's budget includes additional funding for Canada's granting councils to expand their graduate scholarship programs. The Social Sciences and Humanities Research Council of Canada stands to gain an additional $17.5 million, or 500 additional PhD scholarships and 1,000 additional MA scholarships. The catch: SSHRC's money is earmarked for "business-related degrees".
If you're Canadian, please sign the petition against this circulated by Niki Ashton, MP.
Submitted by Richard Zach on Mon, 02/09/2009 - 4:29am
In Krister Segerberg's modal logic seminar here in Calgary, we were talking about propositional dynamic logic last week. PDL was originally introduced (by Vaughn Pratt in the early 70's) to reason about programs. In the language, you have propositional variables but then also variables for (indeterministic) programs. Moreover, you have complex terms for programs, e.g., if α and β are programs then α ∪ β is "either do α or do β", α;β is "first do α then do β", α* is "do α 0 or more times.
Submitted by Richard Zach on Thu, 02/05/2009 - 6:35pm
I'm a bit late with this, but if you haven't heard, here are a couple of interesting new blogs:
Submitted by Richard Zach on Thu, 02/05/2009 - 2:53am
Submitted by Richard Zach on Wed, 01/14/2009 - 10:44pm
Logic I exercise: Formalize "Every day each of us says the dumbest thing we are going to say that day." Is it logically true?
Submitted by Richard Zach on Wed, 01/14/2009 - 4:04pm
The submission deadline for the July conference Computability in Europe is drawing near (Jan 20). I hope there will be at least a few papers on history and philosophy of computability--the PC chair tells me that so far there are none!
Submitted by Richard Zach on Tue, 01/13/2009 - 6:30pm
Arne Næss has died at the age of 96. He was the last surviving member of the "periphery" of the Vienna Circle.
Submitted by Richard Zach on Wed, 12/17/2008 - 9:03am
Submitted by Richard Zach on Wed, 12/17/2008 - 8:31am
Submitted by Richard Zach on Thu, 11/27/2008 - 1:16am
In addition to the new special issue celebrating the 50th anniversary of Gödel's Dialectica interpretation, Wiley-Blackwell has made the original Dialectica issue in which it appeared freely available. That issue itself was a Festschrift in honour of Paul Bernays's 70th birthday.
Submitted by Richard Zach on Tue, 11/18/2008 - 3:39am
Submitted by Richard Zach on Mon, 11/17/2008 - 6:11pm
Submitted by Richard Zach on Mon, 11/17/2008 - 5:57pm
Via Theorem(e), I've come across the webpage of Konrad Zdanowski, a logician at the Polish Academy and Paris 7. His papers (mostly on arithmetic) all look incredibly interesting, he has lecture notes on Peano arithmetic, and there's also a paper on 2nd order intuitionistic propositional logic, which is somewhat related to my own research.
Submitted by Richard Zach on Tue, 11/11/2008 - 5:10pm
Sitting in a talk at CMU by Bill Tait on cut elimnation for predicative systems. His approach, in contrast to Rathjen and Takeuti, is to try to get the cut-elimination proof to be mostly (or even, only) about the proofs, and not about proofs and (mostly) ordinal notation systems. He's using the original Tait calculus, in which formulas are all propositional, but infinitary. His cut-elimination theorem applies in all kinds of cases (essentially up through predicative arithmetic), which I hadn't realized before.