When it comes to Kripke-style semantics for quantified modal logic, there’s a choice to be made concerning the interpretation of the quantifiers. The simple approach is to let quantifiers range over all possible objects, not just objects existing in the world of evaluation, and use a special predicate to make claims about existence. This is the constant domain approach. The more complicated approach is to assign a domain of objects to each world. This is the varying domain approach. Assuming that (...) all terms denote, the semantics of predication on the constant domain approach is obvious: either the denoted object has the denoted property in the world of evaluation, or it hasn’t. On the varying domain approach, there’s a third possibility: the object in question doesn’t exist. Terms may denote objects not included in the domain of the world of evaluation. The question is whether an atomic formula then should be evaluated as true or false, or if its truth value should be undefined. This question, however, cannot be answered in isolation. The consequences of one’s choice depends on the interpretation of molecular formulas. Should the negation of a formula whose truth value is undefined also be undefined? What about conjunction, universal quantification and necessitation? The main contribution of this paper is to identify two partial semantics for logical operators, a weak and a strong one, which uniquely satisfy a list of reasonable constraints. I also show that, provided that the point of using varying domains is to be able to make certain true claims about existence without using any existence predicate, this result yields two possible partial semantics for quantified modal logic with varying domains. (shrink)

A new type of formalization of classical first-order logic with equality is introduced on the basis of the sequent calculus. It serves to justify the claim that equality is a logical constant characterised by well-behaved rules satisfying properties usually regarded as essential. The main feature of this approach is the application of sequents built not only from formulae but also from terms. Two variants of sequent calculus are examined, a structural and a logical one. The former is defined in accordance (...) with Dos̆en’s criteria for logical constants. The latter is a standard Gentzen’s sequent calculus and satisfies Hacking’s criteria for logicality, including cut elimination. It is also shown that provided rules are harmonious in the sense advocated by Gratzl and Orlandelli. (shrink)

There has been very little discussion of the appropriate principles to govern a modal logic of plurals. What debate there has been has accepted a principle I call (Necinc); informally if this is one of those then, necessarily: this is one of those. On this basis Williamson has criticised the Boolosian plural interpretation of monadic second-order logic. I argue against (Necinc), noting that it isn't a theorem of any logic resulting from adding modal axioms to the plural logic PFO+, and (...) showing that the most obvious formal argument in its favour is question begging. I go on to discuss the behaviour of natural language plurals, motivating a case against (Necinc) by developing a case that natural language plural terms are not de jure rigid designators. The paper concludes by developing a model theory for modal PFO-f which does not validate (Necinc). An Appendix discusses (Necinc) in relation to counterpart theory. Of course, it would be a mistake to think that the rules for "multiple pointing" follow automatically from the rules for pointing proper. Max Black—The Elusiveness of Sets In some influential articles during the 1980s George Boolos proposed an interpretation of monadic second-order logic in terms of plural quantification [4, 5]. One objection to this proposal, pressed by Williamson [22, 456-7], focuses on the modal behaviour of plural variables, arguing that the proposed interpretation yields the wrong results in respect of the modal status of atomic predications. In the present paper I will present this objection and argue against it. In the course of developing the argument, I will have cause to consider the under-investigated question of how a logic for plurals should be extended to incorporate modal operators. (shrink)

The contribution of this paper lies with providing a systematically specified and intuitive interpretation pattern and delineating a class of relational structures and models providing a natural interpretation of logical operators on an underlying propositional calculus of Positive Lattice Logic and subsequently proving a generic completeness theorem for the related class of logics, sometimes collectively referred to as Generalized Galois Logics.

Quantified modal logic has reputation for complexity. Completeness results for the various systems appear piecemeal. Different tactics are used for different systems, and success of a given method seems sensitive to many factors, including the specific combination of choices made for the quantifiers, terms, identity, and the strength of the underlying propositional modal logic. The lack of a unified framework in which to view QMLs and their completeness properties puts pressure on those who develop, apply, and teach QML to work (...) with the simplest systems, namely those that adopt the Barcan Formulas and predicate logic rules for the quantifiers. In these systems, the quantifier ranges over a fixed domain of possible individuals, so advocates of these logics are sometimes called possibilists. A literature has grown up rationalizing the choice of possibilist logics despite ordinary intuitions that the resulting theorems are too strong.Williamson even takes the view that the complications to be faced within the weaker logics “are a warning sign of philosophical error”. It is the purpose of this paper to show that abandonment of the weaker QMLs is excessively fainthearted, since most QMLs can be given relatively simple formulations within one general framework. Given the straightforward nature of the systems and their completeness results, the purported complications evaporate, along with any philosophical warnings one might have associated with them. (shrink)

