This book provides a detailed commentary on the classic monograph by Alfred Tarski, and offers a reinterpretation and retranslation of the work using the original Polish text and the English and German translations. In the original work, Tarski presents a method for constructing definitions of truth for classical, quantificational formal languages. Furthermore, using the defined notion of truth, he demonstrates that it is possible to provide intuitively adequate definitions of the semantic notions of definability and denotation and that the notion (...) in a structure can be defined in a way that is analogous to that used to define truth. Tarski’s piece is considered to be one of the major contributions to logic, semantics, and epistemology in the 20th century. However, the author points out that some mistakes were introduced into the text when it was translated into German in 1935. As the 1956 English version of the work was translated from the German text, those discrepancies were carried over in addition to new mistakes. The author has painstakingly compared the three texts, sentence-by-sentence, highlighting the inaccurate translations, offering explanations as to how they came about, and commenting on how they have influenced the content and suggesting a correct interpretation of certain passages. Furthermore, the author thoroughly examines Tarski’s article, offering interpretations and comments on the work. (shrink)

The notion of grounding is usually conceived as an objective and explanatory relation. It connects two relata if one—the ground—determines or explains the other—the consequence. In the contemporary literature on grounding, much effort has been devoted to logically characterize the formal aspects of grounding, but a major hard problem remains: defining suitable grounding principles for universal and existential formulae. Indeed, several grounding principles for quantified formulae have been proposed, but all of them are exposed to paradoxes in some very natural (...) contexts of application. We introduce in this paper a first-order formal system that captures the notion of grounding and avoids the paradoxes in a novel and non-trivial way. The system we present formally develops Bolzano’s ideas on grounding by employing Hilbert’s ε-terms and an adapted version of Fine’s theory of arbitrary objects. (shrink)

Recent work on hypercomputation has raised new objections against the Church–Turing Thesis. In this paper, I focus on the challenge posed by a particular kind of hypercomputer, namely, SAD computers. I first consider deterministic and probabilistic barriers to the physical possibility of SAD computation. These suggest several ways to defend a Physical version of the Church–Turing Thesis. I then argue against Hogarth's analogy between non-Turing computability and non-Euclidean geometry, showing that it is a non-sequitur. I conclude that the Effective version (...) of the Church–Turing Thesis is unaffected by SAD computation. (shrink)

Leibniz seems to have been the first to suggest a logical interpretation of probability, but there have always seemed formidable mathematical and interpretational barriers to implementing the idea. De Finetti revived it only, it seemed, to reject it in favour of a purely decision-theoretic approach. In this paper I argue that not only is it possible to view (Bayesian) probability as a continuum-valued logic, but that it has a very close formal kinship with classical propositional logic.

In Parts of Classes David Lewis argued that mereology is ‘ontologically innocent’, mereological notions not incurring additional ontological commitments. Unfortunately, though, Lewis’s argument for this is not fully spelled out. Here we use some formal results concerning translations between formal languages to argue for the ontological innocence of mereology directly.