A metaphysical system engendered by a third order quantified modal logic S5 plus impredicative comprehension principles is used to isolate a third order predicate D, and by being able to impredicatively take a second order predicate G to hold of an individual just if the individual necessarily has all second order properties which are D we in Section 2 derive the thesis (40) that all properties are D or some individual is G. In Section 3 theorems 1 to 3 suggest (...) a sufficient kinship to Gödelian ontological arguments so as to think of thesis (40) in terms of divine property and Godly being; divine replaces positive with Gödel and others. Thesis (40), the sacred thesis, supports the ontological argument that God exists because some property is not divine. In Section 4 a fixed point analysis is used as diagnosis so that atheists may settle for the minimal fixed point. Theorem 3 shows it consistent to postulate theistic fixed points, and a monotheistic result follows if one assumes theism and that it is divine to be identical with a deity. Theorem 4 (the Monotheorem) states that if Gg and it is divine to be identical with g, then necessarily all objects which are G are identical with g. The impredicative origin of D suggests weakened Gaunilo-like objections that offer related theses for other second order properties and their associated diverse presumptive individual bearers. Nevertheless, in the last section we finesse these Gaunilo-like objections by adopting what we call an apathiatheistic opinion which suggest that the best concepts `God’ allow thorough indifference as to whether God exists or not. (shrink)

In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general models and have a natural definition. As a class they do not validate the axiom of Extensionality. We give a cut-free sequent calculus for type theory and show completeness of this calculus with respect to the class of intensional models via a model existence theorem. After this we turn our attention to applications. Firstly, it (...) is argued that, since ITL is truly intensional, it can be used to model ascriptions of propositional attitude without predicting logical omniscience. In order to illustrate this a small fragment of English is defined and provided with an ITL semantics. Secondly, it is shown that ITL models contain certain objects that can be identified with possible worlds. Essential elements of modal logic become available within classical type theory once the axiom of Extensionality is given up. (shrink)

The paper shows how ideas that explain the sense of an expression as a method or algorithm for finding its reference, preshadowed in Frege’s dictum that sense is the way in which a referent is given, can be formalized on the basis of the ideas in Thomason (1980). To this end, the function that sends propositions to truth values or sets of possible worlds in Thomason (1980) must be replaced by a relation and the meaning postulates governing the behaviour of (...) this relation must be given in the form of a logic program. The resulting system does not only throw light on the properties of sense and their relation to computation, but also shows circular behaviour if some ingredients of the Liar Paradox are added. The connection is natural, as algorithms can be inherently circular and the Liar is explained as expressing one of those. Many ideas in the present paper are closely related to those in Moschovakis (1994), but receive a considerably lighter formalization. (shrink)

Provides a comprehensive overview and introduction to the Routledge Handbook of Propositions.

While much of semantic theorizing is based on intuitions about logical phenomena associated with linguistic constructions—phenomena such as consistency and entailment—it is rare to see axiomatic treatments of linguistic fragments. Given a fragment interpreted in some class of formally specified models, it is often possible to ask for a characterization of the reasoning patterns validated by the class of models. Axiomatizations provide such a characterization, often in a perspicuous and efficient manner. In this paper, we highlight some of the benefits (...) of providing axiomatizations for the purpose of semantic theorizing. We illustrate some of these benefits using three examples from the study of modality. (shrink)

This paper presents and advocates an approach to the semantics of opinion statements, including matters of personal taste and moral claims. In this framework, ‘outlook-based semantics’, the circumstances of evaluation are not composed of a possible world and a judge ; rather, outlooks replace possible worlds in the role of circumstance of evaluation. Outlooks are refinements of worlds that settle not only matters of fact but also matters of opinion. Several virtues of the framework and advantages over existing implementations of (...) world-judge relativism are demonstrated in this paper. First, world-judge relativism does not actually explain the ‘disagreement’ of ‘faultless disagreement’, while a straightforward explanation suggests itself in outlook-based semantics. Second, outlook-based semantics provides an account of subjective attitude verbs that can capture lack of opinionatedness. Third, outlook-based semantics unproblematically explains the connection-building role of aesthetic discourse and the group-relevance of discretionary assertions, while capturing the same effects in world-judge relativism obviates the purpose of the judge parameter. Finally, because the proposed circumstances of evaluation are entirely analogous to possible worlds, the framework is easy to use and extend. (shrink)

The verification of a sentence against a visual display in experimental conditions reveals a procedure that is driven solely by the properties of the linguistic input and not by the properties of the context (the set-up of the visual display) or extra-linguistic cognition (operations executed to obtain the truth value). This procedure, according to the Interface Transparency Thesis (ITT) (Lidz et al. in Nat Lang Semant 19(3):227–256, 2011), represents the meaning of an expression at the interface with the ‘conceptual-intentional’ system (...) (Chomsky in The minimalist program. MIT Press, Cambridge, 1995). My experiments provide support for the ITT by replicating in Polish and in Bulgarian the findings of Lidz et al. (Nat Lang Semant 19(3):227–256, 2011) for the English quantifier most. We also obtain new evidence that participants are prompted to switch between verification procedures by a change in the linguistic input (a different superlative quantifier entailed by most), but not by a change in the visual input. Thus, the motivation for the subconscious switch in procedures is not to maximize efficiency. Participants use the procedure associated with each quantifier, and in effect, the same display is verified differently depending on which information the visual system is instructed to use by the semantic representation of the sentence. (shrink)

This is part I of a two-part essay introducing case-intensional first order logic, an easy-to-use, uniform, powerful, and useful combination of first-order logic with modal logic resulting from philosophical and technical modifications of Bressan’s General interpreted modal calculus. CIFOL starts with a set of cases; each expression has an extension in each case and an intension, which is the function from the cases to the respective case-relative extensions. Predication is intensional; identity is extensional. Definite descriptions are context-independent terms, and lambda-predicates (...) and -operators can be introduced without constraints. These logical resources allow one to define, within CIFOL, important properties of properties, viz., extensionality and absoluteness, Bressan’s chief innovation that allows tracing an individual across cases without recourse to any notion of “rigid designation” or “trans-world identity.” Thereby CIFOL abstains from incorporating any metaphysical principles into the quantificational machinery, unlike extant frameworks of quantified modal logic. We claim that this neutrality makes CIFOL a useful tool for discussing both metaphysical and scientific arguments involving modality and quantification, and we illustrate by discussing in diagrammatic detail a number of such arguments involving the extensional identification of individuals via absolute properties, essential properties, de re vs. de dicto, and the results of possible tests. (shrink)

We present an embedding of quantified multimodal logics into simple type theory and prove its soundness and completeness. A correspondence between QKπ models for quantified multimodal logics and Henkin models is established and exploited. Our embedding supports the application of off-the-shelf higher-order theorem provers for reasoning within and about quantified multimodal logics. Moreover, it provides a starting point for further logic embeddings and their combinations in simple type theory.

We show that basic hybridization makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are to add nominals as expressions of type t, and to extend to arbitrary types the way we interpret \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$@_i$\end{document} in propositional and first-order hybrid logic. This means: interpret \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$@_i\alpha _a$\end{document}, where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} (...) \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\alpha _a$\end{document} is an expression of any type \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$a$\end{document}, as an expression of type \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$a$\end{document} that rigidly returns the value that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\alpha_a$\end{document} receives at the i-world. The axiomatization and completeness proofs are generalizations of those found in propositional and first-order hybrid logic, and we automatically obtain a wide range of completeness results for stronger logics and languages. Our approach is deliberately low-tech. We don’t, for example, make use of Montague’s intensional type s, or Fitting-style intensional models; we build, as simply as we can, hybrid logicover Henkin’s logic. (shrink)

This paper presents detailed formalizations of ontological arguments in a simple modal natural deduction calculus. The first formal proof closely follows the hints in Scott’s manuscript about Gödel’s argument and fills in the gaps, thus verifying its correctness. The second formal proof improves the first one, by relying on the weaker modal logic KB instead of S5 and by avoiding the equality relation. The second proof is also technically shorter than the first one, because it eliminates unnecessary detours and uses (...) Axiom 1 for the positivity of properties only once. The third and fourth proofs formalize, respectively, Anderson’s and Bjørdal’s variants of the ontological argument, which are known to be immune to modal collapse. (shrink)

We show that basic hybridization (adding nominals and @ operators) makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are to add nominals as expressions of type t, and to extend to arbitrary types the way we interpret $@_i$ in propositional and first-order hybrid logic. This means: interpret $@_i\alpha _a$ , where $\alpha _a$ is an expression of any type $a$ , as an expression of type $a$ that (...) rigidly returns the value that $\alpha_a$ receives at the i-world. The axiomatization and completeness proofs are generalizations of those found in propositional and first-order hybrid logic, and (as is usual inhybrid logic) we automatically obtain a wide range of completeness results for stronger logics and languages. Our approach is deliberately low-tech. We don’t, for example, make use of Montague’s intensional type s, or Fitting-style intensional models; we build, as simply as we can, hybrid logicover Henkin’s logic. (shrink)

In this paper I argue that deontic modals are hyperintensional, i.e. logically equivalent contents cannot be substituted in their scope. I give two arguments, one deductive and the other abductive. First, I show that the contrary thesis leads to falsity; second, I argue that a hyperintensional theory of deontic modals fares better than its rivals in terms of elegance, theoretical simplicity and explanatory power. I then propose a philosophical analysis of this thesis and outline some consequences. In Section 1 I (...) introduce and define deontic modality and hyperintensionality. In Section 2 I give a reductio for the hyperintensionality of deontic modals. If the argument is sound, a useful corollary is that deontic modals are also non-intensional, and therefore possible-world semantics accounts are illfitted for them. I then show how the main result can be strengthened or weakened by varying the definition of logical validity. In Section 3 I give an abductive argument for the hyperintensionality of deontic modals, arguing that with a single move we are able to solve many paradoxes and puzzles traditionally troubling deontic logic. I present a version of a hyperintensional deontic logic in an appendix, which I prove is sound and complete with respect to a version of truthmaker semantics. (shrink)

This article concerns the treatment of propositional quantification in a framework of labelled natural deduction for modal logic developed by Basin, Matthews and Viganò. We provide a detailed analysis of a basic calculus that can be used for a proof-theoretic rendering of minimal normal multimodal systems with quantification over stable domains of propositions. Furthermore, we consider variations of the basic calculus obtained via relational theories and domain theories allowing for quantification over possibly unstable domains of propositions. The main result of (...) the article is that fragments of the labelled calculi not exploiting reductio ad absurdum enjoy the Church–Rosser property and the strong normalization property; such result is obtained by combining Girard’s method of reducibility candidates and labelled languages of lambda calculus codifying the structure of modal proofs. (shrink)

This paper follows Part I of our essay on case-intensional first-order logic (CIFOL; Belnap and Müller (2013)). We introduce a framework of branching histories to take account of indeterminism. Our system BH-CIFOL adds structure to the cases, which in Part I formed just a set: a case in BH-CIFOL is a moment/history pair, specifying both an element of a partial ordering of moments and one of the total courses of events (extending all the way into the future) that that moment (...) is part of. This framework allows us to define the familiar Ockhamist temporal/modal connectives, most notably for past, future, and settledness. The novelty of our framework becomes visible in our discussion of substances in branching histories, i.e., in its first-order part. That discussion shows how the basic idea of tracing an individual thing from case to case via an absolute property is applicable in a branching histories framework. We stress the importance of keeping apart extensionality and moment-definiteness, and give a formal account of how the specification of natural sortals and natural qualities turns out to be a coordination task in BH-CIFOL. We also provide a detailed answer to Lewis’s well-known argument against branching histories, exposing the fallacy in that argument. (shrink)