In this article I defend a form of classical possibilism with an actualist foundation. As a matter of fact, I believe that this position is more in keeping with the classical metaphysical tradition. According to this form of possibilism, I construe possible objects as possible non-existing objects of an existing producing power. Consequently, they are nothing vis-à -vis the modality of their own actual being, although they do exist with regard to the modality of the producing power’s being. The actualist (...) requirement prescribed by the Frege-Quinean criterion of the quantification domain is thus fulfilled; indeed, really possible objects are not actual objects, but their possibility is actual. (shrink)

How to interpret singular terms in fiction? In this paper, we address this semantic question from the perspective of the Artifactual Theory of Fiction (ATF). According to the ATF, fictional characters exist as abstract artifacts created by their author, and preserved through the existence of copies of an original work and a competent readership. We pretend that a well-suited semantics for the ATF can be defined with respect to a modal framework by means of Hintikka’s world lines semantics. The question (...) of the interpretation of proper names is asked in relation to two inference rules, problematic when applied in intensional contexts: the Substitution of Identicals and Existential Generalization. The former fails because identity is contingent. The latter because proper names are not necessarily linked to well-identified individuals. This motivates a non-rigid interpretation of proper names in fiction, although cross-fictional reference (e.g. to real entities) is made possible by the interpretative efforts of the reader. (shrink)

It is acknowledged by proponents of the Artifactual Theory of Fiction that literary works sometimes involve real or immigrant characters. However, their conception of cross-fictional identity faces serious difficulties. In this paper, we set the problem in the context of a modal framework, in relation to quantification across a plurality of possible worlds. Quantification is explained in terms of Hintikka’s notion of world lines; i.e. the possible values of bound variables are individuals that are not reduced to their manifestations. We (...) finally offer another understanding of identity across weakly impermeable domains, in a way compatible with the Artifactual Theory of Fiction. (shrink)

Tarski apresentou sua definição de operador de consequência com a intenção de expor as concepções fundamentais da consequência lógica. Um espaço de Tarski é um par ordenado determinado por um conjunto não vazio e um operador de consequência sobre este conjunto. Esta estrutura matemática caracteriza um espaço quase topológico. Este artigo mostra uma visão algébrica dos espaços de Tarski e introduz uma lógica proposicional modal que interpreta o seu operador modal nos conjuntos fechados de algum espaço de Tarski. DOI:10.5007/1808-1711.2010v14n1p47.

Kurt Gödel’s version of the Ontological Proof derives rather than assumes the crucial Possibility Claim: the claim that it is possible that something God-like exists. Gödel’s derivation starts off with a proof of the Possible Instantiation of the Positive: the principle that, if a property is positive, it is possible that there exists something that has that property. I argue that Gödel’s proof of this principle relies on some implausible axiological assumptions but it can be patched so that it only (...) relies on plausible principles. But Gödel’s derivation of the Possibility Claim also needs a substantial axiological assumption, which is still open to doubt. (shrink)

In “Facts: Particulars of Information Units?”, Kratzer proposed a causal analysis of knowledge in which knowledge is defined as a form of de re belief of facts. In support of Kratzer’s view, I show that a certain articulation of the de re/de dicto distinction can be used to integrally account for the original pair of Gettier cases. In contrast to Kratzer, however, I think such an account does not fundamentally require a distinction between facts and true propositions. I then discuss (...) whether this account might be generalized and whether it can give us a reductive analysis of knowledge as de re true belief. Like Kratzer, I think it will not, in particular the distinction appears inadequate to account for Ginet-Goldman cases of causally connected but unreliable belief. Nevertheless, I argue that the de re belief analysis allows us to account for a distinction Starmans and Friedman recently introduced between apparent evidence and authentic evidence in their empirical study of Gettier cases, in a way that questions their claim that a causal disconnect is not operative in the contrasts they found. (shrink)

Classical first-order logic can be extended in two different ways to serve as a foundation for mathematics: introduce higher orders, type theory, or introduce sets. As it happens, both approaches have natural analogs for quantified modal logics, both approaches date from the 1960’s, one is not very well-known, and the other is well-known as something else. I will present the basic semantic ideas of both higher order intensional logic, and intensional set theory. Before doing so, I’ll quickly sketch some necessary (...) background material from quantified modal logic. Except for standard material concerning propositional modal logics, the paper is essentially self-contained. (shrink)

Proceedings of the 11th Semantics and Linguistic Theory Conference, held May 11-13, 2001, at New York University.

