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)

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)

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)

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.

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.

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)

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)

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)

This chapter develops a semantic theory for maps and situates it within the broader geography of meaning and semiotic significance. The discussion focuses on three central aspects of map semantics: the use of space, line marking, and linguistic tags. It is argued that the treatment of space in maps must be based on geometrical projection from a viewpoint rather than the traditional analysis in terms of spatial isomorphism. The chapter then shows how to integrate the projection-based semantics of maps (...) and the symbolic semantics of markers and tags, within the framework of possible-world semantics. The resulting account addresses issues of accuracy, viewpoint, orientation, and exhaustivity. (shrink)

Truthmaker semantics is a recent development in formal and philosophical semantics, with similar motivation and scope to possible worlds semantics. The technical background is rather different, however, and results in a more fine-grained hyperintensional notion of content, allowing us to distinguish between classically equivalent propositions. After briefly introducing the main ideas, this entry will describe the technical apparatus of state spaces and the central notions of content and partial content. It will then outline applications of truthmaker semantics in language, logic, (...) and other areas of philosophy. (shrink)

In this paper, I dwell on a particular distinction introduced by Ilhan Inan—the distinction between ostensible and inostensible use of our language. The distinction applies to singular terms, such as proper names and definite descriptions, or to general terms like concepts and to the ways in which we refer to objects in the world by using such terms. Inan introduces the distinction primarily as an epistemic one but in his earlier writings (1997: 49) he leaves some room for it to (...) have some semantic significance i.e., the view that in certain intensional de re contexts whether a term occurring in a sentence is ostensible or inostensible may have a bearing on the semantic content of the sentence. However, in his later writings e.g., The Philosophy of Curiosity, he appears to abandon his earlier thoughts regarding the semantic significance of his distinction. He says: “the ostensible/inostensible distinction is basically an epistemic one.... It is an epistemic distinction that has no semantic significance” (2012: 65). I argue that there are indeed such intensional contexts in which the distinction has some semantic significance, i.e., whether a term is ostensible or inostensible has in fact a bearing on what proposition is expressed by the sentence in which the term occurs. (shrink)

The word semantics, in robotics and AI, has no canonical definition. It usually serves to denote additional data provided to autonomous agents to aid HRI. Most researchers seem, implicitly, to understand that such data cannot simply be extracted from environmental data. I try to make explicit why this is so and argue that so-called semantics are best understood as data comprised of conventions of human behaviour. This includes labels, most obviously, but also places, ontologies, and affordances. Object affordances are especially (...) problematic because they require not only semantics that are not in the environmental data (conventions of object use) but also an understanding of physics and object combinations that would, if achieved, constitute artificial superintelligence. (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)

Abstract I argue that good and right are gradable adjectives as that is understood in the current linguistic theory of gradable adjectives. According that theory, gradable adjectives do not denote properties but contribute meaning in a different yet cognitive way; and if that applies to good and right, then those words contribute meaning and provide evaluativity and normativity by means other than denoting properties. If that is true, significant consequences follow for metaethics, both because of the lack of properties good (...) and right, and because of specific features of the gradable adjective semantics. I outline the theory of good and right as gradable adjectives and explore some of those consequences, attempting to give a sense of what changes we may expect in metaethics. (shrink)

Two semantic paradoxes, the Liar and Curry’s paradox, are analysed using a newly developed conception of procedural semantics (semantics according to which the truth of propositions is determined algorithmically), whose main characteristic is its departure from methodological realism. Rather than determining pre-existing facts, procedures are constitutive of them. Of this semantics, two versions are considered: closed (where the halting of procedures is presumed) and open (without this presumption). To this end, a procedural approach to deductive reasoning is developed, based (...) on the idea of simulation. As is shown, closed semantics supports classical logic, but cannot in any straightforward way accommodate the concept of truth. In open semantics, where paradoxical propositions naturally ‘belong’, they cease to be paradoxical; yet, it is concluded that the natural choice—for logicians and common people alike—is to stick to closed semantics, pragmatically circumventing problematic utterances. (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)

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

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.

Boethius identifies God both with esse ipsum and esse suum. This paper explains Boethius's general semantic use of "esse" and the application of this use to God. It questions the helpfulness of attributing to Boethius "existence" words and argues for a more robust role in Boethius’s thought for Hilary of Poitiers’s and Augustine’s exegeses of Exodus 3:14-15 than has been acknowledged in recent scholarship.

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)

