Category: Uncategorized

  • Anyone Got Good Frege Jokes? (Or Any Logic Jokes, Really?)

    Please add your favorite Frege joke in comments (or tweet @RrrichardZach with #fregejokes hashtag). Doesn’t have to be good. In fact, just any logic joke is fine.

  • Funded PhD Positions in Vienna (Logic in CS)

    Check out the funded doctoral program in logic in computer science! http://logic-cs.at/phd/ TU Wien, TU Graz, and JKU Linz are seeking exceptionally talented and motivated students for their joint doctoral program LogiCS. The LogiCS doctoral college focuses on interdisciplinary research topics covering (i) computational logic, and applications of logic to (ii) databases and artificial intelligence…

  • bpextra: entire deductions in bussproofs.sty

    The LaTeX package bussproofs.sty for typesetting natural deduction/sequent calculus proofs is nifty especially for its nice alignment of sequents.  By contrast to the proof.sty package, it doesn’t allow you to typeset missing parts of a proof, though. proofs.sty has the \deduce command for that; it typesets vertical dots instead of a horizontal inference line. I…

  • $7.5m Grant for HoTT!

    All-around awesome logician colleagues and friends Steve Awodey and Jeremy Avigad have netted a $7.5m, 5-year grant to develop Homotopy Type Theory! http://www.cmu.edu/news/stories/archives/2014/april/april28_awodeygrant.html HoTT awarded a MURI

  • Workshop on The Notion of Proof

    Conflicts with Vienna Summer of Logic, but very interesting: From http://cicm-conference.org/2014/cicm.php?event=nop&menu=general We have already witnessed the moment where chess-playing computers have surpassed humans. It might seem to be only a matter of time that computers will also surpass humans in mathematical theorem proving. In fact, the traditional notion of mathematical proof faces in the beginning…

  • Extended Deadline! CFP: Symposium on the Foundations of Mathematics

    CfP from http://sotfom.wordpress.com: Set theory is taken to serve as a foundation for mathematics. But it is well-known that there are set-theoretic statements that cannot be settled by the standard axioms of set theory. The Zermelo-Fraenkel axioms, with the Axiom of Choice (ZFC), are incomplete. The primary goal of this symposium is to explore the…

  • Vienna Summer of Logic: Call for Volunteers

    What is the Vienna Summer of Logic? With over 2000 expected participants, the Vienna Summer of Logic 2014 (VSL) will be the largest event in the history of logic. It will consist of twelve large conferences and numerous workshops, attracting researchers from all over the world. The VSL will take place 9th-24 July 2014, at…

  • Visiting Research Chair in Logic or Philosophy of Science at the University of Calgary

    US$25,000 for 4 months (September 2015 or January 2016) Contact: Brad Hector, Fulbright Canada Program Officer (Scholars) The University of Calgary is pleased to offer the opportunity for a Fulbright Visiting Research Chair in Logic or the Philosophy of Science. The visiting researcher will be a part of the Department of Philosophy and collaborate with a dynamic research…

  • Leslie Lamport wins Turing Award

    The Association for Computing Machinery has awarded the 2013 Turing Award (the Computer Science equivalent of the Nobel Prize Fields Medal Schock Prize) to Leslie Lamport at Microsoft Research for his work on formal specification and verification techniques, specifically the Temporal Logic of Actions and his work on fault tolerance in distributed systems. Not as…

  • Constructive Ordinals and the Consistency of PA

    Today’s the last of three lectures on Gentzen’s second proof of the consistency of PA in my proof theory course. a) Still looking for good resources on ordinal notations, esp., $latex <\epsilon_0$, especially around the question how one can “see” that they are well-ordered without mentioning that they are order-isomorphic to $latex \epsilon_0$  Takeuti has…