Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces- so -called "topological semantics." The first is classical higher-order logic, with relational quantification of finitely high type; the second system is a predicative fragment thereof with quantification over functions between types, but not over arbitrary relations. The second theorem applies to intuitionistic as well as classical logic.

This volume presents a definitive introduction to twenty core areas of philosophical logic including classical logic, modal logic, alternative logics and close ...

The representation of quantification over relations in monadic third-order logic is discussed; it is shown to be possible in numerous special cases of foundational interest, but not in general unless something akin to the Axiom of Choice is assumed.

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)

where ‘aa’ is a plural term, and ‘F’ a plural predicate. Following George Boolos (1984) and others, many philosophers and logicians also think that plural expressions should be analysed as not introducing any new ontological commitments to some sort of ‘plural entities’, but rather as involving a new form of reference to objects to which we are already committed (for an overview and further details, see Linnebo 2004). For instance, the plural term ‘aa’ refers to Alice, Bob and Charlie simultaneously, (...) and the plural predicate ‘F’ is true of some things just in case these things cooperate. A natural question that arises is whether the step from the singular to the plural can be iterated. Are there terms that stand to ordinary plural terms the way ordinary plural terms stand to singular terms? Let’s call such terms superplural. A superplural term would thus, loosely speaking, refer to several ‘pluralities’ at once, much as an ordinary plural term refers to several objects at once.1 Further, let’s call a predicate superplural if it can be predicated of superplural terms. It is reasonably straightforward to devise a formal logic of superplural terms, superplural predicates, and even superplural quantifiers (see Rayo 2006). But does this formal logic reflect any features of natural languages? In particular, does ordinary English contain superplural terms and predicates? The purpose of this article is to address these questions. We examine some earlier arguments for the existence of superplural expressions in English and find them to be either.. (shrink)

This text is a short introduction to logic that was primarily used for accompanying an introductory course in Logic for Linguists held at the New University of Lisbon (UNL) in fall 2010. The main idea of this course was to give students the formal background and skills in order to later assess literature in logic, semantics, and related fields and perhaps even use logic on their own for the purpose of doing truth-conditional semantics. This course in logic does not replace (...) a proper introduction to semantics and is not intended as such, although parts of Chapter 1 and 4 could be used to supplement an introductory course in semantics. In contrast to other introductions it has a certain focus on ‘writing things down correctly.’ Proofs of metatheorems are omitted, though. -/- This is work in progress. Please send suggestions and corrigenda to erich@snafu.de. Have fun! (shrink)

In the Begriffschrift Frege drew no distinction—or anyway signalled no importance to the distinction—between quantifying into positions occupied by what he called eigennamen—singular terms—in a sentence and quantification into predicate position or, more generally, quantification into open sentences—into what remains of a sentence when one or more occurrences of singular terms are removed. He seems to have conceived of both alike as perfectly legitimate forms of generalisation, each properly belonging to logic. More accurately: he seems to have conceived of quantification (...) as such as an operation of pure logic, and in effect to have drawn no distinction between first-order, second-order and higherorder quantification in general. (shrink)