Massimiliano Carrara

Some forms of analytic reconstructivism take natural language (and common sense at large) to be ontologically opaque: ordinary sentences must be suitably rewritten or paraphrased before questions of ontological commitment may be raised. Other forms of reconstructivism take the commitment of ordinary language at face value, but regard it as metaphysically misleading: common-sense objects exist, but they are not what we normally think they are. This paper is an attempt to clarify and critically assess some common limits of these two reconstructivist strategies.

Logical orthodoxy has it that classical first-order logic, or some extension thereof, provides the right extension of the logical consequence relation. However, together with naïve but intuitive principles about semantic notions such as truth, denotation, satisfaction, and possibly validity and other naïve logical properties, classical logic quickly leads to inconsistency, and indeed triviality. At least since the publication of Kripke’s Outline of a theory of truth , an increasingly popular diagnosis has been to restore consistency, or at least non-triviality, by restricting some classical rules. Our modest aim in this note is to briefly introduce the main strands of the current debate on paradox and logical revision, and point to some of the potential challenges revisionary approaches might face, with reference to the nine contributions to the present volume.For a recent introduction to non-classical theories of truth and other semantic notions, see the excellent Beall a ..

In Mathematics is megethology Lewis reconstructs set theory combining mereology with plural quantification. He introduces megethology, a powerful framework in which one can formulate strong assumptions about the size of the universe of individuals. Within this framework, Lewis develops a structuralist class theory, in which the role of classes is played by individuals. Thus, if mereology and plural quantification are ontologically innocent, as Lewis maintains, he achieves an ontological reduction of classes to individuals. Lewis’work is very attractive. However, the alleged innocence of mereology and plural quantification is highly controversial and has been criticized by several authors. In the present paper we propose a new approach to megethology based on the theory of plural reference developed in To be is to be the object of a possible act of choice. Our approach shows how megethology can be grounded on plural reference without the help of mereology.

Identity criteria are used to confer ontological respectability: Only entities with clearly determined identity criteria are ontologically acceptable. From a logical point of view, identity criteria should mirror the identity relation in being reflexive, symmetrical, and transitive. However, this logical constraint is only rarely met. More precisely, in some cases, the relation representing the identity condition fails to be transitive. We consider the proposals given so far to give logical adequacy to inadequate identity conditions. We focus on the most refined proposal and expand its formal framework by taking into account two further aspects that we consider essential in the application of identity criteria to obtain logical adequacy: contexts and granular levels.

A logical argument known as Fitch’s Paradox of Knowability, starting from the assumption that every truth is knowable, leads to the consequence that every truth is also actually known. Then, given the ordinary fact that some true propositions are not actually known, it concludes, by modus tollens, that there are unknowable truths. The main literature on the topic has been focusing on the threat the argument poses to the so called semantic anti-realist theories, which aim to epistemically characterize the notion of truth; according to those theories, every true proposition must be knowable. But the paradox seems to be a problem also for epistemology and philosophy of science: the conclusion of the paradox – the claim that there are unknowable truths – seems to seriously narrow our epistemic possibilities and to constitute a limit for knowledge. This fact contrasts with certain views in philosophy of science according to which every scientific truth is in principle knowable and, at least at an ideal level, a perfected, “all-embracing”, omniscient science is possible. The main strategies proposed in order to avoid the paradoxical conclusion, given their effectiveness, are able to address only semantic problems, not epistemological ones. However, recently Bernard Linsky (2008) proposed a solution to the paradox that seems to be effective also for the epistemological problems. In particular, he suggested a possible way to block the argument employing a type-distinction of knowledge. In the present paper, firstly, we introduce the paradox and the threat it represents for a certain views in epistemology and philosophy of science; secondly, we show Linsky’s solution; thirdly, we argue that this solution, in order to be effective, needs a certain kind of justification, and we suggest a way of justifying it in the scientific field; fourthly, we show that the effectiveness of our proposal depends on the degree of reductionism adopted in science: it is available only if we do not adopt a complete reductionism.

