Category: Uncategorized

On FOM, Allen Hazen points to a review in Nature of Reviel Netz and William Noel’s The Archimedes Codex. Here’s Netz’s own report on the relevant part of the palimpsest in which Archimedes comes up with the definition of equality between infinities in terms of a one-to-one correspondence. Also, transcript of Nova segment on the…

Henry Kyburg, Professor of Philosophy and Computer Science at the University of Rochester and an eminent logician and formal epistemologist, passed away on October 30.

This list from Jon Cogburn’s blog is pretty funny. I like the Quine bit particularly.

An addition to the list of programming languages named after logicians (e.g., Gödel, Haskell, Curry): Carnap The Carnap Programming LanguageProcess oriented programming: shared data structures and the concurrent processes that act upon them. Carnap is a general purpose programming language for the next generation of many-core devices, many many-core systems and their applications. It introduces…

CSLI Lecture Notes are now part of the Stanford Medieval and Modern Thought Digitization Project. That means books such as Unger’s Cut-elimination, Normalization, and the Theory of Proofs, Troelstra’s Lectures on Linear Logic, Aczel’s Non-well-founded Sets, van Benthem’s Manual of Intensional Logic, and Goldblatt’s Logics of Time and Computation are now available online and for…

One of my favorite proof theory papers of all time: W. W. Tait. Normal derivability in classical logic. In: Jon Barwise, ed., The Syntax and Semantics of Infinitary Languages LNM 72. (Berlin: SPringer, 1968), pp. 204-236. Springer actually has this available online–which is neat, but of course only if your institution has access to the…

The Zeitschrift für mathematische Logik und Grundlagen der Mathematik was one of the few logic journals around in the mid 20th century. It started publishing in 1955, I think the only logic journals that are older than it are the Journal of Symbolic Logic (1936), the Archiv für mathematische Logik und Grundlagenforschung (1950) and Studia…

Looking through my CiteULike database today, I was reminded of this beautiful paper by Gallier, which tells you everything you wanted to know about the ordinal Γ0 and its proof-theoretic relevance. Section 6 is a wonderful overview of the theory of (constructive) countable ordinals. Jean H. Gallier. What’s so special about Kruskal’s theorem and the…

The Ackermann Award is the EACSL‘s award for outstanding dissertations in logic in computer science. This year’s award is shared by Dietmar BerwangerRWTH Aachen (Advisor: Erich Graedel)Thesis: Games and Logical Expressiveness Stéphane Lengrand Université de Paris VII and University of St. Andrews (Advisors: Delia Kesner and Roy Dyckhoff) Thesis: Normalization and Equivalence in Proof Theory…

Two new entries in the Stanford Encyclopedia just went on-line, brought to you by the authors and your friendly neighborhood History of Logic subject editors: Bolzano’s logic, by Jan SebestikThe Frege-Hilbert controversy, by Patricia Blanchette Also interesting: Facts, by Kevin Mulligan and Fabrice Correia