This paper attempts to answer whether the property of “efficacy” can be attributed to constitutive rules. In particular, according to Di Lucia, I will point out some problems that the “semantic conception of efficacy” has concerning constitutive and regulative rules. Then, the main goal of the paper will be to reflect on the possibility of the efficacy of constitutive rules by means of a complex case that the semantic conception seems to disregard: The case of the cheater. Does (...) the action of the cheater show the inefficacy of constitutive rules? Does she play the game while breaking the rule? Can the semantic conception of efficacy explain this situation, or do we need a more flexible concept of efficacy that takes nomotropism into account? These are some of the questions I will try to answer. (shrink)

Externalism is widely endorsed within contemporary philosophy of mind and language. Despite this, it is far from clear how the externalist thesis should be construed and, indeed, why we should accept it. In this entry I distinguish and examine three central types of externalism: what I call foundational externalism, externalist semantics, and psychological externalism. I suggest that the most plausible version of externalism is not in fact a very radical thesis and does not have any terribly interesting implications for philosophy (...) of mind, whereas the more radical and interesting versions of externalism are quite difficult to support. (shrink)

This paper challenges the negative attitudes towards labelled proof systems, usually referred to as semantic pollution, by arguing that such critiques overlook the full potential of labelled calculi. The overarching objective is to develop a practice-based philosophical analysis of labelled calculi to provide insightful considerations regarding their proof-theoretic and philosophical value. To achieve this, successful applications of labelled calculi and related results will be showcased, and comparisons with other relevant works will be discussed. The paper ends by advocating for (...) a more practice-based approach towards the philosophical understanding of proof systems and their role in structural proof theory. (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)

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)

There is a wealth of resources— ideas, insights, discoveries, inventions, traditions, cultures, languages, arts, religions, sciences, narratives, stories, poems, customs and norms, music and songs, games and personal experiences, and advertisements—that we produce, curate, consume, transmit, and inherit as humans. This wealth, which I define as semantic capital, gives meaning to, and makes sense of, our own existence and the world surrounding us. It defines who we are and enables humans to develop an individual and social life. This paper (...) discusses the shift from analog to digital semantic capital, and the extent to which this might affect the semanticisation of our identities, our lives and our realities. -/- . (shrink)

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)

Research has indicated that microRNAs (miRNAs), a special class of non-coding RNAs (ncRNAs), can perform important roles in different biological and pathological processes. miRNAs’ functions are realized by regulating their respective target genes (targets). It is thus critical to identify and analyze miRNA-target interactions for a better understanding and delineation of miRNAs’ functions. However, conventional knowledge discovery and acquisition methods have many limitations. Fortunately, semantic technologies that are based on domain ontologies can render great assistance in this regard. In (...) our previous investigations, we developed a miRNA domain-specific application ontology, Ontology for MIcroRNA Target (OMIT), to provide the community with common data elements and data exchange standards in the miRNA research. This paper describes (1) our continuing efforts in the OMIT ontology development and (2) the application of the OMIT to enable a semantic approach for knowledge capture of miRNA-target interactions. (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)

In virtue of what does a sign have meaning? This is the question raised by Wittgenstein's rule-following considerations. Semantic dispositionalism is a (type of) theory that purports to answer this question. The present paper argues that semantic dispositionalism faces a heretofore unnoticed problem, one that ultimately comes down to its reliance on unanalyzed notions of repeated types of signs. In the context of responding to the rule-following paradox—and offering a putative solution to it—this amounts to simply assuming a (...) solution to the problem in one domain and using it to solve the same problem in another. Given, moreover, the level at which the rule-following paradox undercuts dispositionalism—the level of the notion of a sign's repetition—the objections made to the view also rule out causal/informational theories of meaning as well as communitarian/assertion-theoretic ones as potential solutions to the rule-following paradox. (shrink)

In this paper we present a characterization of hyper-connexivity by means of a relating semantics for Boolean connexive logics. We also show that the minimal Boolean connexive logic is Abelardian, strongly consistent, Kapsner strong and antiparadox. We give an example showing that the minimal Boolean connexive logic is not simplificative. This shows that the minimal Boolean connexive logic is not totally connexive.

This paper provides a semantics for propositional attitude ascriptions. (In this respect, the title of the paper is quite well chosen.).

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)

