In (1991), Meinwald initiated a major change of direction in the study of Plato’s Parmenides and the Third Man Argument. On her conception of the Parmenides , Plato’s language systematically distinguishes two types or kinds of predication, namely, predications of the kind ‘x is F pros ta alla’ and ‘x is F pros heauto’. Intuitively speaking, the former is the common, everyday variety of predication, which holds when x is any object (perceptible object or Form) and F is a property (...) which x exemplifies or instantiates in the traditional sense. The latter is a special mode of predication which holds when x is a Form and F is a property which is, in some sense, part of the nature of that Form. Meinwald (1991, p. 75, footnote 18) traces the discovery of this distinction in Plato’s work to Frede (1967), who marks the distinction between pros allo and kath’ hauto predications by placing subscripts on the copula ‘is’. (shrink)

The simplest quantified modal logic combines classical quantification theory with the propositional modal logic K. The models of simple QML relativize predication to possible worlds and treat the quantifier as ranging over a single fixed domain of objects. But this simple QML has features that are objectionable to actualists. By contrast, Kripke-models, with their varying domains and restricted quantifiers, seem to eliminate these features. But in fact, Kripke-models also have features to which actualists object. Though these philosophers have introduced variations (...) on Kripke-models to eliminate their objectionable features, the most well-known variations all have difficulties of their own. The present authors reexamine simple QML and discover that, in addition to having a possibilist interpretation, it has an actualist interpretation as well. By introducing a new sort of existing abstract entity, the contingently nonconcrete, they show that the seeming drawbacks of the simplest QML are not drawbacks at all. Thus, simple QML is independent of certain metaphysical questions. (shrink)

In this paper, the author develops a theory of concepts and shows that it captures many of the ideas about concepts that Leibniz expressed in his work. Concepts are first analyzed in terms of a precise background theory of abstract objects, and once concept summation and concept containment are defined, the axioms and theorems of Leibniz's calculus of concepts (in his logical papers) are derived. This analysis of concepts is then seamlessly connected with Leibniz's modal metaphysics of complete individual concepts. (...) The fundamental theorem of Leibniz's modal metaphysics of concepts is proved, namely, whenever an object x has F contingently, then (i) the individual concept of x contains the concept F and (ii) there is a (counterpart) complete individual concept y which doesn't contain the concept F and which `appears' at some other possible world. Finally, the author shows how the concept containment theory of truth can be made precise and made consistent with a modern conception of truth. (shrink)

In this paper, the author derives the Dedekind-Peano axioms for number theory from a consistent and general metaphysical theory of abstract objects. The derivation makes no appeal to primitive mathematical notions, implicit definitions, or a principle of infinity. The theorems proved constitute an important subset of the numbered propositions found in Frege's *Grundgesetze*. The proofs of the theorems reconstruct Frege's derivations, with the exception of the claim that every number has a successor, which is derived from a modal axiom that (...) (philosophical) logicians implicitly accept. In the final section of the paper, there is a brief philosophical discussion of how the present theory relates to the work of other philosophers attempting to reconstruct Frege's conception of numbers and logical objects. (shrink)

The seventeenth century saw dramatic advances in mathematical theory and practice. With the recovery of many of the classical Greek mathematical texts, new techniques were introduced, and within 100 years, the rules of analytic geometry, geometry of indivisibles, arithmatic of infinites, and calculus were developed. Although many technical studies have been devoted to these innovations, Mancosu provides the first comprehensive account of the relationship between mathematical advances of the seventeenth century and the philosophy of mathematics of the period. Starting with (...) the Renaissance debates on the certainty of mathematics, Mancosu leads the reader through the foundational issues raised by the emergence of these new mathematical techniques, including the influence of the Aristotelian conception of science in Cavalieri and Guldin, the foundational relevance of Descartes' Geometrie, the relation between geometrical and epistemological theories of the infinite, and the Leibnizian calculus and the opposition to infinitesimalist procedures. In the process Mancosu draws a sophisticated picture of the subtle dependencies between technical development and philosophical reflection in seventeenth century mathematics. (shrink)

The foregoing set of theorems forms an effective foundation for the theory of situations and worlds. All twenty-five theorems seem to be basic, reasonable principles that structure the domains of properties, relations, states of affairs, situations, and worlds in true and philosophically interesting ways. They resolve 15 of the 19 choice points defined in Barwise (1989) (see Notes 22, 27, 31, 32, 35, 36, 39, 43, and 45). Moreover, important axioms and principles stipulated by situation theorists are derived (see Notes (...) 33, 37, and 38). This is convincing evidence that the foregoing constitutes a theory of situations. Note that worlds are just a special kind of situation, and that the basic theorems of world theory, which were derived in previous work, can still be derived in this situation-theoretic setting. So there seems to be no fundamental incompatibility between situations and worlds — they may peacably coexist in the foundations of metaphysics. The theory may therefore reconcile two research programs that appeared to be heading off in different directions. And we must remind the reader that the general metaphysical principles underlying our theory were not designed with the application to situation theory in mind. This suggests that the general theory and the underlying distinction have explanatory power, for they seem to relate and systematize apparently unrelated phenomena. (shrink)

By what process of development he came to this opinion, though in itself an important and interesting question, is logically irrelevant to the inquiry how far the opinion itself is correct ; and among his opinions, when these have been ascertained, it becomes desirable to prune away such as seem inconsistent with his main doctrines, before those doctrines themselves are subjected to a critical scrutiny. Philosophic truth and falsehood, in short, rather than historical fact, are what primarily demand our attention (...) in this inquiry. (shrink)

The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems itself. The first successful attempts to mechanize and implement higher-order logic were those of Huet [13] and Jensen and Pietrzykowski [17]. They combine the resolution principle for higher-order logic (first studied in [1]) with higher-order unification. The unification problem in typed λ-calculi is much more complex than that for first-order terms, since it has to take the theory of αβη-equality into (...) account. As a consequence, the higher-order unification problem is undecidable and sets of solutions need not even always have most general elements that represent them. Thus the mentioned calculi for higher-order logic have take special measures to circumvent the problems posed by the theoretical complexity of higher-order unification. In this paper, we will exemplify the methods and proof- and model-theoretic tools needed for extending first-order automated theorem proving to higherorder logic. For the sake of simplicity take the tableau method as a basis (for a general introduction to first-order tableaux see part I.1) and discuss the higherorder tableau calculi HT and HTE first presented in [19]. The methods in this paper also apply to higher-order resolution calculi [1, 13, 6] or the higher-order matings method of Peter [3], which extend their first-order counterparts in much the same way. Since higher-order calculi cannot be complete for the standard semantics by Gödel’s incompleteness theorem [11], only the weaker notion of Henkin models [12] leads to a meaningful notion of completeness in higher-order logic. It turns out that the calculi in [1, 13, 3, 19] are not Henkin-complete, since they fail to capture the extensionality principles of higher-order logic. We will characterize the deductive power of our calculus HT (which is roughly equivalent to these calculi) by the semantics of functional Σ-models. To arrive at a calculus that is complete with respect to Henkin models, we build on ideas from [6] and augment HT with tableau construction rules that use the extensionality principles in a goal-oriented way.. (shrink)