This book is both an introduction to and a research work on Meinongianism. “Meinongianism” is taken here, in accordance with the common philosophical jargon, as a general label for a set of theories of existence – probably the most basic notion of ontology. As an introduction, the book provides the first comprehensive survey and guide to Meinongianism and non-standard theories of existence in all their main forms. As a research work, the book exposes and develops the most up-to-date Meinongian theory (...) (called modal Meinongianism), applies it to specific fields, and discusses its open problems. Part I of the book provides a historical introduction to, and critical discussion of, the dominant philosophical view of existence: the “Kantian-Fregean-Quinean” perspective. Part II is the full-fledged introduction to the Meinongian theories of existence as a real property of individuals: after starting with the so-called naïve Meinongian conception and its problems, it provides a self-contained presentation of the main neo-Meinongian proposals, and a detailed discussion of their strengths and weaknesses. Part III develops a specific neo-Meinongian theory of existence employing a model-theoretic semantic framework. It discusses its application to the ontology and semantics of fictional objects, and its open problems. The methodology of the book follows the most recent trends in analytic ontology. In particular, the meta-ontological point of view is largely privileged. (shrink)

There is an obvious difference between what a term designates and what it means. At least it is obvious that there is a difference. In some way, meaning determines designation, but is not synonymous with it. After all, “the morning star” and “the evening star” both designate the planet Venus, but don't have the same meaning. Intensional logic attempts to study both designation and meaning and investigate the relationships between them.

Generalized databases will be examined, in which attributes can be sets of attributes, or sets of sets of attributes, and other higher type constructs. A precise semantics will be developed for such databases, based on a higher type modal/intensional logic.

cal practice: the enterprise of specifying information about the world for use in computer systems. Knowledge representation as a field also encompasses conceptual results that call practitioners’ attention to important truths about the world, mathematical results that allow practitioners to make these truths precise, and computational results that put these truths to work. This chapter surveys this practice and its results, as it applies to the interpretation of natural language utterances in implemented natural language processing systems. For a broader perspective (...) on such technical practice, in all its strengths and weaknesses, see (Agre 1997). Knowledge representation offers a powerful general tool for the science of language. Computational logic, a prototypical formalism for representing knowledge about the world, is also the model for the level of logical form that linguists use to characterize the grammar of meaning (Larson and Segal 1995). And researchers from (Schank and Abelson 1977) to (Shieber 1993) and (Bos to appear) have relied crucially on such representations, and the inference methods associated with them, in articulating accounts of semantic relations in language, such as synonymy, entailment, informativeness and contradiction. The new textbooks (Blackburn and Bos 2002a, Blackburn and Bos 2002b) provide an excellent grounding in this research, and demonstrate how deeply computational ideas from knowledge representation can inform pure linguistic study. In this short chapter, I must leave much of.. (shrink)

This chapter investigates the computational consequences of a broadly Gricean view of language use as intentional activity. In this view, dialogue rests on coordinated reasoning about communicative intentions. The speaker produces each utterance by formulating a suitable communicative intention. The hearer understands it by recognizing the communicative intention behind it. When this coordination is successful, interlocutors succeed in considering the same intentions— that is, the same representations of utterance meaning—as the dialogue proceeds. In this paper, I emphasize that these intentions (...) can be formalized; we can provide abstract but systematic representations that spell out what a speaker is trying to do with an utterance. Such representations describe utterances simultaneously as the product of our knowledge of grammar and as actions chosen for a reason. In particular, they must characterize the speaker’s utterance in grammatical terms, provide the links to the context that the grammar requires, and so arrive at a contribution that the speaker aims to achieve. Because I have implemented this formalism, we can regard it as a possible analysis of conversational processes at the level of computational theory. Nevertheless, this analysis leaves open what the nature of the biological computation involved in inference to intentions is, and what regularities in language use support this computation. (shrink)

Kit Fine has proposed a new solution to what he calls ‘a familiar puzzle’ concerning modality and existence. The puzzle concerns the argument from the alleged truths ‘It is necessary that Socrates is a man’ and ‘It is possible that Socrates does not exist’ to the apparent falsehood ‘It is possible that Socrates is a man and does not exist’. We discuss in detail Fine’s setting up of the ‘puzzle’ and his rejection, with which we concur, of two mooted solutions (...) to it. (One of these uses standard, Kripkean, notions, and the other rests on work done by Arthur Prior.) We set out, and reject, the philosophy of modality underlying Fine’s new solution, and we defend an alternative response to the alleged puzzle. Our solution follows the work of David Wiggins in distinguishing between the sentential operator ‘It is necessary that’ and the predicate modifier ‘necessarily’. We briefly provide this distinction with a possible- world semantics on which it is neither a necessary truth, in some sense, that Socrates exists nor true, in some sense, that Socrates necessarily exists. (shrink)

