The author considers the model-theoretic character of proofs and disproofs by means of attempted counterexample constructions, distinguishes this proof format from formal derivations, then contrasts two approaches to semantic tableaux proposed by Beth and Lambert-van Fraassen. It is noted that Beth's original approach has not as yet been provided with a precisely formulated rule of closure for detecting tableau sequences terminating in contradiction. To remedy this deficiency, a technique is proposed to clarify tableau operations.

In this dissertation we present proof systems for several modal logics. These proof systems are based on analytic (or semantic) tableaux. -/- Modal logics are logics for reasoning about possibility, knowledge, beliefs, preferences, and other modalities. Their semantics are almost always based on Saul Kripke’s possible world semantics. In Kripke semantics, models are represented by relational structures or, equivalently, labeled graphs. Syntactic formulas that express statements about knowledge and other modalities are evaluated in terms of such models. -/- (...) This dissertation focuses on modal logics with dynamic operators for public announcements, belief revision, preference upgrades, and so on. These operators are defined in terms of mathematical operations on Kripke models. Thus, for example, a belief revision operator in the syntax would correspond to a belief revision operation on models. -/- The ‘dynamic’ semantics of dynamic modal logics are a clever way of extending languages without compromising on intuitiveness. We present ‘dynamic’ tableau proof systems for these dynamic semantics, with the express aim to make them conceptually simple, easy to use, modular, and extensible. This we do by reflecting the semantics as closely as possible in the components of our tableau system. For instance, dynamic operations on Kripke models have counterpart dynamic relations between tableaux. -/- Soundness, completeness, and decidability are three of the most important properties that a proof system may have. A proof system is sound if and only if any formula for which a proof exists, is true in every model. A proof system is complete if and only if for any formula that is true in all models, a proof exists. A proof system is decidable if and only if any formula can be proved to be a theorem or not a theorem in a finite number of steps. All proof systems in this dissertation are sound, complete, and decidable. -/- Part of our strategy to create modular tableau systems is to delay concerns over decidability until after soundness and completeness have been established. Decidability is attained through the operations of folding and through operations on ‘tableau cascades’, which are graphs of tableaux. -/- Finally, we provide a proof-of-concept implementation of our dynamic tableau system for public announcement logic in the Clojure programming language. (shrink)

Dung’s argumentation frameworks are formalisms widely used to model interaction among arguments. Although their study has been profusely developed in the field of Artificial Intelligence, it is not common to see its treatment among those less connected to computer science within the logical-philosophical community. In this paper we propose to bring to that audience a proof-theory for argument justification based on tableaux, very similar to those the Logic students are familiar with. The tableaux enable to calculate whether an (...) argument or subset of arguments are accepted or rejected in accordance to Dung’s preferred and grounded extension-based semantics. Soundness and completeness results regarding those semantics are provided. (shrink)

The article develops and justifies, on the basis of the epistemological argumentation theory, two central pieces of the theory of evaluative argumentation interpretation: 1. criteria for recognizing argument types and 2. rules for adding reasons to create ideal arguments. Ad 1: The criteria for identifying argument types are a selection of essential elements from the definitions of the respective argument types. Ad 2: After presenting the general principles for adding reasons (benevolence, authenticity, immanence, optimization), heuristics are proposed for finding missing (...) reasons, for deductive arguments, e.g., semantic tableaux are suggested. (shrink)

This paper presents a sequent calculus and a dual domain semantics for a theory of definite descriptions in which these expressions are formalised in the context of complete sentences by a binary quantifier I. I forms a formula from two formulas. Ix[F, G] means ‘The F is G’. This approach has the advantage of incorporating scope distinctions directly into the notation. Cut elimination is proved for a system of classical positive free logic with I and it is shown to be (...) sound and complete for the semantics. The system has a number of novel features and is briefly compared to the usual approach of formalising ‘the F ’ by a term forming operator. It does not coincide with Hintikka’s and Lambert’s preferred theories, but the divergence is well-motivated and attractive. (shrink)

