Logblog: Richard Zach's Logic Blog

University of Calgary

UofC Navigation

You are looking at the old blog archive. LogBlog has moved to richardzach.org.

If you'd like to receive updates on new posts, please subscribe there!

Submitted by Richard Zach on Fri, 05/08/2015 - 9:02am

A new open-source advanced logic text, announced earlier this week on the new blog: richardzach.org. Please update your links and subscriptions.

- Read more about Open Logic Project
- Log in to post comments

Submitted by Richard Zach on Sun, 03/22/2015 - 10:16am

I've decided to move the blog to WordPress. It now lives at richardzach.org.

Please update your feed reader subscriptions. The feed URL is http://richardzach.org/feed/

- Read more about The LogBlog is Moving!
- Log in to post comments

Submitted by Richard Zach on Sat, 02/21/2015 - 2:47pm

The Mathematics Genealogy project is a huge database of mathematicians, where and when they got their degrees, and who their advisors were. (There's also a wiki-based Philosophy Genealogy.) Nice pastime when the polar vortex keeps you from leaving the house: find famous people in your academic family tree.

If you're in the Mathematics Genealogy, you can use Geneagrapher by David Alber to produce a graphical genealogy. It's pretty amazing. Here is mine (click for full size):

TIL: Mersenne and Copernicus are in that tree.

- Read more about Academic Genealogy Graphed
- 1 comment
- Log in to post comments

Submitted by Richard Zach on Fri, 02/20/2015 - 9:01am

Dates: June 10-12, 2015

Location: Montpellier, France

Submission deadline: April 1, 2015

This workshop aims at promoting work on Hilbert’s epsilon calculus in a number of relevant fields ranging from Philosophy and Mathematics to Linguistics and Informatics. The Epsilon and Tau operators were introduced by David Hilbert, inspired by Russell's Iota operator for definite descriptions, as binding operators that form terms from formulae. One of their main features is that substitution with Epsilon and Tau terms expresses quantification. This leads to a calculus which is a strict and conservative extension of First Order Predicate Logic. The calculus was developed for studying first order logic in view of the program of providing a rigorous foundation of mathematics via syntactic consistency proofs. The first relevant outcomes that certainly deserve a mention are the two "Epsilon Theorems" (similar to quantifiers elimination), the first correct proof of Herbrand’s theorem or the use of the Epsilon operator in Bourbaki’s Éléments de Mathématique. Nowadays the interest in the Epsilon substitution method has spread in a variety of fields: Mathematics, Logic, Philosophy, History of Mathematics, Linguistic, Type Theory, Computer science, Category Theory and others.

The workshop welcomes submissions of up to 4 (but not less than 2) pages. Usual spacing, font and margin should be used (single-spaced, 11pt or larger, and 1 inch margin on A4 or letter size paper). Abstracts should be submitted by April 1st, 2015 as pdf files through the EasyChair conference system ( https://easychair.org/conferences/?conf=epsilon2015). An indicative list of themes that are of particular interest to the conference are (non-exhaustive):

- History of Logic
- Philosophy
- Proof theoryModel theory
- Category theory
- Type theory
- Quantification in Natural language
- Noun-Phrases Semantics
- Proof Assistants (e.g. Coq, Isabelle, ... )
- Other subnectors (e.g. Russell's iota, μ-operator, ... )

Abstracts will be reviewed by members of the program committee, and, where appropriate, outside reviewers. The organizers will be responsible for making decisions partly in consultation with the program committee. Notifications will be made by May 1st, 2015. Selected papers from the workshop will appear as a special volume in Journal of Logics and their Applications
## Important dates

## Invited speakers

## Program Committee

## Organizers / workshop co-chairs

April 1, 2015: Submission deadline

May 1, 2015: Notification of acceptance

June 10-12, 2015: Workshop

Claus-Peter Wirth (University of Saarland): The descriptive operators iota, tau and epsilon - on their origin, partial and complete specification, model-theoretic semantics, practical applicability (with the support of the Hilbert Bernays Project (sponsored by IFCoLog)).

Vito Michele Abrusci (University of Roma Tre): Hilbert's tau and epsilon in proof theory.

Hartley Slater (University of Western Australia): Linguistic and philosophical ramifications of the epsilon calculus.

Daisuke Bekki (Ochanomizu University)

Stergios Chatzikyriakidis (LIRMM-CNRS & University of Montpellier)

Francis Corblin (University of Paris-Sorbonne & Institut Jean Nicod CNRS)

Michael Gabbay (University of Cambridge)

Makoto Kanazawa (National Institute of Informatics of Tokyo)

Ruth Kempson (King's College, London)

Alda Mari (CNRS Institut Jean Nicod & ENS & EHESS)

Georg Moser (University of Innsbruck)

Bruno Woltzenlogel Paleo (Vienna University of Technology)

Michel Parigot (CNRS-PPS & University of Paris Diderot 7)

Fabio Pasquali (University of Aix-Marseille & I2M CNRS)

Christian Retoré (University of Montpellier & LIRMM-CNRS)\

Mark Steedman (University of Edimburgh)

Richard Zach (University of Calgary)

Stergios Chatzikyriakidis, LIRMM-CNRS, University of Montpellier

Fabio Pasquali, University of Marseille

Christian Retoré, University of Montpellier & LIRMM-CNRS

Host: I2M-CNRS and University of Montpellier

Submitted by Richard Zach on Thu, 02/12/2015 - 10:59am

- A memorial site has been set up to honor Grisha's memory.
- A memorial conference in honor of Grisha Mints will be held at the Third St.Petersburg Days of Logic and Computability, August 24-26, 2015, at the Euler International Mathematical Institute, St. Petersburg, Russia.
- The following obituary was included in the January 2015 Newsletter of the Association for Symbolic Logic:

Grigori (“Grisha”) Mints died unexpectedly at Stanford on May 29, 2014. Born on June 7, 1939 in what is now St. Petersburg, Russia, Mints studied at the then Leningrad State University, obtaining a Masters degree in mathematics in 1961 with a thesis on proof search in classical predicate logic, a Ph.D. in 1965 with the thesis On Predicate and Operator Variants for Building Theories of Constructive Mathematics , and a D.Sc. in 1990 with Proof Transformations and Synthesis of Programs. From 1961 to 1979, Mints was a researcher at the Leningrad Branch of the Steklov Mathematics Institute. In 1980 he was appointed to a research position at the Institute of Cybernetics in Tallinn, Estonia. In 1991 he became a professor of philosophy and, by courtesy, of mathematics and computer science at Stanford University. Mints was elected to the Estonian Academy of Sciences in 2008 and to the American Academy of Arts and Sciences in 2010.

Mints’ research spanned several areas, with many interconnections. The grand unifying theme in his oeuvre was proof theory and constructivism, but entangled with this came a lifelong interest in computational logic as well as special attention for two specific areas: intuitionistic logic and modal logic.

Mints was trained in the Russian school of constructive mathematics of Markov and of his teacher Nikolai Shanin. In this paradigm, all mathematical objects should be defined in a finite language, and every proof of existence should provide an algorithm, where properties of the algorithm are to be proved by constructive principles including Markov’s schema. In tandem with this foundational view concerning mathematics, Shanin’s group at Steklov also worked on practical automated reasoning, with an emphasis on generating natural proofs, where ‘natural’ included making sense from the perspective of a human agent. This mixture of proof theory and computation led to inventions such as the inverse method, a style of analyzing provability similar to resolution, developed in 1964 by Sergei Maslov, a close friend of Mints.

Combining proof theory and computation naturally leads to a study of intuitionistic logic, and the most significant results of Mints’ first period concern this interface. They include an extension of Herbrand’s theorem to intuitionistic predicate logic (1962), and a proof of the undecidability of intuitionistic predicate logic with a single unary predicate (1965, a classical paper joint with Maslov and Orevkov). Some of these results are still under active investigation. Mints’ paper of 1968 on decidability of a certain fragment of the Gentzen system LJ introduced what is now called the “Mints hierarchy” of intuitionistic first-order formulas. Complexity properties of Mints classes are still under investigation (e.g., in recent works by Schubert, Urzyczyn, et al.), since they are important to understanding constructive type-theoretic proof assistants such as Coq. Also noteworthy is Mints’ proof in 1974 that familiar procedures for extracting programs from existence proofs in intuitionistic arithmetic produce equivalent algorithms.

In subsequent years, Mints turned to the study of relationships between proof theory and category theory. He used proof-theoretic methods to simplify proofs in category theory and to prove new theorems. Three key papers appeared in 19771980 in Russian (English translations in G. Mints, *Selected Papers in Proof Theory*, Bibliopolis and North-Holland, 1992). In particular, Mints gave a clear exposition of Lambek’s results connecting Cartesian closed categories and intuitionistic logic using a novel technique of encoding proofs as explicit proof-terms, an idea that has entered categorical logic itself, and that reemerged in modern manifestations such as Artemov’s justification logic. Important results obtained by Mints with this style of analysis include normalization and coherence theorems.

Mints retained his fundamental proof-theoretic interests throughout, witness his longstanding work on Hilbert’s epsilon calculus to subsystems of analysis right through his Stanford period.

During his stay in Estonia, Mints was actively involved with automated deduction. While in Tallinn, he studied the mathematical principles behind the program synthesizer PRIZ, designed by a group at the Institute of Cybernetics led by Enn Tyugu. Mints came up with an example that PRIZ could not handle, leading to an improvement of the algorithm for which Mints established completeness (1982, joint with Tyugu).

This applied work was based on Mints’ earlier research in proof theory for intuitionistic logic. But he also proved a large number of pure results in the area of intuitionism. These include his proof of Novikov’s hypothesis that a Tarski-style translation from Heyting arithmetic to modal arithmetic is faithful (1978). This result fits in an important line of system embeddings, whose later highlights include Flagg and Friedman (1984). Another long-standing interest of Mints in this area were interpolation theorems. An error in the interpolation proof by Lopez-Escobar for intuitionistic first-order logic with constant domains was found by him in 1983, and a recent joint paper with Olkhovikov and Urquhart (2012) finally produced a concrete and instructive counter-example. Mints’ book *A Short Introduction to Intuitionistic Logic* (2000) is a delightful introduction to the field with many original perspectives.

A natural step leads from intuitionism to modal logic. Mints was the first logician in the Soviet Union to work in modal logic, an exotic area in the 1960s. His first papers (1968-1969) addressed proof theory and decidability of first-order modal logics: in particular, he gave a cut-free sequent calculus for first-order S5 with equality. He also independently introduced the standard translation from modal to classical formulas, one of the main tools in contemporary modal logic. In 1974 he wrote an overview of modal logic in the period 1965-1973 including some of his own results (later transformed into the book *A Short Introduction to Modal Logic*, 1992).

In the 2000s, Mints proposed a study of basic laws of topology and of dynamical systems over these in a modal language. His results from this period include new proofs (some with Ting Zhang) of the completeness of S4 for the open unit interval and for Cantor space, and for the completeness of the basic dynamic topological logic S4C in Cantor space. Much of this work was collected in a chapter in the *Handbook of Spatial Logics* (2007), written by Mints and his collaborator Phil Kremer, which put this research program on the map. Recent new directions in his work included work on cut-elimination in fragments of the modal mu-calculus (2012).

Looking back at Mints’ work one sees a unity of themes and style that connected logic, mathematics, and computer science in many innovative ways. In addition he had a unique charm, formed by Russian and later on also by American culture, and a generous and encouraging intellectual attitude that exerted a strong positive influence on his colleagues, from America to Russia, and on successive generations of students until this very period. Many people owe him great ideas that set them on their paths, which he gave unstintingly, as well as help at crucial stages in their career.

- Read more about In Memoriam: Grigori Mints
- Log in to post comments

Submitted by Richard Zach on Tue, 02/10/2015 - 4:47pm

You may have heard that a notebook by Alan Turing, which he left to Robin Gandy, is going to auction in April. Bonham's, the auction house, has kindly permitted me to share the auction catalog.

The notebook apparently dates from around 1944. The mathematical content is divided into two parts, one on Peano's axioms (judging from the few samples in the catalog, in what looks like *Principia* notation), the other on "notation," specifically variables. He quotes from Weyl's 1939 book *Classical Groups*, where Weyl introduces polynomials as "a formal expression $f(x) = \sum_{i=0}^n \alpha_i x^i$ involving the 'indeterminate' (or variable) $x$ whose coefficients $\alpha_i$ are numbers in a field $k$." Turing writes:

The idea of of an "indeterminate" is distinctly subtle, I would almost say too subtle. It is not (at any rate as van der Waerden sees it) the same as a variable. Polynomials in an indeterminate $x$, $f_1(x)$ and $f_2(x)$, would not be considered identical if $f_1(x) = f_2(x)$ all $x$ in $k$, but the coefficients differed. They are in effect the array of coefficients, with rules for multiplication and addition suggested by their form.

I am inclined to the view that this is too subtle and makes an inconvenient definition. I prefer the indeterminate $k$ [possibly should be $x$?] be just the variable.

Turing's worry is clear enough. If the $x$ in the polynomial is a variable, then the polynomial is determined by its values for all variables, essentially, as a function on $k$. But identity conditions for polynomials are more fine grained. I'm not sure, though, why he thinks this is "too subtle" or why he prefers "the indeterminate be just the variable." Anyway, it *is* subtle, and I don't know if logicians (or algebraists for that matter) by that time commonly made the distinction clearly. When did people start talking about free algebras on generators $\{x, \dots\}$?

The other detail from the manuscript included in the catalog concerns Leibniz's $dy/dx$ notation. Here, too, he seems to be concerned essentially with the role the symbol "$x$" plays in mathematical notation: is it a variable, so that this notation, as he puts it, has "laid down a relation between $x$ and $y$" (i.e., between their values), and that a polynomial is just a special kind of specification of a function? Or are they indeterminate symbols, and polynomials are certain sequences involving these variables? In other words, do the variables belong to the mathematical metalanguage used to describe mathematical objects, or are they symbols in a formal object language?

Frustrating that we don't have more to look at! If you have a few mil lying around and are going to buy this, please share with the poor scholars.

Submitted by Richard Zach on Mon, 02/09/2015 - 3:52pm

(This is a guest post by my linguistics colleague Darin Flynn)

I was intrigued by your last post—that Carnap (apparently) gave serious consideration to suggestions by Gödel and Behmann that he use “semantics” rather than “syntax” in the title of his 1934 book. The story we’re told in linguistics is that Carnap learned to love semantics (e.g. 1939, 1942, 1947/1956) only after logicians (notably Tarski) showed it to be competitive with logical syntax, but his goal in the early 30s was precisely to develop a formal theory of language (though not of natural language) based on syntax rather than semantics—not just because the latter had a less reputable scientific status at the time, but also because Carnap considered only the first part of the familiar linguistic form/meaning dichotomy to be properly formal:

“A theory, a rule, a definition, or the like is to be called formal when no reference is made in it either to the meaning of the symbols (for example, the words) or to the sense of the expressions (e.g. the sentences), but simply and solely to the kinds and order of the symbols from which the expressions are constructed.” (p. 1)

Some of America’s most important theoretical linguists—notably Leonard Bloomfield, Zellig Harris and Noam Chomsky—believed linguistics to be about form rather than meaning, so were impressed by Carnap’s semantics-free theorizing, and by his first example, “Pirots karulize elatically” (p. 2). The latter demonstrated that a sentence could be analyzed as well-formed phonologically, morphologically and syntactically in the absence of meaning. Carnap also used this pseudo-sentence to illustrate “logical syntax” (e.g. deduction): “A is a Pirot” ∴ “A karulizes elatically”. Crucially, “neither the meaning of the words nor the sense of these three sentences need be known” (p. 3).

Chomsky was suspicious of Carnap’s “syntactically” defined logical deductions (semantics in sheep’s clothing?), but was otherwise (like his former mentor, Harris) a careful and appreciative reader of Carnap, and of Goodman’s and Quine’s takes on Carnap. As Heitner (2005) describes in “An odd couple: Chomsky and Quine on reducing the phoneme”:

“Chomsky’s early philosophical interaction with Nelson Goodman (1906–1998) and Morton White (b. 1917)—two prominent figures within analytic philosophy of language deeply suspicious of an uncritical reliance on “meaning” in philosophy—with whom he took graduate classes with as an undergraduate is no doubt also relevant. After all, it was Goodman who recommended Chomsky for a Junior Fellowship in the Society of Fellows at Harvard where Chomsky would come into close contact with an elite Harvard philosophical circle revolving around Goodman and Quine... Chomsky recalls how “studying at Penn with Zellig Harris and Nelson Goodman was a highly stimulating experience”; a “remarkable opportunity” where he spent “a good deal of time in courses, seminars, discussions, primarily with philosophers at Harvard—Quine, Austin (who was visiting Harvard then), White, and others... a very lively and stimulating period in the Cambridge area for a student with my particular interests” (p. 17). … [I]n addition to these interpersonal relations, others have also detected a significant line of intellectual descent connecting Chomsky to Quine through the influence of Goodman, and through Goodman and Quine, to the philosophical heritage of Rudolph [sic] Carnap (1891–1970)—one of the leading positivist figures of the Vienna Circle of Logical Empiricism. For while Otero (1994, vol. II) reports that among non-American philosophers, it was only Rudolf Carnap whom Chomsky read as a student (p. 3), Tomalin (2002, 2003) has more recently provided valuable research documenting the distinctive Carnapian aspirations and “constructive nominalist” methodology adopted throughout Chomsky’s early formulations of generative grammar as reflected in

The Logical Structure of Linguistic Theory(1955/1975) and his first published paper “Systems of Syntactic Analysis” (1953). According to Tomalin, Chomsky’s early commitment to constructing formal systems of syntactic analysis independent of semantic information is traceable to the empiricist methodology of Carnap and the meta-mathematical efforts of Goodman and Quine to devise a formal system for mathematics without appeal to abstract objects (2003, p. 1236). (See Newmeyer (1996, p. 15) for similar considerations.) In fact, in “Logical Syntax and Semantics, Their linguistic relevance” Chomsky (1955a, p. 36) favorably references Quine’s (1953) extremely influential critiques of meaning, and even explicitly defends Quine’s anti-mentalistic philosophy inThe Logical Structure of Linguistic Theory.” (p. 2-3)

For instance, compare Carnap’s quotation above with Chomsky’s in *The Logical Structure of Linguistic Theory* (the title of which may plausibly be construed as a mashup of Carnap’s *The Logical Structure of the World* & *The Logical Syntax of Language*): “In the strict sense of the word, an argument, a characterization, a theory, etc. is ‘formal’ if it deals with form as opposed to meaning, that is, if it deals solely with the shape and arrangement of symbols” (1955/1975, p. 83). Compare, too, Chomsky’s “Colorless green ideas sleep furiously” with Carnap’s pseudo-sentence. According to Tomalin (2006), these are examples among many of Carnap’s influence on Chomsky and on his former mentor, Harris. Another notable example: “the transformations developed by Harris and Chomsky were related to the transformation rules presented in (the English translation of) Carnap LST” (p. 168).

Tomalin’s research on the philosophical and historical background of transformational generative grammar is fascinating—particularly his original attention to Carnap, and Goodman’s modifications. For critical reviews, see especially Scholz & Pullum (2007) “Tracking the origins of transformational generative grammar” and Seuren (2009) “Concerning the roots of transformational generative grammar” [sorry, this one's paywalled :( -RZ].

Submitted by Richard Zach on Sat, 02/07/2015 - 11:02am

Carnap's *Logical Syntax of Language* actually deals with semantic notions such as "analytic." Why, then, didn't he call it "semantics"?

When the project was still in its early stages, Carnap sent a manuscript entitled "Metalogik" to Heinrich Behmann. Behmann objected to the title and suggested as alternatives first "Logic of Language" and then "Semantics." Carnap replied:

I like the term "semantics"; Gödel also suggested it. Neurath, on the other hand, thinks it is unappealing and pedantic; he suggests "syntax." In order to avoid confusion with syntax in philology, one would probably have to often call it "logical syntax."

Der Terminus "Semantik" sagt mir zu; auch Gödel schlug ihn gleichzeitig vor. Neurath aber findet ihn unsymphatisch und gelehrtenhaft; er schlägt "Syntax" vor. Zur Vermeidung der Verwechslung mit der philologischen S. müsste man dann wohl häufig "logische Syntax" sagen.

(Carnap to Behmann, April 17, 1932)

- Read more about Carnap on "Syntax" vs "Semantics"
- 1 comment
- Log in to post comments

Submitted by Richard Zach on Sat, 01/31/2015 - 12:55pm

Tools for Teaching Logic (June 9-12, 2015, Rennes, France) is seeking original papers with a clear significance in the following topics (but are not limited to): teaching logic in sciences and humanities; teaching logic at different levels of instruction (secondary education, university level, and postgraduate); didactic software; facing some difficulties concerning what to teach; international postgraduate programs; resources and challenges for e-learning logic; teaching argumentation theory, critical thinking and informal logic; teaching specific topics, such as modal logic, algebraic logic, knowledge representation, model theory, philosophy of logic, and others; dissemination of logic courseware and logic textbooks; teaching Logic Thinking.

Abstracts are due on February 13, full papers on February 20. More details on the website: http://ttl2015.irisa.fr/

- Read more about CfP: Tools For Teaching Logic TTL2015
- Log in to post comments

Submitted by Richard Zach on Sat, 01/31/2015 - 10:45am

In case you need the original 1920 or 1923 papers by Skolem, and you don't have *Selected Works in Logic* handy, here are PDFs extracted from the digital version of *Skrifter utgit av Videnskapsselskapet i Kristiania. I, Matematisk-naturvidenskabelig klasse* made available by the Biodiversity Heritage Library and the Internet Archive.

Thoralf Skolem, "Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theorem über dichte Mengen", *Skrifter utgit av Videnskapsselskapet i Kristiania. I, Matematisk-naturvidenskabelig klasse* 1920, no. 4, pp. 1–36

Thoralf Skolem, "Begründung der elementaren Arithmetik durch die rekurrierende Denkweise ohne Anwendung scheinbarer Veränderlichen mit unendlichem Ausdehnungsbereich", *Skrifter utgit av Videnskapsselskapet i Kristiania. I, Matematisk-naturvidenskabelig klasse* 1923, no. 6, pp. 1–38.

- Read more about Skolem's 1920, 1923 Papers
- Log in to post comments

Submitted by Richard Zach on Sat, 01/31/2015 - 9:27am

Submitted by Richard Zach on Sun, 01/18/2015 - 8:25am

European 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 the 15th Conference of Logic, Methodology and Philosophy of Science, CLMPS 2015, and with the SLS Summer School in Logic.

Toshiyasu Arai (Chiba)

Sergei Artemov (New York)

Steve Awodey (Pittsburgh)

Johan van Benthem (Amsterdam and Stanford)

Artem Chernikov (Paris)

Ilias Farah (York)

Danielle Macbeth (Haverford)

Andrei Morozov (Novosibirsk)

Kobi Peterzil (Haifa)

Ralf Schindler (Münster)

Saharon Shelah (TBC) (Jerusalem and Rutgers)

Sebastiaan Terwijn (Nijmegen)

Erich Grädel (Aachen)

Menachem Magidor (Jerusalem).

**Set Theory**, organized by Heike Mildenberger (Freiburg)

**Model theory, **organized by Dugald Macpherson (Leeds)

**Computability Theory, **organized by Russell Miller (New York) and Alexandra Soskova (Sofia)

**Proof Theory, **organized by Benno van den Berg (Amsterdam) and Michael Rathjen (Leeds)

**Philosophy of Mathematics and Logic, **organized by Patricia Blanchette (Notre Dame) and Penelope Maddy (Irvine)

**Logic and Quantum Foundations, **organized by Samson Abramsky (Oxford)

Travel awards for students and young researchers have been made available by the organizers. In some cases full compensation of expenses is possible. The website includes detailed information about the awards, instructions of how to apply, and an electronic form which may be used for the application.

The Logic Colloquium will include contributed talks of 20 minutes' length. Abstracts on contributed talks are published in the *Bulletin of Symbolic Logic*.

The deadline for travel award applications and abstract submission is **Tuesday, May 3, 2015**. Please see http://www.helsinki.fi/lc2015/submission.html for information about applying for travel awards and for submitting an abstract.

- Read more about CfP: 2015 Logic Colloquium in Helsinki
- Log in to post comments

Submitted by Richard Zach on Fri, 01/16/2015 - 10:36am

Sad news from Philip Welch at Bristol: John Shepherdson has died.

I deeply regret having to impart the very sad news that John Shepherdson died in Bristol on Thursday of an inoperable sarcoma.

John was a founder of the BLC (together with Robin Gandy if I remember rightly). His own work was in many areas, starting with set theory, then recursion theory (inventing the register machine in a paper with Sturgis), models of arithmetic, incompleteness phenomena, and towards the end of his career working on PROLOG and fuzzy logic. Besides all this, he made Bristol a centre for mathematical logic in the UK, with many prestigious visitors in the early years. In particular it became a training ground in the 50s, 60s for many who went on to academic careers, as well as in the 70's through its MSc in Mathematical Logic and Theory of Computation. He spent his whole working career at the Bristol department arriving there in 1946.

He always struck me as an exceptionally kind person, an amusing and intelligent companion to be with, and most modest, as well as self-effacing in the best sense. He will be much missed.

A fuller appreciation will be composed at some point. There will be no funeral, but his family have indicated there will be a Memorial Service or Occasion at a date in the future, when a full tribute can be paid to him.

Philip Welch

- Read more about John Shepherdson, 1926-2015
- Log in to post comments

Submitted by Richard Zach on Fri, 01/16/2015 - 8:35am

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.

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.

Submitted by Richard Zach on Fri, 01/09/2015 - 1:54pm

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)

- Read more about Logical Operators in the SEP
- Log in to post comments

Submitted by Richard Zach on Wed, 01/07/2015 - 7:02am

I learned today that Ivor Grattan-Guinness, the historian of mathematics and logic, died last month.

Obituaries:

- Read more about Ivor Grattan-Guinness, 1941-2014
- Log in to post comments

Submitted by Richard Zach on Mon, 12/22/2014 - 1:09pm

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., eds. Oxford: Oxford University Press.

There is a wonderful package that allows you to generate new BibTeX bibliography styles based on a large number of customization options: custom-bib. It comes with one big master bibliography style merlin.mbs from which your custom style is generated. I've produced a modified file which will also print both author and editor for a book that has both.

Merry Christmas.

Submitted by Richard Zach on Sun, 12/14/2014 - 7:19am

New in the *Review of Symbolic Logic* (part 1, part 2)

A Gödel sentence is often described as a sentence saying about itself that it is not provable, and a Henkin sentence as a sentence stating its own provability. We discuss what it could mean for a sentence of arithmetic to ascribe to itself a property such as provability or unprovability. The starting point will be the answer Kreisel gave to Henkin’s problem. We describe how the properties of the supposedly self-referential sentences depend on the chosen coding, the formulae expressing the properties and the way a fixed points for the formulae are obtained. This paper is the first of two papers. In the present paper we focus on provability. In part II, we will consider other properties like Rosser provability and partial truth predicates.

- Read more about Halbach & Visser: Self-reference in arithmetic
- Log in to post comments

Submitted by Richard Zach on Sat, 12/13/2014 - 6:19am

Submitted by Richard Zach on Sat, 12/13/2014 - 5:51am

In response to my post about "lesser known Russian/Soviet logicians", Lev Beklemishev commented:

Dirk van Dalen was interested in Shatunovsky's work and at his request I procured a copy of his book on the development of algebra on the basis of what can be called rudimentary constructivist ideas. This was, of course, pre-Brouwerian, and the ideas of Shatunovsky were perhaps more in line with Kronecker's. In any case, this was interesting to see, but it never came to a publication on it with Dirk.

Yanovskaya was his most well-known student, and she was well-respected among the mathematical logicians in Moscow, for whom she effectively provided some sort of ideological cover in the later years. She worked at the department of mathematics at MSU and is well-remembered there.

A good informative article on Shatunovsky is his obituary written by Chebotarev and published, I think, in Uspekhi matematicheskih nauk [link].

By email, Mark van Atten wrote:

A marginal note: There was a brief epistolary exchange between Kagan and Brouwer. They had been put in contact by Mrs Ehrenfest-Afanassjewa. Kagan's letter to Brouwer of June 22, 1922 can be found in

The Selected Correspondence of L.E.J. Brouwer(ed. Van Dalen, Springer 2011), pp. 290-291. In that letter Kagan also mentions Schatunowsky (as he, writing in German, spells it) and the latter's work on the development of algebra without the excluded middle.The date as given by Van Dalen there is 1925. The online-edition of the correspondence at extras.springer.com, which contains all of Brouwer's remaining correspondence (but untranslated), contains that letter twice, once dated 1922, once 1925. 1922 seems to me to be correct as Ehrenfest-Afanassjewa's request to Brouwer to send some material to Kagan was made in that year.

That online edition also includes a short second letter from Kagan, dated Feburay 8, 1925 (on Alexandrov and Urysohn, but without specifically scientific content).

The online edition mentions Shatunovsky once more, in a letter from Alexandrov to Brouwer of March 15, 1927. Commenting on a paragraph in a letter from Brouwer to him, apparently lost, of December 27 [1926], Alexandrov writes: `Im Absatz 8 äussern Sie mir Ihre Meinung über den unsinnigen Artikel von Schatunowski. Da diese Meinung im Stillen auch immer die meinige war, sah ich keinen Grund mich irgendwie dazu zu äussern, und habe mich begnügt, dieselbe an Frau Ehrenfest zur gefälligste Kenntnisnahme mitzuteilen.'

Alas, the online edition contains no mention of Schönfinkel.

Lev responded:

This is an interesting exchange. Is there a way to find out which paper of Shatunovsky was mentioned by Brouwer and Alexandroff as non-sensical? In any case, this assessment could actually be true. From a rather superficial reading of his long work I got the impression that it was a specific way of presenting rather ordinary algebra, without anything revolutionary, accompanied by an introduction stating some philosophical pre-constructivist motivations. The case for doing all this was not a very strong one. But it could well be that they mention some other work that could be either more or less non-sensical that this.

By the way, Kagan was the grandfather of Yakov Sinai, this year's Abel laureate. I have just watched his interview where he told some story about his grandfather and his friend Shatunovsky from their time in Odessa. Apparently he knows a lot about their lives! These coincidences are quite curious...

Mark responded to Lev's question:

The edition of Brouwer's correspondence does not carry an annotation on this point, unfortunately. Perhaps an educated guess can be made from a full bibliography. Is there one?

The interview Lev mentioned is on youtube. It's in Russian, and Google Translate didn't do a very good job on the transcript, probably because of missing punctuation. I'm attaching it here in case someone wants to play with it.

- Read more about More on Shatunovsky, Kagan, and Yanovskaya
- 1 comment
- Log in to post comments

- Open Logic Project
- The LogBlog is Moving!
- Academic Genealogy Graphed
- CfP: Hilbert’s Epsilon and Tau in Logic, Informatics and Linguistics
- In Memoriam: Grigori Mints
- Previously Unknown Turing Manuscript Going to Auction
- Carnap (and Goodman and Quine) and Linguistics (Guest post by Darin Flynn)
- Carnap on "Syntax" vs "Semantics"