De modo geral, este texto é uma incursão em lógica filosófica e filosofia da lógica. Ele contém reflexões originais acerca dos conceitos de paraconsistência, modalidades e cognoscibilidade e suas possíveis relações. De modo específico, o texto avança em quatro direções principais: inicialmente, uma definição genérica de lógicas não clássicas utilizando a ideia de lógica abstrata é sugerida. Em seguida, é mostrado como técnicas manuais de paraconsistentização de lógicas são usadas para gerar sistemas particulares de lógicas paraconsistentes. Depois, uma definição de (...) possibilidade lógica é proposta por meio da ideia de limites de sequências de fórmulas. Por fim, muitas abordagens distintas ao paradoxo de Fitch e, consequentemente, aos limites do conhecimento são apresentadas considerando as reflexões anteriores. (shrink)

Special issue: "Reflecting on the Legacy of C.I. Lewis: Contemporary and Historical Perspectives on Modal Logic".

Conditional logics were originally developed for the purpose of modeling intuitively correct modes of reasoning involving conditional—especially counterfactual—expressions in natural language. While the debate over the logic of conditionals is as old as propositional logic, it was the development of worlds semantics for modal logic in the past century that catalyzed the rapid maturation of the field. Moreover, like modal logic, conditional logic has subsequently found a wide array of uses, from the traditional (e.g. counterfactuals) to the exotic (e.g. conditional (...) obligation). Despite the close connections between conditional and modal logic, both the technical development and philosophical exploitation of the latter has outstripped that of the former, with the result that noticeable lacunae exist in the literature on conditional logic. My dissertation addresses a number of these underdeveloped frontiers, producing new technical insights and philosophical applications. -/- I contribute to the solution of a problem posed by Priest of finding sound and complete labeled tableaux for systems of conditional logic from Lewis' V-family. To develop these tableaux, I draw on previous work on labeled tableaux for modal and conditional logic; errors and shortcomings in recent work on this problem are identified and corrected. While modal logic has by now been thoroughly studied in non-classical contexts, e.g. intuitionistic and relevant logic, the literature on conditional logic is still overwhelmingly classical. Another contribution of my dissertation is a thorough analysis of intuitionistic conditional logic, in which I utilize both algebraic and worlds semantics, and investigate how several novel embedding results might shed light on the philosophical interpretation of both intuitionistic logic and conditional logic extensions thereof. -/- My dissertation examines deontic and connexive conditional logic as well as the underappreciated history of connexive notions in the analysis of conditional obligation. The possibility of interpreting deontic modal logics in such systems (via embedding results) serves as an important theoretical guide. A philosophically motivated proscription on impossible obligations is shown to correspond to, and justify, certain (weak) connexive theses. Finally, I contribute to the intensifying debate over counterpossibles, counterfactuals with impossible antecedents, and take—in contrast to Lewis and Williamson—a non-vacuous line. Thus, in my view, a counterpossible like "If there had been a counterexample to the law of the excluded middle, Brouwer would not have been vindicated" is false, not (vacuously) true, although it has an impossible antecedent. I exploit impossible (non-normal) worlds—originally developed to model non-normal modal logics—to provide non-vacuous semantics for counterpossibles. I buttress the case for non-vacuous semantics by making recourse to both novel technical results and theoretical considerations. (shrink)

This thesis addresses three challenges posed by intentionality - the ability of our mental states and language to be about something - to a logician: an apparent reference to non-existent objects, intentional indeterminacy and the failure of substitutivity of coextensive terms in an intentional context. Since intentionality plays an important role in our everyday reasoning, a proper formal account of it is highly desirable, yet it requires a departure from classical logic. One can modify classical logic and adapt the formal (...) apparatus to account for the aforementioned problems (Graham Priest’s logic for intentionality serves as an example of such an approach in this work) or one can make an even more radical shift and seek for inspiration in a different logical tradition like the terminist logic developed in the Late Middle Ages by figures like William of Ockham or John Buridan. The second path is explored here as a modest attempt to show that once we abandon the bias against the history of logic as irrelevant, we can actually get access to firm logical solutions inaccessible from a classical perspective, while still practising logic proper. (shrink)

This paper develops a general approach to contextual reasoning in natural language processing. Drawing on the view of natural language interpretation as abduction (Hobbs et al., 1993), we propose that interpretation provides an explanation of how an utterance creates a new discourse context in which its interpreted content is both true and promi- nent. Our framework uses dynamic theories of semantics and pragmatics, formal theories of context, and models of attentional state. We describe and illustrate a Prolog implementation.

Can we find propositions that cannot rationally be denied in any possible world without assuming the existence of that same proposition, and so involving ourselves in a contradiction? In other words, can we find transworld propositions needing no further foundation or justification? Basically, three differing positions can be imagined: firstly, a relativist position, according to which ultimately founded propositions are impossible; secondly, a meta-relativist position, according to which ultimately founded propositions are possible but unnecessary; and thirdly, an absolute position, according (...) to which such propositions are necessary. In this short essay I show that under the premise of modal logic S5 with constant domain there are ultimately founded propositions and that their existence is even necessary, and I will give some reasons for the superiority of S5 over other logics. (shrink)