ABSTRACT: This 1974 paper builds on our 1969 paper (Corcoran-Weaver [2]). Here we present three (modal, sentential) logics which may be thought of as partial systematizations of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of these three logics coincide with one another and with those of standard formalizations of Lewis's S5. These logics, when regarded as logistic systems (cf. Corcoran [1], p. 154), are seen to be (...) equivalent; but, when regarded as consequence systems (ibid., p. 157), one diverges from the others in a fashion which suggests that two standard measures of semantic complexity may not be as closely linked as previously thought. -/- This 1974 paper uses the linear notation for natural deduction presented in [2]: each two-dimensional deduction is represented by a unique one-dimensional string of characters. Thus obviating need for two-dimensional trees, tableaux, lists, and the like—thereby facilitating electronic communication of natural deductions. The 1969 paper presents a (modal, sentential) logic which may be thought of as a partial systematization of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of this logic coincides those of standard formalizations of Lewis’s S4. Among the paper's innovations is its treatment of modal logic in the setting of natural deduction systems--as opposed to axiomatic systems. The author’s apologize for the now obsolete terminology. For example, these papers speak of “a proof of a sentence from a set of premises” where today “a deduction of a sentence from a set of premises” would be preferable. 1. Corcoran, John. 1969. Three Logical Theories, Philosophy of Science 36, 153–77. J P R -/- 2. Corcoran, John and George Weaver. 1969. Logical Consequence in Modal Logic: Natural Deduction in S5 Notre Dame Journal of Formal Logic 10, 370–84. MR0249278 (40 #2524). 3. Weaver, George and John Corcoran. 1974. Logical Consequence in Modal Logic: Some Semantic Systems for S4, Notre Dame Journal of Formal Logic 15, 370–78. MR0351765 (50 #4253). (shrink)

The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic (CPL), yielding a hierarchy of tractable depth-bounded approximations to that logic, which in turn has been based on a KE/KI system. -/- This Thesis shows that the approach can be (...) naturally extended to useful nonclassical logics such as First-Degree Entailment (FDE), the Logic of Paradox (LP), Strong Kleene Logic (K3 ) and Intuitionistic Propositional Logic (IPL). To do this, we introduce a KE/KI-style system for each of those logics such that: is formulated via signed formulae, consist of linear operational rules and branching structural rule(s), can be used as a direct-proof and a refutation method, and is interesting independently of the approach in that it has an exponential speed-up on its tableau system counterpart. The latter given that we introduce a new class of examples which we prove to be hard for all tableau systems sharing the V/& rules with the classical one, but easy for their analogous KE-style systems. Then we focus on showing that each of our KE/KI-style systems naturally yields a hierarchy of tractable depth-bounded approximations to the respective logic, in terms of the maximum number of allowed nested applications of the branching rule(s). The rule(s) express(es) a generalized rule of bivalence, is (are) essentially cut rule(s) and govern(s) the manipulation of virtual information, which is information that an agent does not hold but she temporarily assumes as if she held it. Intuitively, the more virtual information needs to be invoked via the branching rule(s), the harder the inference is for the agent. So, the nested application the branching rule(s) provides a sensible measure of inferential depth. We also show that each hierarchy approximating FDE, LP, and K3 , admits of a 5-valued non-deterministic semantics; whereas, paving the way for a semantical characterization of the hierarchy approximating IPL, we provide a 3-valued non-deterministic semantics for the full logic that fixes the meaning of the connectives without appealing to “structural” conditions. -/- Moreover, we show a super-polynomial lower bound for the strongest possible version of clausal tableaux on the well-known class of “truly fat” expressions (which are easy for KE), settling a problem left open in the literature. Further, we investigate a hierarchy of tractable depth-bounded approximations to CPL based only on KE. Finally, we propose a refinement of the p-simulation relation which is adequate to establish positive results about the superiority of a system over another with respect to proof-search. (shrink)

In this paper I introduce the idea of a higher-order modal logic—not a modal logic for higher-order predicate logic, but rather a logic of higher-order modalities. “What is a higher-order modality?”, you might be wondering. Well, if a first-order modality is a way that some entity could have been—whether it is a mereological atom, or a mereological complex, or the universe as a whole—a higher-order modality is a way that a first-order modality could have been. First-order modality is modeled in (...) terms of a space of possible worlds—a set of worlds structured by an accessibility relation, i.e., a relation of relative possibility—each world representing a way that the entire universe could have been. A second-order modality would be modeled in terms of a space of spaces of (first-order) possible worlds, each space representing a way that (first-order) possible worlds could have been. And just as there is a unique actual world which represents the way that things actually are, there is a unique actual space which represents the way that first-order modality actually is. -/- One might wonder what the accessibility relation itself is like. Presumably, if it is logical or metaphysical modality that is being dealt with, it is reflexive; but is it also symmetric, or transitive? Especially in the case of metaphysical modality, the answer is not clear. And whichever of these properties it may or may not have, could that itself have been different? Could at least some rival modal logics represent different ways that first-order modality could have been? -/- To be clear, the idea behind my proposal is not just that some things which are possible or necessary might not have been so at the first order, as determined by the actual accessibility relation, but also that the actual accessibility relation, and hence the nature or structure of actual modality, could have been different at some higher order of modality. Even if the accessibility relation is actually both symmetric and transitive, perhaps it could (second-order) have been otherwise: There is a (second-order) possible space of worlds in which it is different, where it fails to be symmetric, or transitive. We must, therefore, introduce the notion of a higher-order accessibility relation, one that in this case relates spaces of first-order worlds. The question then arises as to whether that relation is symmetric, or transitive. We can then consider third-order modalities, spaces of spaces of spaces of possible worlds, where the second-order accessibility relation differs from how it actually is. I can see no reason why there should be a limit to this hierarchy of higher-order modalities, any more than I can see a reason why there should be a limit to the hierarchy of higher-order properties. There will thus be an infinity of orders, one for each positive integer, and each order will have an accessibility relation of its own. To keep things as clear as possible, a space of first-order points (i.e., of possible worlds) shall be called a galaxy, a space of second-order points, a universe, and a space of any higher order, a cosmos. However, to keep things as simple as possible, in what follows I will deal with but a single cosmos, and hence will not deal with modalities higher than the third order. -/- The accessibility relation is not the only thing that might be thought to vary between spaces of worlds: Perhaps the contents of the spaces can vary as well. While I presume that the contents of the worlds themselves remain constant—it makes doubtful sense to suppose that in one space some entity e exists in a world w and in another space e doesn’t exist in that same world w—we may suppose that different spaces differ as to which worlds they contain, just as different worlds may differ as to which objects they contain. Thus we might have a higher-order analogue of a variable-domain modal logic. There seem, then, to be three ways in which spaces can differ: First, as to the properties of the accessibility relation; second, as to which worlds the relation relates; and third, as to which worlds or spaces are parts of their domains. -/- The paper will be structured as follows. In Section 2 I provide some reasons why one might want to pursue this kind of project in the first place. In Section 3 I outline the syntax and semantics of my proposed logic. Section 4 covers semantic tableaux for this system; and after giving the rules for their construction, I construct a few of them myself to establish some logical consequences of the system and give the reader a feel for how it works. In Sections 5, 6 and 7 I explore some of its potential philosophical implications for areas besides logic, namely the philosophy of language; metaphysics, including the metaphysics of modality and the philosophy of time, and finally the philosophy of religion, before concluding the paper in Section 8. (shrink)

In their recent paper Bi-facial truth: a case for generalized truth values Zaitsev and Shramko [7] distinguish between an ontological and an epistemic interpretation of classical truth values. By taking the Cartesian product of the two disjoint sets of values thus obtained, they arrive at four generalized truth values and consider two “semi-classical negations” on them. The resulting semantics is used to define three novel logics which are closely related to Belnap’s well-known four valued logic. A syntactic characterization of these (...) logics is left for further work. In this paper, based on our previous work on a functionally complete extension of Belnap’s logic, we present a sound and complete tableau calculus for these logics. It crucially exploits the Cartesian nature of the four values, which is reflected in the fact that each proof consists of two tableaux. The bi-facial notion of truth of Z&S is thus augmented with a bi-facial notion of proof. We also provide translations between the logics for semi-classical negation and classical logic and show that an argument is valid in a logic for semi-classical negation just in case its translation is valid in classical logic. (shrink)

FDE, LP and K3 are closely related to each other and admit of an intuitive informational interpretation. However, all these logics are co-NP complete, and so idealized models of how an agent can think. We address this issue by shifting to signed formulae, where the signs express imprecise values associated with two bipartitions of the corresponding set of standard values. We present proof systems whose operational rules are all linear and have only two structural branching rules that express a generalized (...) Principle of Bivalence. Each of these systems leads to defining an infinite hierarchy of tractable approximations to the respective logic, in terms of the maximum number of allowed nested applications of the two branching rules. Further, each resulting hierarchy admits of an intuitive 5-valued non-deterministic semantics. (shrink)

Could there be a single logical system that would allow us to work simultaneously with classical, paraconsistent, and paracomplete negations? These three negations were separately studied in logics whose negations bear their names. Initially we will restrict our analysis to propositional logics by analyzing classical negation, ¬c, as treated by Classical Propositional Logic (LPC); the paraconsistent negation, ¬p, as treated through the hierarchy of Paraconsistent Propositional Calculi Cn (0 ≤ n ≤ ω); and the paracomplete negation, ¬q, as treated by (...) the hierarchy of Paracomplete Propositional Calculi Pn (0 ≤ n ≤ ω). In “Logics that are both paraconsistent and paracomplete” (1989), Newton da Costa proposed a system with approximate characteristics to what we are looking for. In the hierarchy of Non-Alethical Propositional Calculi Nn (0 ≤ n ≤ ω), only one negation is introduced (as primitive), called a “non-alethic” (¬n), whose operation preserves the properties of classical, or paraconsistent or paracomplete negation -- depending on the well or ill behavior of the formula connected to it. However, as we shall see, in the hierarchy Nn we can not reiterate negations with different behaviors in a same formula (e.g., ¬p¬cα or ¬q¬c¬p α), or even analyze a formula like ¬cα → ¬pα. In view of these problems, can we really say that the hierarchy Nn allows us to understand the relationships and interactions of the three types of negations? In order to deal with this, given the initial problem, we will present four axiomatic systems (KG) in which, unlike Nn, the three negations are directly introduced -- offering a semantics and a method of proofs by analytic tableaux. Through the KG Systems we will show how the negations interact, obtaining non-demonstrable theorems in LPC, Cn, Pn, and Nn (0 ≤ n ≤ ω). Finally, we will also offer a first-order extension for the KG Systems. (shrink)

A textbook for modal and other intensional logics based on the Open Logic Project. It covers normal modal logics, relational semantics, axiomatic and tableaux proof systems, intuitionistic logic, and counterfactual conditionals.

Motivated by H. Curry’s well-known objection and by a proposal of L. Henkin, this article introduces the positive tableaux, a form of tableau calculus without refutation based upon the idea of implicational triviality. The completeness of the method is proven, which establishes a new decision procedure for the (classical) positive propositional logic. We also introduce the concept of paratriviality in order to contribute to the question of paradoxes and limitations imposed by the behavior of classical implication.

Temporal epistemic logics are known, from results of Halpern and Vardi, to have a wide range of complexities of the satisfiability problem: from PSPACE, through non-elementary, to highly undecidable. These complexities depend on the choice of some key parameters specifying, inter alia, possible interactions between time and knowledge, such as synchrony and agents' abilities for learning and recall. In this work we develop practically implementable tableau-based decision procedures for deciding satisfiability in single-agent synchronous temporal-epistemic logics with interactions between time and (...) knowledge. We discuss some complications that occur, even in the single-agent case, when interactions between time and knowledge are assumed and show how the method of incremental tableaux can be adapted to work in EXPSPACE, respectively 2EXPTIME, for these logics, thereby also matching the upper bounds obtained for them by Halpern and Vardi. (shrink)

In this paper we give an analytic tableau calculus P L 1 6 for a functionally complete extension of Shramko and Wansing’s logic. The calculus is based on signed formulas and a single set of tableau rules is involved in axiomatising each of the four entailment relations ⊧ t, ⊧ f, ⊧ i, and ⊧ under consideration—the differences only residing in initial assignments of signs to formulas. Proving that two sets of formulas are in one of the first three entailment (...) relations will in general require developing four tableaux, while proving that they are in the ⊧ relation may require six. (shrink)

Priest has provided a simple tableau calculus for Chellas's conditional logic Ck. We provide rules which, when added to Priest's system, result in tableau calculi for Chellas's CK and Lewis's VC. Completeness of these tableaux, however, relies on the cut rule.

Philosophers have spilled a lot of ink over the past few years exploring the nature and significance of grounding. Kit Fine has made several seminal contributions to this discussion, including an exact treatment of the formal features of grounding [Fine, 2012a]. He has specified a language in which grounding claims may be expressed, proposed a system of axioms which capture the relevant formal features, and offered a semantics which interprets the language. Unfortunately, the semantics Fine offers faces a number of (...) problems. In this paper, I review the problems and offer an alternative that avoids them. I offer a semantics for the pure logic of ground that is motivated by ideas already present in the grounding literature, and for which a natural axiomatization capturing central formal features of grounding is sound and complete. I also show how the semantics I offer avoids the problems faced by Fine’s semantics. (shrink)

I develop and defend a truthmaker semantics for the relevant logic R. The approach begins with a simple philosophical idea and develops it in various directions, so as to build a technically adequate relevant semantics. The central philosophical idea is that truths are true in virtue of specific states. Developing the idea formally results in a semantics on which truthmakers are relevant to what they make true. A very natural notion of conditionality is added, giving us relevant implication. I then (...) investigate ways to add conjunction, disjunction, and negation; and I discuss how to justify contraposition and excluded middle within a truthmaker semantics. (shrink)

There is something peculiar about aesthetic testimony. It seems more difficult to gain knowledge of aesthetic properties based solely upon testimony than it is in the case of other types of property. In this paper, I argue that we can provide an adequate explanation at the level of the semantics of aesthetic language, without defending any substantive thesis in epistemology or about aesthetic value/judgement. If aesthetic predicates are given a non-invariantist semantics, we can explain the supposed peculiar difficulty with aesthetic (...) testimony. (shrink)

I argue that semantics is the study of the proprietary database of a centrally inaccessible and informationally encapsulated input–output system. This system’s role is to encode and decode partial and defeasible evidence of what speakers are saying. Since information about nonlinguistic context is therefore outside the purview of semantic processing, a sentence’s semantic value is not its content but a partial and defeasible constraint on what it can be used to say. I show how to translate this thesis (...) into a detailed compositional-semantic theory based on the influential framework of Heim and Kratzer. This approach situates semantics within an independently motivated account of human cognitive architecture and reveals the semantics–pragmatics interface to be grounded in the underlying interface between modular and central systems. (shrink)

The article investigates the significance of the so-called phenomenon of apparent faultless disagreement for debates about the semantics of taste discourse. Two kinds of description of the phenomenon are proposed. The first ensures that faultless disagreement raises a distinctive philosophical challenge; yet, it is argued that Contextualist, Realist and Relativist semantic theories do not account for this description. The second, by contrast, makes the phenomenon irrelevant for the problem of what the right semantics of taste discourse should be. Lastly, (...) the following dilemma is assessed: either faultless disagreement provides strong evidence against semantic theories; or its significance should be considerably downplayed. (shrink)

In The Philosophy of Information, Luciano Floridi presents a theory of “strongly semantic information”, based on the idea that “information encapsulates truth” (the so-called “veridicality thesis”). Starting with Popper, philosophers of science have developed different explications of the notion of verisimilitude or truthlikeness, construed as a combination of truth and information. Thus, the theory of strongly semantic information and the theory of verisimilitude are intimately tied. Yet, with few exceptions, this link has virtually pass unnoticed. In this paper, (...) we briefly survey both theories and offer a critical comparison of strongly semantic information and related notions, like truth, verisimilitude, and partial truth. (shrink)

Miriam Schoenfield argues that moral realism and moral vagueness imply ontic vagueness. In particular, she argues that neither shifty nor rigid semantic accounts of vagueness can provide a satisfactory explanation of moral vagueness for moral realists. This paper constitutes a response. I argue that Schoenfield's argument against the shifty semantic account presupposes that moral indeterminacies can, in fact, be resolved determinately by crunching through linguistic data. I provide different reasons for rejecting this assumption. Furthermore, I argue that Schoenfield's (...) rejection of the rigid semantic account is based on a presupposition that ultimately implies the very same claim that is under dispute: the vagueness of moral predicates in imperfect languages persists in the perfect language, as well. (shrink)

Our aim in this paper is to extend the semantics for the kind of logic of ground developed in (deRosset and Fine, 2023). In that paper, we very briefly suggested a way of treating universal and existential quantification over a fixed domain of objects. Here we explore some options for extending the treatment to allow for a variable domain of objects.

The paper discusses Saul Kripke's Normativity Argument against semantic dispositionalism: it criticizes the orthodox interpretation of the argument, defends an alternative reading and argues that, contrary to what Kripke himself seems to have been thinking, the real point of the Normativity Argument is not that meaning is normative. According to the orthodox interpretation, the argument can be summarized as follows: (1) it is constitutive of the concept of meaning that its instances imply an ought, but (2) it is not (...) constitutive of the concept of a disposition that dispositions imply an ought, hence (3) no dispositional analysis of meaning can work. According to my alternative reading, the point of the argument is another one, namely that while (1) dispositionalism is committed to the thesis that speakers have non-inferential knowledge of their unmanifested linguistic dispositions, (2) speakers, as a matter of fact, do not have such a knowledge. A point that is in principle independent from the issue of the normativity of meaning. (shrink)

Relationship between default semantics and modularity of mind (in particular mind reading through the principle of Relevance).

In this paper, I address the idea that certain sentences suffer from what is generally called semantic unspecificity: their meaning is determinate, but their truth conditions are not. While there tends to be agreement on the idea that semantic unspecificity differs from phenomena such as ambiguity and vagueness, some theorists have defended an account which traces it to indexicality, broadly construed. Some authors have tried to vindicate the distinction between unspecificity and indexicality and, in this paper, I pursue (...) the same cause, but with a critical stance towards previously employed strategies. I urge that the central argument employed by Sainsbury to trace this difference fails suitably to set unspecificity apart from indexicality and I propose a new argument, which helps to trace this distinction more perspicuously. The argument is based on embeddings of indexical and unspecific expressions within modal operators and on the ways in which the truth conditions of utterances of the resulting, complex expressions are thereby affected. (shrink)

It is common belief that semantic properties supervene on non-semantic properties: no two possible worlds can be non-semantic duplicates and fail to be semantic duplicates. The view enjoys somewhat of an orthodoxy status in contemporary philosophy of language and metaphysics, and is often assumed without argument. Yet, work by Stephen Kearns and Ofra Magidor has claimed that it is vulnerable to a variant of the classical arguments against the supervenience of the phenomenal on the physical. This (...) paper does three things: it clarifies what semantic supervenience is about, it responds to the objections that have been leveled against it, and provides a new battery of arguments in its favor. I argue that the thesis of semantic supervenience is safe from classical anti-supervenience arguments, and show that its rejection generates unwelcome consequences. I conclude that there are substantial reasons to embrace the received wisdom: semantic properties supervene. (shrink)

This article begins by distinguishing force and mood. Then it lays out desiderata on a successful account. It sketches as background the program of truth-theoretic semantics. Next, it surveys assimilation approaches and argues that they are inadequate. Then it shows how the fulfillment-conditional approach can be applied to imperatives, interrogatives, molecular sentences containing them, and quantification into mood markers. Next, it considers briefly the recent set of propositions approach to the semantics of interrogatives and exclamatives. Finally, it shows how to (...) integrate exclamatives and optatives into a framework similar to the fulfillment approach. (shrink)

This paper argues for contrastivism about the deontic modals, 'ought', 'must', and 'may'. A simple contrastivist semantics that predicts the desired entailment relations among these modals is offered.

In this paper, we present a new semantic framework designed to capture a distinctly cognitive or epistemic notion of meaning akin to Fregean senses. Traditional Carnapian intensions are too coarse-grained for this purpose: they fail to draw semantic distinctions between sentences that, from a Fregean perspective, differ in meaning. This has led some philosophers to introduce more fine-grained hyperintensions that allow us to draw semantic distinctions among co-intensional sentences. But the hyperintensional strategy has a flip-side: it risks (...) drawing semantic distinctions between sentences that, from a Fregean perspective, do not differ in meaning. This is what we call the ‘new problem’ of hyperintensionality to distinguish it from the ‘old problem’ that faced the intensional theory. We show that our semantic framework offers a joint solution to both these problems by virtue of satisfying a version of Frege’s so-called ‘equipollence principle’ for sense individuation. Frege’s principle, we argue, not only captures the semantic intuitions that give rise to the old and the new problem of hyperintensionality, but also points the way to an independently motivated solution to both problems. (shrink)

It is argued that none of the speaker's referential intentions accompanying his utterance of a demonstrative are semantically significant but rather the associated demonstration (or some other source of salience). It is constitutive of the speaker's having the specifically referential intention - held by Kent Bach to be semantically significant - that the speaker is taking, and relying upon, his accompanying gesture (or some other source of salience) as semantically significant, making it the case that this intention is not even (...) partly semantically significant. The same is then shown to hold for the speaker's remaining referential intentions: his intention aimed at a perceived object, believed by David Kaplan to be semantically significant, as well as the intention to refer to the object that he has in mind. (shrink)

This paper considers a now familiar argument that the ubiquity of context -dependence threatens the project of natural language semantics, at least as that project has usually been conceived: as concerning itself with `what is said' by an utterance of a given sentence. I argue in response that the `anti-semantic' argument equivocates at a crucial point and, therefore, that we need not choose between semantic minimalism, truth-conditional pragmatism, and the like. Rather, we must abandon the idea, familiar from (...) Kaplan and others, that utterances express propositions `relative to contexts' and replace it with the Strawonian idea that speakers express propositions by making utterances in contexts. The argument for this claim consists in a detailed investigation of the particular case of demonstratives, which I argue demand such a Strawsonian treatment. I then respond to several objections, the most important of which allege that the Strawsonian account somehow undermines the project of natural language semantics, or threatens the semantics -pragmatics distinction. Please note that the paper posted here is an extended version of what was published. (shrink)

This paper establishes a sound and complete semantics for the impure logic of ground. Fine (Review of Symbolic Logic, 5(1), 1–25, 2012a) sets out a system for the pure logic of ground, one in which the formulas between which ground-theoretic claims hold have no internal logical complexity; and it provides a sound and complete semantics for the system. Fine (2012b) [§§6-8] sets out a system for an impure logic of ground, one that extends the rules of the original pure system (...) with rules for the truth-functional connectives, the first-order quantifiers, and λ-abstraction. However, no semantics has yet been provided for this system. The present paper partly fills this lacuna by providing a sound and complete semantics for a system GG containing the truth-functional operators that is closely related to the truth-functional part of the system of Fine (2012b). (shrink)

Virtual environments engage millions of people and billions of dollars each year. What is the ontological status of the virtual objects that populate those environments? An adequate answer to that question requires a developed semantics for virtual environments. The truth-conditions must be identified for “tree”-sentences when uttered by speakers immersed in a virtual environment (VE). It will be argued that statements about virtual objects have truth-conditions roughly comparable to the verificationist conditions popular amongst some contemporary antirealists. This does not mean (...) that the virtual objects lack ontological standing. There is an important sense in which virtual objects are no less real for being mind-dependent. (shrink)

I use the principle of truth-maker maximalism to provide a new solution to the semantic paradoxes. According to the solution, AUS, its undecidable whether paradoxical sentences are grounded or ungrounded. From this it follows that their alethic status is undecidable. We cannot assert, in principle, whether paradoxical sentences are true, false, either true or false, neither true nor false, both true and false, and so on. AUS involves no ad hoc modification of logic, denial of the T-schema's validity, or (...) obvious revenge. (shrink)

The literature on indicative conditionals contains two appealing views. The first is the selectional view: on this view, conditionals operate by selecting a single possibility, which is used to evaluate the consequent. The second is the informational view: on this view, conditionals don’t express propositions, but rather impose constraints on information states of speakers. Both views are supported by strong arguments, but they are incompatible on their standard formulations. Hence it appears that we have to choose between mutually exclusive options. (...) But the options are not exclusive. This paper develops a theory of the semantics and assertability of conditionals that is both selectional and informational. The theory vindicates the signature inferences of both selectional and informational theories, including so-called Conditionals Excluded Middle and principles about the interplay between conditionals and ‘might’. It also predicts some interesting and puzzling facts about the assertion of conditionals. (shrink)

This paper presents a uniform semantic treatment of nonmonotonic inference operations that allow for inferences from infinite sets of premises. The semantics is formulated in terms of selection functions and is a generalization of the preferential semantics of Shoham (1987), (1988), Kraus, Lehman, and Magidor (1990) and Makinson (1989), (1993). A selection function picks out from a given set of possible states (worlds, situations, models) a subset consisting of those states that are, in some sense, the most preferred ones. (...) A proposition α is a nonmonotonic consequence of a set of propositions Γ iff α holds in all the most preferred Γ-states. In the literature on revealed preference theory, there are a number of well-known theorems concerning the representability of selection functions, satisfying certain properties, in terms of underlying preference relations. Such theorems are utilized here to give corresponding representation theorems for nonmonotonic inference operations. At the end of the paper, the connection between nonmonotonic inference and belief revision, in the sense of Alchourrón, Gärdenfors, and Makinson, is explored. In this connection, infinitary belief revision operations that allow for the revision of a theory with a possibly infinite set of propositions are introduced and characterized axiomatically. (shrink)

nated discussion of the semantics of such verbs. I will call this view.

My paper examines the popular idea, defended by Kripke, that meaning is an essentially normative notion. I consider four common versions of this idea and suggest that none of them can be supported, either because the alleged normativity has nothing to do with normativity or because it cannot plausibly be said that meaning is normative in the sense suggested. I argue that contrary to received opinion, we don’t need normativity to secure the possibility of meaning. I conclude by considering the (...) repercussions of rejecting semantic normativity on three central issues: justification, communication, and naturalism. (shrink)

Expressivists about epistemic modals deny that ‘Jane might be late’ canonically serves to express the speaker’s acceptance of a certain propositional content. Instead, they hold that it expresses a lack of acceptance. Prominent expressivists embrace pragmatic expressivism: the doxastic property expressed by a declarative is not helpfully identified with that sentence’s compositional semantic value. Against this, we defend semantic expressivism about epistemic modals: the semantic value of a declarative from this domain is the property of doxastic attitudes (...) it canonically serves to express. In support, we synthesize data from the critical literature on expressivism—largely reflecting interactions between modals and disjunctions—and present a semantic expressivism that readily predicts the data. This contrasts with salient competitors, including: pragmatic expressivism based on domain semantics or dynamic semantics; semantic expressivism à la Moss [2015]; and the bounded relational semantics of Mandelkern [2019]. (shrink)

Intellectual humility is an interesting but underexplored disposition. The claim “I am (intellectually) humble” seems paradoxical in that someone who has the disposition in question would not typically volunteer it. There is an explanatory gap between the meaning of the sentence and the meaning the speaker expresses by uttering it. We therefore suggest analyzing intellectual humility semantically, using a psycholexical approach that focuses on both synonyms and antonyms of ‘intellectual humility’. We present a thesaurus-based method to map the semantic (...) space of intellectual humility as a heuristic to support philosophical and psychological analysis of this disposition. We find three semantic clusters that compose intellectual humility: the sensible self, the discreet self, and the inquisitive self; likewise, we find three clusters that compose its contraries: the overrated self, the underrated other, and the underrated self. (shrink)

A novel semantic naturalization program is proposed. Its three main differences from informational semantics approaches are as follows. First, it makes use of a perceptually based, four-factor interactive causal relation in place of a simple nomic covariance relation. Second, it does not attempt to globally naturalize all semantic concepts, but instead it appeals to a broadly realist interpretation of natural science, in which the concept of propositional truth is off-limits to naturalization attempts. And third, it treats all (...) class='Hi'>semantic concepts as being purely abstract, so that concrete cognitive states are only indexed by them rather than instantiating them. (shrink)

The aim of this paper is to reinterpret success semantics, a theory of mental content, according to which the content of a belief is fixed by the success conditions of some actions based on this belief. After arguing that in its present form, success semantics is vulnerable to decisive objections, I examine the possibilities of salvaging the core of this proposal. More specifically, I propose that the content of some very simple, but very important, mental states, the immediate mental antecedents (...) of action, can be explained in this manner. (shrink)

In the chapter “Information and Content” of their Impossible Worlds, Berto and Jago provide us with a semantic account of information in deductive reasoning such that we have an explanation for why some, but not all, logical deductions are informative. The framework Berto and Jago choose to make sense of the above-mentioned idea is a semantic interpretation of Sequent Calculus rules of inference for classical logic. I shall argue that although Berto and Jago’s idea and framework are hopeful, (...) their definitions do not capture what is intended. This is so because the definitions are solely based on the logical complexity of an argument and they fail to capture the richness of the non- logical content of that argument. Then I will suggest some amendments to address this problem. Finally, I will extend the application of the definitions to first-order logic. It shall be observed that in some classical deductions, applying contraction may lead to hiding some epistemic impossibilities. This happens when formulae which contribute different propositions to the proof get contracted at the quantified level. (shrink)

According to the singular conception of reality, there are objects and there are singular properties, i.e. properties that are instantiated by objects separately. It has been argued that semantic considerations about plurals give us reasons to embrace a plural conception of reality. This is the view that, in addition to singular properties, there are plural properties, i.e. properties that are instantiated jointly by many objects. In this article, I propose and defend a novel semantic account of plurals which (...) dispenses with plural properties and thus undermines the semantic argument in favor of the plural conception of reality. (shrink)

Success semantics holds, roughly, that what it is for a state of an agent to be a belief that P is for it to be disposed to combine with her desires to cause behaviour that would fulfill those desires if P. J. T. Whyte supplements this with an account of the contents of an agent's “basic desires” to provide an attractive naturalistic theory of mental content. We argue that Whyte's strategy can avoid the objections raised against it by restricting “basic (...) desires” to sensory inclinations that cause us to do things independently of our beliefs about their contents. -/- La sémantique du succès soutient, en gros, que ce qu'il faut pour qu'un état d'un agent soit une croyance en P, c'est que cet état soit disposé à se combiner avec ses désirs pour provoquer un comportement qui répondrait à ces désirs si P. J. T. Whyte complète cela par un compte-rendu du contenu des « désirs de base » d'un agent pour fournir une théorie naturaliste attrayante du contenu mental. Nous soutenons que la stratégie de Whyte peut éviter les objections qui lui sont faites en restreignant les « désirs de base » aux inclinations sensorielles qui nous font agir indépendamment de nos croyances sur leur contenu. (shrink)

In the pair of articles of which this is the second, I present a set of problems and philosophical proposals that have in recent years been associated with the term “relativism”. These problems are related to the question of how we should represent thought and speech about certain topics. The main issue is whether we should model such mental states or linguistic acts as involving representational contents that are absolutely correct or incorrect, or whether, alternatively, their correctness should be thought (...) of as varying with some (more or less surprising) factor. In the first article, “Relativism 1: Representational Content”, I discussed the general issue of relativism about representational content. I argued for the conciliatory view that both relativist and absoutist conceptions of representational content can be legitimate. In the present continuation, I look in more detail at a special case of the general issue, namely the question of whether semantic contents, i.e. the contents assigned to linguistic utterances in the semantics of natural language, should be construed in an absolutist or in a relativist way. (shrink)

The use of highly abstract mathematical frameworks is essential for building the sort of theoretical foundation for semantic integration needed to bring it to the level of a genuine engineering discipline. At the same time, much of the work that has been done by means of these frameworks assumes a certain amount of background knowledge in mathematics that a lot of people working in ontology, even at a fairly high theoretical level, lack. The major purpose of this short paper (...) is provide a (comparatively) simple model of semantic integration that remains within the friendlier confines of first-order languages and their usual classical semantics and logic. (shrink)

Over the last fifteen years, linguists and philosophers of language have reexamined the canonical, Kratzerian semantics for modal expressions, with special attention paid to their epistemic and deontic uses. This article is an overview of the literature on deontic modal expressions. Section 1 provides an overview of the canonical semantics, noting some of its main advantages. Section 2 introduces a set of desiderata that have achieved the status of fixed points in the debates about whether the canonical semantics is correct. (...) These include the observations that deontic modal sentences have both deliberative and evaluative readings and both information-sensitive and -insensitive readings. Adequate resolutions of certain puzzles in deontic logic and resolving the Frege-Geach problem for Expressivism have also achieved this status. The third section provides an opinionated overview of some of the main extant rivals to the canonical semantics, including Cariani, Kaufmann, and Kaufmann’s (2013) complex contextualism , Yalcin’s (2012) Expressivism, Willer’s (2014) dynamic semantics, and Starr’s (2016) dynamic Expressivism. Section 4 provides an assessment of each of the views discussed in terms of the desiderata introduced in section 2. Section 5 is an overview of remaining issues that require more attention in the literature. (shrink)