Complexity measures of proofs

In the last post, I pointed to some interesting work on cut-elimination and complexity of proofs. This reminded me of Richard Statman's wonderful dissertation (Structural complexity of proofs, Ph.D. thesis, Stanford University, 1974). The two most widely investigated measures of proof complexity are size (number of symbols) and length (number of steps). Statman and Orevkov's … Continue reading Complexity measures of proofs

Eliminating cuts

If you've wondered what all this "cut elimination" business is about, here's a nice blog entry (on That Logic Blog) which gives a nice introduction. Jon points out that proofs with cut have (at least--depends on the logic) exponential speedup over proofs with cut. This result is due to Statman and Orevkov. Jon points to … Continue reading Eliminating cuts

Begging the Question

John asks if logicians should give in in the face of rising acceptance of the use of "begging the question" for "raising the question." I agree with the commenters: we should not. Also check out this delightful (and correct) use of "begs the question," posted by Sean Carroll: I once heard an astrophysics seminar with … Continue reading Begging the Question

Charset Problem Fixed

I've been irritated for a long time that the "ö" in "Gödel" doesn't show up right on this blog. The problem was caused by the web server setting the charset in the header, thus overriding the UTF-8 charset declaration in the pages themselves. It should be fixed now, but let me know if I still … Continue reading Charset Problem Fixed

The New Yorker on Gödel and Einstein

Jim Holt reviews two new books on Gödel and Einstein, and Yourgrau's A World Without Time. It's a nice little story about what Gödel and Einstein talked about in their daily walks to the office. The books are Rebecca Goldstein's Incompleteness (NYT review here) and John S. Rigden's Einstein 1905: The Standard of Greatness.

Philosophia Mathematica now online through OUP

Philosophia Mathematica, the only (and hence, the) journal on philosophy of mathematics, is now being published/distributed by Oxford University Press (for cooperation with the Canadian Society for History and Philosophy of Mathematics/Société canadienne d'histoire et de philosophie des mathématiques. That means, in particular, that it's now (finally!) available online. The latest issue (February 2005) even … Continue reading Philosophia Mathematica now online through OUP

Workshop on Structures and Deduction at ICALP

The "deep inference/calculus of structures" gang is organizing a workshop at ICALP (July 16-17) on "Structures and Deduction: The Quest for the Essence of Proofs." Deadline for paper submissions is April 15. Another opportunity to visit Lisbon.

Proofs and Types

Proofs and Types, the classic 1989 proof theory text by Jean-Yves Girard (translated and with appendices by Paul Taylor and Yves Lafont) has been online for over a year, I just found out. Now that Troelstra/Schwichtenberg is around, perhaps no longer the first place you'd go to read up on the Curry-Howard isomorphism and normalization, … Continue reading Proofs and Types

Wff ‘n Proof

I heard about this from a colleague, who played it as a kid, and then I saw it today on another colleague's shelf, who promptly gave it to me as a gift (Thanks, Jack!). It is some kind of game with wff's (in Polish notation), I haven't looked at the instructions yet. I thought something … Continue reading Wff ‘n Proof

Computational Models of Scientific Reasoning & Applications IV

Brian has already linked to this year's Berkeley/Austin Formal Epistemology workshop and the Pitt/CMU Symposium on Imprecise Probabilities. Here's a related event: CMSRA-IV will be held September 21-23 in Lisbon. The mission statement reads, in part, "The CMSRA workshops are designed to promote research of high-level cognitive reasoning that addresses both the logico-philosophical issues surrounding … Continue reading Computational Models of Scientific Reasoning & Applications IV

New Logic Blog

Jon Cohen has started That Logic Blog with a post on symmetry in propositional logic and connections to problems of automorphism of colored graphs. And I fully agree with his statement that "while many people may believe [propositional logic] to be a completely mined out and somewhat trivial area, this is not so." Especially if … Continue reading New Logic Blog

Got a Paper on Cut Elimination?

If you have a paper on cut elimination and are looking for a journal, how about Studia Logica? There's a special issue on cut elimination in preparation; call for papers here. Deadline March 31.