Overview of fundamental work in deontic logic.

Although the two volumes of _Logic, Language, and Meaning_ can be used independently of one another, together they provide a comprehensive overview of modern logic as it is used as a tool in the analysis of natural language. Both volumes provide exercises and their solutions. Volume 1, _Introduction to Logic_, begins with a historical overview and then offers a thorough introduction to standard propositional and first-order predicate logic. It provides both a syntactic and a semantic approach to inference and validity, (...) and discusses their relationship. Although language and meaning receive special attention, this introduction is also accessible to those with a more general interest in logic. In addition, the volume contains a survey of such topics as definite descriptions, restricted quantification, second-order logic, and many-valued logic. The pragmatic approach to non-truthconditional and conventional implicatures are also discussed. Finally, the relation between logic and formal syntax is treated, and the notions of rewrite rule, automation, grammatical complexity, and language hierarchy are explained. (shrink)

Quantification is a topic which brings together linguistics, logic, and philosophy. Quantifiers are the essential tools with which, in language or logic, we refer to quantity of things or amount of stuff. In English they include such expressions as no, some, all, both, many. Peters and Westerstahl present the definitive interdisciplinary exploration of how they work - their syntax, semantics, and inferential role.

Whereas geometrical oppositions (logical squares and hexagons) have been so far investigated in many fields of modal logic (both abstract and applied), the oppositional geometrical side of “deontic logic” (the logic of “obligatory”, “forbidden”, “permitted”, . . .) has rather been neglected. Besides the classical “deontic square” (the deontic counterpart of Aristotle’s “logical square”), some interesting attempts have nevertheless been made to deepen the geometrical investigation of the deontic oppositions: Kalinowski (La logique des normes, PUF, Paris, 1972) has proposed a (...) “deontic hexagon” as being the geometrical representation of standard deontic logic, whereas Joerden (jointly with Hruschka, in Archiv für Rechtsund Sozialphilosophie 73:1, 1987), McNamara (Mind 105:419, 1996) and Wessels (Die gute Samariterin. Zur Struktur der Supererogation, Walter de Gruyter, Berlin, 2002) have proposed some new “deontic polygons” for dealing with conservative extensions of standard deontic logic internalising the concept of “supererogation”. Since 2004 a new formal science of the geometrical oppositions inside logic has appeared, that is “ n -opposition theory”, or “NOT”, which relies on the notion of “logical bi-simplex of dimension m ” ( m = n − 1). This theory has received a complete mathematical foundation in 2008, and since then several extensions. In this paper, by using it, we show that in standard deontic logic there are in fact many more oppositional deontic figures than Kalinowski’s unique “hexagon of norms” (more ones, and more complex ones, geometrically speaking: “deontic squares”, “deontic hexagons”, “deontic cubes”, . . ., “deontic tetraicosahedra”, . . .): the real geometry of the oppositions between deontic modalities is composed by the aforementioned structures (squares, hexagons, cubes, . . ., tetraicosahedra and hyper-tetraicosahedra), whose complete mathematical closure happens in fact to be a “deontic 5-dimensional hyper-tetraicosahedron” (an oppositional very regular solid). (shrink)

The central aim of this paper is to present a Boolean algebraic approach to the classical Aristotelian Relations of Opposition, namely Contradiction and (Sub)contrariety, and to provide a 3D visualisation of those relations based on the geometrical properties of Platonic and Archimedean solids. In the first part we start from the standard Generalized Quantifier analysis of expressions for comparative quantification to build the Comparative Quantifier Algebra CQA. The underlying scalar structure allows us to define the Aristotelian relations in Boolean terms (...) and to propose a 3D visualisation by transforming a cube into an octahedron. In part two, the architecture of the CQA is shown to carry over, both to the classical quantifiers of Predicate Calculus and to the modal operators—which are given a Generalized Quantifier style re-interpretation. In this way we provide an algebraic foundation for Blanché’s Aristotelian hexagon as well as a 3D alternative to his 2D star-like visualisation. In a final part, a richer scalar structure is argued to underly the realm of Modality, thus generalizing the 3D algebra with eight (2 3 ) operators to a 4D algebra with sixteen (2 4 ) operators. The visual representation of the latter structure involves a transformation of the hypercube to a rhombic dodecahedron. The resulting 3D visualisation allows a straightforward embedding, not only of the classical Blanché star of Aristotelian relations or the paracomplete and paraconsistent stars of Béziau (Log Investig 10, 218–232, 2003) but also of three additional isomorphic Aristotelian constellations. (shrink)

