PhD, Postdoc with Rosalie Iemhoff

Postdoc position in Logic at Utrecht University, the Netherlands. The postdoc is embedded in the research project “Optimal Proofs” funded by the Netherlands Organization for Scientific Research led by Dr. Rosalie Iemhoff, Department of Philosophy and Religious Studies, Utrecht University. The project in mathematical and philosophical logic is concerned with formalization in general and proof … Continue reading PhD, Postdoc with Rosalie Iemhoff

Raymond Smullyan

Proof by legerdemain

Peli Grietzer shared a blog post by David Auerbach on Twitter yesterday containing the following lovely quote about Smullyan and Carnap: I particularly delighted in playing tricks on the philosopher Rudolf Carnap; he was the perfect audience! (Most scientists and mathematicians are; they are so honest themselves 'that they have great difficulty in seeing through … Continue reading Proof by legerdemain

Why φ?

Yesterday, @gravbeast asked on Twitter, Does anyone know why we traditionally use Greek phi and psi for metasyntactic variables representing arbitrary logic formulas? Is it just because 'formula' begins with an 'f' sound? And chi was being used for other things? Although Whitehead and Russell already used φ and ψ for propositional functions, the convention … Continue reading Why φ?

Logic Colloquium, Udine

The European Summer Meeting of the Association of Symbolic Logic will be in Udine, just north of Venice, July 23-28. Abstracts for contributed talks are due on April 27. Student members of the ASL are eligible for travel grants! lc18.uniud.it  

Ptolemaic Astronomy

Working on the chapters on counterfactual conditionals for the Open Logic Project, I needed some illustrations for David Lewis's sphere models, which he jokingly called "Ptolemaic astronomy." Since Franz Berto joked that this should just require \usepackage{ptolemaicastronomy}, I wrote some LaTeX macros to make this easier using TikZ. You can download ptolemaicastronomy.sty (it should work … Continue reading Ptolemaic Astronomy

Modal Logic! Propositional Logic! Tableaux!

Lots of new stuff in the Open Logic repository! I’m teaching modal logic this term, and my ambitious goal is to have, by the end of term or soon thereafter, another nicely organized and typeset open textbook on modal logic. The working title is Boxes and Diamonds, and you can check out what’s there so far on the builds site. This project of course required new material on modal logic.  So far this consists in revised and expanded notes by our dear late colleague Aldo Antonelli. These now live in content/normal-modal-logic and cover relational models for normal modal logics, frame correspondence, derivations, canonical models, and filtrations. So that’s one big exciting addition. Since the OLP didn’t cover propositional logic separately, I just now added that part as well so I can include it as review chapters. There’s a short chapter on truth-value semantics in propositional-logic/syntax-and-semantics. However, all the proof systems and completeness for them are covered as well. I didn’t write anything new for those, but rather made the respective sections for first-order logic flexible. OLP now has an FOL “tag”: if FOL is set to true, and you compile the chapter on the sequent calculus, say, you get the full first-order version with soundness proved relative to first-order structures. If FOL is set to false, the rules for the quantifiers and identity are omitted, and soundness is proved relative to propositional valuations. The same goes for the completeness theorem: with FOL set to false, it leaves out the Henkin construction and constructs a valuation from a complete consistent set rather than a term model from a saturated complete consistent set. This works fine if you need only one or the other; if you want both, you’ll currently get a lot of repetition. I hope to add code so that you can first compile without FOL then with, and the second pass will refer to the text produced by the first pass rather than do everything from scratch. You can compare the two versions in the complete PDF. Proofs systems for modal logics are tricky; and many systems don’t have nice, say, natural deduction systems. The tableau method, however, works very nicely and uniformly. The OLP didn’t have a chapter on tableaux, so this motivated me to add that as well. Tableaux are also often covered in intro logic courses (often called “truth trees”), so having them as a proof system included has the added advantage of tying in better with introductory logic material. I opted for prefixed tableaux (true and false are explicitly labelled, rather than implicit in negated and unnegated formulas), since that lends itself more easily to a comparison with the sequent calculus, but also because it extends directly to many-valued logics. The material on tableaux lives in first-order-logic/tableaux. Thanks to Clea Rees for the the prooftrees package, which made it much easier to typeset the tableaux, and to Alex Kocurek for his tips on doing modal diagrams in Tikz.

Logic Courseware?

Kit Fine asked me for suggestions of online logic materials that have some interactive component, i.e., ways for students to build truth-tables, evaluate arguments, translate sentences, build models, and do derivations; ideally it would not just provide feedback to the student but also grade problems and tests. There is of course Barwise & Etchemendy's Language, … Continue reading Logic Courseware?

Citations in your CV

I drank the Koolaid and set up my CV so it's generated automatically from a YAML file with a Pandoc template. The basic functionality is copied from bmschmidt/CV-pandoc-healy. My version generates the bibliography from a BibTeX file however, using biblatex.  The biblatex code is tweaked to include links to PhilPapers and Google Scholar citation counts. … Continue reading Citations in your CV

Illuminated Manuscript of Aristotle, Averroes, and Ramon Llull Charging the Tower of Falsehood

Jonathan Greig (LMU Munich) posted the picture above to Twitter the other day, crediting Laura Castelli with finding it. It's from a 14th Century illuminated manuscript by Thomas Le Myésier, Breviculum ex artibus Raimundi Lulli electum, and depicts Aristotle, Averroes, and Ramon Llull leading an army charging the Tower of Falsehood. I put a full … Continue reading Illuminated Manuscript of Aristotle, Averroes, and Ramon Llull Charging the Tower of Falsehood

New in Print: forall x (Summer 2017 edition), and Incompleteness and Computability

New on Amazon: the print version of the Summer 2017 edition of forall x: Calgary Remix, as well as the text I made for Phil 479 (Logic III) last term, Incompleteness and Computability. The new edition of forall x includes a number of corrections submitted by Richard Lawrence, who taught from it at Berkeley in the Spring term. I’ve also noticed that if you don’t want Amazon to distribute the book to libraries and bookstores, you can make it a lot cheaper: USD 7.62 instead of USD 11.35.  Of course, the PDF is still free. (There’s now also a version for printing on letter-sized paper.) With Richard’s and Aaron’s help, the solutions manual now matches the text and has fewer errors.

Links to Amazon: US UK Canada Germany

The print version of Incompleteness and Computability incorporates a number of corrections and improvements suggested by my Logic III students. Compared to the version announced earlier, it also includes the two new chapters on Models of Arithmetic and on Second-order Logic. It, too, is still available free in both PDF and source code.

Links to Amazon: US UK Canada Germany

Aldo Antonelli’s last paper

Aldo Antonelli's last paper, "Completeness and Decidability of General First-Order Logic (with a Detour Through the Guarded Fragment)" is now out in the most recent issue of the Journal of Philosophical Logic. This paper investigates the “general” semantics for first-order logic introduced to Antonelli (Review of Symbolic Logic 6(4), 637–58, 2013): a sound and complete … Continue reading Aldo Antonelli’s last paper

CfP: Quantifiers and Determiners (part of ESSLI 2017)

QUAD: QUantifiers And Determiners http://www.lirmm.fr/quad Toulouse, Monday  July 17 --- Friday July 21:  17:00-18:30 ESSLLI 2017 workshop Schedule: deadline for submissions:  17 March 2017 submission website: https://easychair.org/conferences/?conf=quad2017 notification to authors:  15 April 2017 final version due: 19 May 2017 conference: 17-21 July 2017 Presentation: The compositional interpretation of determiners relies on quantifiers  — in a … Continue reading CfP: Quantifiers and Determiners (part of ESSLI 2017)