The goal of [3] is to sketch the construction of a syntactic categorical model of the bi-intuitionistic logic of assertions and hypotheses AH, axiomatized in a sequent calculus AH-G1, and to show that such a model has a chirality-like structure inspired by the notion of dialogue chirality by P-A. Melliès [8]. A chirality consists of a pair of adjoint functors L ⊣ R, with L: A → B, R: B → A, and of a functor (.)* : A → Bop(0,1) satisfying certain conditions. The definition of the logic AH in [3] needs to be modified so that our categories A and B are actually dual. With this modification, a more complex structure emerges.

Nicholas Rescher, in The Limits of Science (1984), argued that: «perfected science is a mirage; complete knowledge a chimera». He reached the above conclusion from a logical argument known as Fitch’s Paradox of Knowability. The argument, starting from the assumption that every truth is knowable, proves that every truth is also actually known and, given that some true propositions are not actually known, it concludes, by modus tollens, that there are unknowable truths. Prima facie, this argument seems to seriously narrow our epistemic possibilities and to constitute a limit for knowledge (included scientific knowledge). Rescher’s above quoted conclusion follows the same sort of reasoning. Recently, Bernard Linsky exploited a possible way to block the argument employing a type-distinction of knowledge. If the Knowability paradox is blocked, then Rescher’s conclusion cannot be drawn. After an introduction to the paradox, we suggest, in our paper, a possible way of justifying a type-solution for it in the scientific field. A noteworthy point is that the effectiveness of this solution depends on the degree of reductionism adopted in science: the given solution is available only if we do not adopt a complete reductionism in science so that there is just one kind of scientific knowledge and, consequently, of scientific justification. Otherwise Rescher's argument still works.

From a logical point of view, identity criteria should mirror the identity relation in being reflexive, symmetrical, and transitive. However, the relation representing the identity condition fails to be transitive in many cases. We consider the proposals given so far to give logical adequacy to inadequate identity conditions. We focus on the most refined proposal and expand its formal framework by taking into account two further aspects that we consider essential in the formal treatment of identity criteria: contexts and granular levels.

The Knowability Paradox is a logical argument that, starting from the plainly innocent assumption that every true proposition is knowable, reaches the strong conclusion that every true proposition is known; i.e. if there are unknown truths, there are unknowable truths. The paradox has been considered a problem for every theory assuming the Knowability Principle, according to which all truths are knowable and, in particular, for semantic anti-realist theories. A well known criticism to the Knowability Paradox is the so called restriction strategy. It bounds the scope of the universal quantification in (KP) to a set of formulas whose logical form avoids the paradoxical conclusion. Specifically, Tennant suggests to restrict the quantifier in (KP) to propositions whose knowledge is provably inconsistent. He calls them Anti-Cartesian propositions and distinguished them in three kinds. In this paper we will not be concerned with the soundness of the restriction proposal and the criticisms it has received. Rather, we are interested in analyzing the proposed distinction. We argue that Tennant’s distinction is problematic because it is not completely clear, it is not grounded on an adequate logical analysis, and it is incomplete. We suggest an alternative distinction, and we give some reasons for accepting it: it results logically grounded and more complete than Tennant’s one, inclusive of it and independent from non-epistemic notions.

This is an excerpt from the contentIn the introduction to part I of the symposium we stated that a rational agent could be thought of as an agent who has good reasons for its actions. In formal analyses of economic, medical, political, military and forensic decisions rationality, that is the “goodness” of those reasons, is inextricably intertwined with probability. Typically, those analyses concern decisions in a particular class of uncertain situations, namely “risky” situations, where all the relevant available alternative actions are known, each or most actions are non-deterministic , and the probability of each outcome is known to some degree of approximation. As yet, formal analyses have only begun to scratch the surface of the subtleties implicated in uncertain, but not risky, situations, where the available courses of actions, and/or their possible outcomes, and/or the probabilities of those outcomes, are not all