Our manuscript addresses the foundational question of cognitive science: how do we know? Specifically, examination of the mathematics of acquiring mathematical knowledge revealed that knowing-within-mathematics is reflective of knowing-in-general. Based on the correspondence between ordinary cognition (involving physical stimuli, neural sensations, mental concepts, and conscious percepts) and mathematical knowing (involving objective particulars, measured properties, abstract theories, and concrete models), we put forward the functorial semantics of mathematical knowing as a formalization of cognition. Our investigation of the similarity between mathematics and (...) cognition led us to argue against the compartmentalization of scientific knowledge and ordinary cognition, and make a case for the understanding of the basic science of knowing in terms of functorial semantics. Recognizing functorial semantics as an elementary form of cognition can help advance cognitive science the way calculus helped in the advancement of physics. (shrink)

Estimating word complexity is a well-established task in computer-assisted language learning. So far, however, complexity estimation has been largely limited to comprehension. This neglects words that are easy to comprehend, but hard to produce. We introduce semantic error prediction (SEP) as a novel task that assesses the production complexity of content words. Given the corrected version of a learner-produced text, a system has to predict which content words replace tokens from the original text. We present and analyse one example (...) of such a semantic error prediction dataset, which we generate from an error correction dataset. As neural baselines, we use BERT, RoBERTa, and LLAMA2 embeddings for SEP. We show that our models can already improve downstream applications, such as predicting essay vocabulary scores. (shrink)

A semantics of pictorial representation should provide an account of how pictorial signs are associated with the contents they express. Unlike the familiar semantics of spoken languages, this problem has a distinctively spatial cast for depiction. Pictures themselves are two-dimensional artifacts, and their contents take the form of pictorial spaces, perspectival arrangements of objects and properties in three dimensions. A basic challenge is to explain how pictures are associated with the particular pictorial spaces they express. Inspiration here comes from recent (...) proposals that analyze depiction in terms of geometrical projection. In this essay, I will argue that, for a central class of pictures, the projection-based theory of depiction provides the best explanation for how pictures express pictorial spaces, while rival perceptual and resemblance theories fall short. Since the composition of pictorial space is itself the basis for all other aspects of pictorial content, the proposal provides a natural foundation for further pictorial semantics. (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)

This paper gives an outline of truthmaker semantics for natural language against the background of standard possible-worlds semantics. It develops a truthmaker semantics for attitude reports and deontic modals based on an ontology of attitudinal and modal objects and on a semantic function of clauses as predicates of such objects. It also présents new motivations for 'object-based truthmaker semantics' from intensional transitive verbs such as ‘need’, ‘look for’, ‘own’, and ‘buy’ and gives an outline of their semantics. This paper (...) is a commissioned 'target' article, with commentaries by W. Davis, B. Arsenijevic, K. Moulton, K. Liefke, M. Kaufmann, R. Matthews, P. Portner and A. Rubinstein, P. Elliott, G. Ramchand and my reply. (shrink)

At the heart of semantics in the 20th century is Frege’s distinction between sense and force. This is the idea that the content of a self-standing utterance of a sentence S can be divided into two components. One part, the sense, is the proposition that S’s linguistic meaning and context associates with it as its semantic interpretation. The second component is S’s illocutionary force. Illocutionary forces correspond to the three basic kinds of sentential speech acts: assertions, orders, and questions. (...) Forces are then kinds of acts in which propositions are deployed with certain purposes. I sketch a speech-act theoretic semantics in which that distinction does not hold. Instead of propositions and forces, the theory proposes proto-illocutionary acts and illocutionary acts. The orthodox notion of a proposition plays no role in the framework, which is a good thing, since that notion is deeply problematic. The framework also shows how expressionists, who embrace a sophisticated speech-act framework, face no Frege-Geach embedding problem, since the latter assumes the Sense/Force distinction. (shrink)

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)

This article focuses on foundational issues in dynamic and static semantics, specifically on what is conceptually at stake between the dynamic framework and the truth-conditional framework, and consequently what kinds of evidence support each framework. The article examines two questions. First, it explores the consequences of taking the proposition as central semantic notion as characteristic of static semantics, and argues that this is not as limiting in accounting for discourse dynamics as many think. Specifically, it explores what it means (...) for a static semantics to incorporate the notion of context change potential in a dynamic pragmatics and denies that this conception of static semantics requires that all updates to the context be eliminative and distributive. Second, it argues that the central difference between the two frameworks is whether semantics or pragmatics accounts for dynamics, and explores what this means for the oft-heard claim that dynamic semantics blurs the semantics/pragmatics distinction. (shrink)