Online research in philosophy

It is generally supposed that borderline cases account for the tolerance of vague terms, yet cannot themselves be sharply bounded, leading to infinite levels of higher order vagueness. This higher order vagueness subverts any formal effort to make language precise. However, it is possible to show that tolerance must diminish at higher orders. The attempt to derive it from indiscriminability founders on a simple empirical test, and we learn instead that there is no limit to how small higher order tolerance may become. That means there is no limit to how precisely we may draw the boundaries of borderline cases, thus forestalling any requirement for higher order vagueness.

In this paper I try to capture Newton's notion and practice of unification (I will mainly focus on the Principia). I will use contemporary theories on unification in philosophy of science as analytic tools (Kitcher, Schurz and Salmon). I will argue that Salmon's later work on the topic provides a good starting point to characterize Newton's notion and practice. However, in order to fully grasp Newton's idea and practice of unification, Salmon's model needs to be fleshed out and extended.

The higher order approach to consciousness attempts to build a theory of consciousness from the insight that a conscious state is one that the subject is conscious of. There is a well-known objection1 to the higher order approach, a version of which is fatal. Proponents of the higher order approach have realized that the objection is significant. They have dealt with it via what David Rosenthal calls a “retreat” (2005b, p. 179) but that retreat fails to solve the problem.

Higher Order theories of consciousness have their fair share of sympathisers, but the arguments mustered in their support are—to my mind—unduly persuasive. My aim in this paper is to show that Higher Order theories cannot accommodate the possibility of misrepresentation without either falling into contradiction, or collapsing into a First-Order theory. If this diagnosis is on the right track, then Higher Order theories—at least in the specific versions here considered—fail to give an account of what they set out to explain: what is distinctive of ‘conscious’ phenomena.

In this article, I develop a higher-order interpretation of Leibniz's theory of consciousness according to which memory is constitutive of consciousness. I offer an account of Leibniz's theory of memory on which his theory of consciousness may be based, and I then show that Leibniz could have developed a coherent higher-order account. However, it is not clear whether Leibniz held (or should have held) such an account of consciousness; I sketch an alternative that has at least as many advantages as the higher-order theory. This analysis provides an important antecedent to the contemporary discussions of higher-order theories of consciousness.

We present a new method for characterizing the interpretive possibilities generated by elliptical constructions in natural language. Unlike previous analyses, which postulate ambiguity of interpretation or derivation in the full clause source of the ellipsis, our analysis requires no such hidden ambiguity. Further, the analysis follows relatively directly from an abstract statement of the ellipsis interpretation problem. It predicts correctly a wide range of interactions between ellipsis and other semantic phenomena such as quantifier scope and bound anaphora. Finally, although the analysis itself is stated nonprocedurally, it admits of a direct computational method for generating interpretations.

We investigate several approaches to resolution based automated theoremproving in classical higher-order logic (based on Church's simply typed-calculus) and discuss their requirements with respect to Henkincompleteness and full extensionality. In particular we focus on Andrews'higher-order resolution (Andrews 1971), Huet's constrained resolution (Huet1972), higher-order E-resolution, and extensional higher-order resolution(Benzmüller and Kohlhase 1997). With the help of examples we illustratethe parallels and differences of the extensionality treatment of these approachesand demonstrate that extensional higher-order resolution is the sole approach thatcan completely avoid additional extensionality axioms.

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..

In this paper we compare different models of vagueness viewed as a specific form of subjective uncertainty in situations of imperfect discrimination. Our focus is on the logic of the operator “clearly” and on the problem of higher-order vagueness. We first examine the consequences of the notion of intransitivity of indiscriminability for higher-order vagueness, and compare several accounts of vagueness as inexact or imprecise knowledge, namely Williamson’s margin for error semantics, Halpern’s two-dimensional semantics, and the system we call Centered semantics. We then propose a semantics of degrees of clarity, inspired from the signal detection theory model, and outline a view of higher-order vagueness in which the notions of subjective clarity and unclarity are handled asymmetrically at higher orders, namely such that the clarity of clarity is compatible with the unclarity of unclarity.