This paper presents a generalization of the standard notions of left monotonicity (on the nominal argument of a determiner) and right monotonicity (on the VP argument of a determiner). Determiners such as “more than/at least as many as” or “fewer than/at most as many as”, which occur in so-called propositional comparison, are shown to be monotone with respect to two nominal arguments and two VP-arguments. In addition, it is argued that the standard Generalized Quantifier analysis of numerical determiners such as (...) “more than three/at least three” is a simplification which ignores the fundamental parallellism with the propositional comparatives. Furthermore, the symmetric monotonicity configurations of the existential “some” and “no” are shown to be straightforwardly related to those of numerical comparatives with the limit numeral zero, whereas the asymmetric configurations of universal “all” and “not all” involve the extra complicating mechanism of polarity reversal, which is related to Keenan's notion of co-intersectivity (as opposed to intersectivity). A second aim of the paper is to investigate some of the factors reducing the inferential potential of determiners. Different types of comparative determiners and their modification will be considered in detail. In addition, a systematic interaction will be revealed between the monotonicity properties of the determiners in propositional comparatives and the differ ent types of ellipsis in the “than”-complement. Different degrees of ellipsis are defined in terms of informational dependencies between the “than”-complement and the main clause. A general balancing mechanism is observed by virtue of which an increase in informational dependency is compensated by a reduction of the inferential potential of the comparative determiner. The structure of the paper is as follows. Part two deals with propositional comparison and introduces the two basic monotonicity configurations. Part three distinguishes three types of informational dependencies or ellipsis between the “than”-complement and the main clause. In Section 3.1 the “than”-complement only contains a VP constituent, whereas in Section 3.2. it only consists of a nominal constituent. Section 3.3 considers more complex instances of multiple dependencies. Section 3.4 then looks at the interaction of these three types with the modifier “proportionally”. Part four presents the two basic monotonicity configurations for numerical comparison, whereas part five deals with more complex numerical determiners. Bounding determiners, such as “between five and ten”, and other boolean combinations are discussed in Section 5.1, whereas Section 5.2 goes into approximative determiners involving modifiers such as “only” or “almost”. Section 5.3. is devoted to proportional determiners such as “more than two out of three”. Part six then considers the standard existential and universal quantifiers. Section 6.1 reformulates the standard Generalized Quantifier analysis in comparative terms, whereas Section 6.2 deals with exception determiners of the form “all but five”. (shrink)

Our aim is to show that translating the modal graphs of Moretti’s “n-opposition theory” (2004) into set theory by a suited device, through identifying logical modal formulas with appropriate subsets of a characteristic set, one can, in a constructive and exhaustive way, by means of a simple recurring combinatory, exhibit all so-called “logical bi-simplexes of dimension n” (or n-oppositional figures, that is the logical squares, logical hexagons, logical cubes, etc.) contained in the logic produced by any given modal graph (an (...) exhaustiveness which was not possible before). In this paper we shall handle explicitly the classical case of the so-called 3(3)-modal graph (which is, among others, the one of S5), getting to a very elegant tetraicosahedronal geometrisation of this logic. (shrink)

The Query is reasonable (First Order) Predicate Logic (PL:) is a ”Universal Grammar" for the languages of Elementary Arithmetic, Euclidean Geometry, Set Theory, Boolean Algebra, .... It defines their expressions, their semantic interpretations, and texts, called proofs, that syntactically characterize the boolean semantic entailment relation: P entails Q iff Q is true whenever P is.