Gerald J. Massey

Peter Abelard (1079–1142 ce) was the most wide‐ranging philosopher of the twelfth century. He quickly established himself as a leading teacher of logic in and near Paris shortly after 1100. After his affair with Heloise, and his subsequent castration, Abelard became a monk, but he returned to teaching in the Paris schools until 1140, when his work was condemned by a Church Council at Sens. His logical writings were based around discussion of the “Old Logic”: Porphyry's Isagoge, aristotle'S Categories and On Interpretation and boethius'S textbook on topical inference. They comprise a freestanding Dialectica (“Logic”; probably c.1116), a set of commentaries (known as the Logica [Ingredientibus], c. 1119) and a later (c. 1125) commentary on the Isagoge (Logica Nostrorum Petititoni Sociorum or Glossulae). In a work Abelard called his Theologia, issued in three main versions (between 1120 and c.1134), he attempted a logical analysis of trinitarian relations and explored the philosophical problems surrounding God's claims to omnipotence and omniscience. The Collationes (“Debates,” also known as “Dialogue between a Christian, a Philosopher and a Jew”; probably c.1130) present a rational investigation into the nature of the highest good, in which the Christian and the Philosopher (who seems to be modeled on a philosopher of pagan antiquity) are remarkably in agreement. The unfinished Scito teipsum (“Know thyself,” also known as the “Ethics”; c.1138) analyses moral action.

A bivalent valuation is snt iff sound (standard PC inference rules take truths only into truths) and non-trivial (not all wffs are assigned the same truth value). Such a valuation is normal iff classically correct for each connective. Carnap knew that there were non-normal snt valuations of PC, and that the gap they revealed between syntax and semantics could be "jumped" as follows. Let $VAL_{snt}$ be the set of snt valuations, and $VAL_{nrm}$ be the set of normal ones. The bottom row in the table for the wedge 'v' is not semantically determined by $VAL_{snt}$ , but if one deletes from $VAL_{snt}$ all those valuations that are not classically correct at the aforementioned row, one jumps straights to $VAL_{nrm}$ and thus to classical semantics. The conjecture we call semantic holism claims that the same thing happens for any semantic indeterminacy in any row in the table of any connective of PC, i.e., to remove it is to jump straight to classical semantics. We show (i) why semantic holism is plausible and (ii) why it is nevertheless false. And (iii) we pose a series of questions concerning the number of possible steps or jumps between the indeterminate semantics given by $VAL_{snt}$ and classical semantics given by $VAL_{nrm}$.

To most laypersons and scientists, science and progress appear to go hand in hand, yet philosophers and historians of science have long questioned the inevitability of this pairing. As we take leave of a century acclaimed for scientific advances and progress, Science at Century's End, the eighth volume of the Pittsburgh-Konstanz Series in the Philosophy and History of Science, takes the reader to the heart of this important matter. Subtitled Philosophical Questions on the Progress and Limits of Science, this timely volume contains twenty penetrating essays by prominent philosophers and historians who explore and debate the limits of scientific inquiry and their presumed consequences for science in the 21st century.

Semantic Holism is the claim that any semantic path from inferential semantics (the indeterminate semantics forced by the classical inference rules of PC) reaches all the way to classical semantics if it is even one step long. In our joint paper Semantic Holism, Belnap and I showed that some such semantic paths are two steps long, but we left open a number of questions about the lengths of semantic paths. Here I answer the most important of these questions by showing that there are infinitely long semantic paths that begin at inferential semantics but that do not even reach classical semantics. I do this by showing how to construct such an infinite semantic path from the members of the family of (n–1)-out-of-n-disjunction connectives.