CfP: 2015 Logic Colloquium in Helsinki

First Announcement & Call for Abstracts Logic Colloquium 2015European Summer Meeting of the Association for Symbolic Logic Helsinki, Finland, 3-8 August 2015 http://www.helsinki.fi/lc2015 The annual European Summer Meeting of the Association for Symbolic Logic, the Logic Colloquium 2015 (LC 2015), will be organized in Helsinki, Finland, 3-8 August 2015. Logic Colloquium 2015 is co-located with … Continue reading CfP: 2015 Logic Colloquium in Helsinki

Brilliance and Other Causes of Academic Gender Gaps

Every mathematician and philosopher should watch this video by Sarah-Jane Leslie (Philosophy, Princeton) on her study with Andrei Cimpian (Psych, Illinois). Takes just 11 minutes. [youtube https://www.youtube.com/watch?v=FM6mbSiD3eA] Then you can go and read the original study in Science or any of the writeups in, e.g., the Science news blog, Chronicle, Daily Nous, etc.

Logical Operators in the SEP

The Stanford Encyclopedia of Philosophy now has entries on: Negation (Laurence R. Horn and Heinrich Wansing) Disjunction (Ray Jennings and Andrew Hartline) Indicative Conditionals (Dorothy Edgington) Quantifiers and Quantificiation (Gabriel Uzquiano) Identity (Harold Noonan and Ben Curtis)

Nerlim: a Master Bibliography Style that Allows Books to have both Authors and Editors

If you're using BibTeX and LaTeX and are doing any kind of scholarly/humanistic work, I'm sure you've run into this annoying problem: BibTeX always complains when a book has both an author and an editor. That's a problem when, say, you want to include Gödel, K., 1986. Collected Works, vol. I. S. Feferman et al., … Continue reading Nerlim: a Master Bibliography Style that Allows Books to have both Authors and Editors

Adolf Lindenbaum

Jan Zygmunt and Robert Purdy have a paper ("Adolf Lindenbaum: Notes on his Life, with Bibliography and Selected References", open access) in the latest issue of Logica Universalis detailing what little is known about the life of Adolf Lindenbaum (1904-1941). It includes a complete bibliography of Lindenbaum's own publications and public lectures, as well as … Continue reading Adolf Lindenbaum

Two New(ish) Surveys on Gödel’s Incompleteness Theorems

Gödel's incompleteness theorems have many variants: semantic vs. syntactic versions, which specific theory is taken as basic, what model of computability is used, which logical system is assumed to underlie the provability relation, how syntax is arithmetized, what hypotheses the theorem itself uses (soundness, consistency, $latex \omega$-consistency, etc.). These result in trade-offs regarding simplicity of … Continue reading Two New(ish) Surveys on Gödel’s Incompleteness Theorems

Possible Postdoc on Genesis of Mathematical Knowledge

Via the APMP list: Expressions of interest are invited for a postdoc grant (financed by Junta de Andalucia) associated with the following research project:  “THE GENESIS OF MATHEMATICAL KNOWLEDGE: COGNITION, HISTORY, PRACTICES” (P12-HUM-1216). IP: Jose Ferreiros Contact: josef@us.es The grant consists in a 2-year research contract to be held at the University of Sevilla. Salary … Continue reading Possible Postdoc on Genesis of Mathematical Knowledge

Kalmár’s Compleness Proof

Dana Scott's proof reminded commenter "fbou" of Kalmár's 1935 completeness proof. (Original paper in German on the Hungarian Kalmár site.) Mendelsohn's Introduction to Mathematical Logic also uses this to prove completeness of propositional logic. Here it is (slightly corrected): We need the following lemma: Let $latex v$ be a truth-value assignment to the propositional variables … Continue reading Kalmár’s Compleness Proof

Dana Scott’s Favorite Completeness Proof

Last week I gave my decision problem talk at Berkeley. I briefly mentioned the 1917/18 Hilbert/Bernays completeness proof for propositional logic. It (as well as Post's 1921 completeness proof) made essential use of provable equivalence of a formula with its conjunctive normal form. Dana Scott asked who first gave (something like) the following simple completeness … Continue reading Dana Scott’s Favorite Completeness Proof

Lectures on the Epsilon Calculus

Back in 2009, I taught a short course on the epsilon calculus at the Vienna University of Technology.  I wrote up some of the material, intending to turn them into something longer.  I haven't had time to do that, but someone might find what I did helpful. So I put it up on arXiv: http://arxiv.org/abs/1411.3629