Among Dunn’s many important contributions to relevance logic was his work on the system RM (R-mingle). Although RM is an interesting system in its own right, it is widely considered to be too strong. In this chapter, I revisit a closely related system, RM0 (sometimes known as ‘constructive mingle’), which includes the mingle axiom while not degenerating in the way that RM itself does. My main interest will be in examining this logic from two related semantical perspectives. First, I give (...) a purely operational bisemilattice semantics for it by adapting previous work of Humberstone. Second, I examine a more conventional algebraic semantics for it and discuss how this relates to the operational semantics. A novel operational semantics for J (intuitionistic logic) as well as its conventional Heyting algebraic semantics emerge as special cases of the corresponding semantics for RM0. The results of this chapter suggest that RM0 is a more interesting logic than has been appreciated and that Humberstone’s operational semantic framework similarly deserves more attention than it has received. (shrink)

The Operator Argument against eternalism holds that having non-vacuous tense operators in the language is incompatible with the claim that every proposition has its truth-value eternally. Assuming that (1) there are non-vacuous tense operators, (2) tense operators operate on propositions and (3) tense operators which operate on eternal entities are vacuous, it may be argued that eternalism is false. In this paper, I examine the Operator Argument. The goal is threefold. First, I want to present some aspects of the debate (...) in a more elaborate way, especially those concerning formal matters. Secondly, I will argue that eternalism can escape the Operator Argument. There are two main strategies for handling the Operator Argument. The first one is based on replacing temporal operators with object-language quantifiers. The second rejects the identification of compositional semantic value with assertoric content. My third goal is to show that none of them is as good as the strategy that adopts Timestamp Semantics (Fritz in Philosl Stud 176:2933–2959, 2019). I am going to argue that the quantificational treatment of tenses is compatible with temporalism and that the arguments for rejecting the identification of compositional semantic value with assertoric content provide, in fact, a motivation for the temporalist position. At the end, I will develop Timestamp Semantics by providing a novel formalization of it, and defend it against three potential counter-arguments. (shrink)

Disaster response is a highly collaborative and critical process that requires the involvement of multiple emergency responders (ERs), ideally working together under a unified command, to enable a rapid and effective operational response. Following the 9/11 and 11/13 terrorist attacks and the devastation of hurricanes Katrina and Rita, it is apparent that inadequate communication and a lack of interoperability among the ERs engaged on-site can adversely affect disaster response efforts. Within this context, we present a scenario-based terrorism case study (...) to highlight the challenges of operational disaster command and response. In this article, which is based on the French emergency response doctrine, we outline a semantics-based common operational command system that is designed to guarantee an efficient information flow among ERs. Our focus is on offering to all ERs, a real-time operational picture of the situation in order to enable multilevel coordination among firefighters, police, healthcare units, public authorities, and other stakeholders. Our approach consolidates information to promote timely sharing of data among ERs. The proposed system is based on an ontology that has been developed to represent the different types of knowledge on the part of ERs, providing a shared vocabulary that covers a variety of interoperability concerns. (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)

-/- A variable binding term operator (vbto) is a non-logical constant, say v, which combines with a variable y and a formula F containing y free to form a term (vy:F) whose free variables are exact ly those of F, excluding y. -/- Kalish-Montague proposed using vbtos to formalize definite descriptions, set abstracts {x: F}, minimalization in recursive function theory, etc. However, they gave no sematics for vbtos. Hatcher gave a semantics but one that has flaws. We give a (...) correct semantic analysis of vbtos. We also give axioms for using them in deductions. And we conjecture strong completeness for the deductions with respect to the semantics. The conjecture was later proved independently by the authors and by Newton da Costa. -/- The expression (vy:F) is called a variable bound term (vbt). In case F has only y free, (vy:F) has the syntactic propreties of an individual constant; and under a suitable interpretation of the language vy:F) denotes an individual. By a semantic analysis of vbtos we mean a proposal for amending the standard notions of (1) "an interpretation o f a first -order language" and (2) " the denotation of a term under an interpretation and an assignment", such that (1') an interpretation o f a first -order language associates a set-theoretic structure with each vbto and (2') under any interpretation and assignment each vb t denotes an individual. (shrink)

The operational semantics of Urquhart is a deep and important part of the development of relevant logics. In this paper, I present an overview of work on Urquhart’s operational semantics. I then present the basics of collection frames. Finally, I show how one kind of collection frame, namely, functional set frames, is equivalent to Urquhart’s semilattice semantics.

We explore some possibilities for developing epistemic logic using truthmaker semantics. We identify three possible targets of analysis for the epistemic logician. We then list some candidate epistemic principles and review the arguments that render some controversial. We then present the classic Hintikkan approach to epistemic logic and note—as per the ‘problem of logical omniscience’—that it validates all of the aforementioned principles, controversial or otherwise. We then lay out a truthmaker framework in the style of Kit Fine and present (...) six different ways of extending this semantics with a conditional knowledge operator, drawing on notions of implication and content that are prominent in Fine’s work. We demonstrate that different logics are thereby generated, bearing on the aforementioned epistemic principles. Finally, we offer preliminary observations about the prospects for each logic. (shrink)

There are two foundational, but not fully developed, ideas in paraconsistency, namely, the duality between paraconsistent and intuitionistic paradigms, and the introduction of logical operators that express meta-logical notions in the object language. The aim of this paper is to show how these two ideas can be adequately accomplished by the Logics of Formal Inconsistency (LFIs) and by the Logics of Formal Undeterminedness (LFUs). LFIs recover the validity of the principle of explosion in a paraconsistent scenario, while LFUs recover the (...) validity of the principle of excluded middle in a paracomplete scenario. We introduce definitions of duality between inference rules and connectives that allow comparing rules and connectives that belong to different logics. Two formal systems are studied, the logics mbC and mbD, that display the duality between paraconsistency and paracompleteness as a duality between inference rules added to a common core– in the case studied here, this common core is classical positive propositional logic (CPL + ). The logics mbC and mbD are equipped with recovery operators that restore classical logic for, respectively, consistent and determined propositions. These two logics are then combined obtaining a pair of logics of formal inconsistency and undeterminedness (LFIUs), namely, mbCD and mbCDE. The logic mbCDE exhibits some nice duality properties. Besides, it is simultaneously paraconsistent and paracomplete, and able to recover the principles of excluded middle and explosion at once. The last sections offer an algebraic account for such logics by adapting the swap-structures semantics framework of the LFIs the LFUs. This semantics highlights some subtle aspects of these logics, and allows us to prove decidability by means of finite non-deterministic matrices. (shrink)

Certain passages in Kaplan’s ‘Demonstratives’ are often taken to show that non-vacuous sentential operators associated with a certain parameter of sentential truth require a corresponding relativism concerning assertoric contents: namely, their truth values also must vary with that parameter. Thus, for example, the non-vacuity of a temporal sentential operator ‘always’ would require some of its operands to have contents that have different truth values at different times. While making no claims about Kaplan’s intentions, we provide several reconstructions of how such (...) an argument might go, focusing on the case of time and temporal operators as an illustration. What we regard as the most plausible reconstruction of the argument establishes a conclusion similar enough to that attributed to Kaplan. However, the argument overgenerates, leading to absurd consequences. We conclude that we must distinguish assertoric contents from compositional semantic values, and argue that once they are distinguished, the argument fails to establish any substantial conclusions. We also briefly discuss a related argument commonly attributed to Lewis, and a recent variant due to Weber. (shrink)

In proof-theoretic semantics, meaning is based on inference. It may be seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional logic have been explored by several authors. In this paper, we develop base-extension semantics for the classical propositional modal (...) systems K, KT , K4, and S4, with □ as the primary modal operator. We establish appropriate soundness and completeness theorems and establish the duality between □ and a natural presentation of ♢. We also show that our semantics is in its current form not complete with respect to euclidean modal logics. Our formulation makes essential use of relational structures on bases. (shrink)

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)

The epistemic modal auxiliaries must and might are vehicles for expressing the force with which a proposition follows from some body of evidence or information. Standard approaches model these operators using quantificational modal logic, but probabilistic approaches are becoming increasingly influential. According to a traditional view, must is a maximally strong epistemic operator and might is a bare possibility one. A competing account—popular amongst proponents of a probabilisitic turn—says that, given a body of evidence, must \ entails that \\) is (...) high but non-maximal and might \ that \\) is significantly greater than 0. Drawing on several observations concerning the behavior of must, might and similar epistemic operators in evidential contexts, deductive inferences, downplaying and retractions scenarios, and expressions of epistemic tension, I argue that those two influential accounts have systematic descriptive shortcomings. To better make sense of their complex behavior, I propose instead a broadly Kratzerian account according to which must \ entails that \ = 1\) and might \ that \ > 0\), given a body of evidence and a set of normality assumptions about the world. From this perspective, must and might are vehicles for expressing a common mode of reasoning whereby we draw inferences from specific bits of evidence against a rich set of background assumptions—some of which we represent as defeasible—which capture our general expectations about the world. I will show that the predictions of this Kratzerian account can be substantially refined once it is combined with a specific yet independently motivated ‘grammatical’ approach to the computation of scalar implicatures. Finally, I discuss some implications of these results for more general discussions concerning the empirical and theoretical motivation to adopt a probabilisitic semantic framework. (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 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)

This thesis argues for two main points concerning the philosophy of natural language semantics. Firstly, that the objects of assertion are distinct from the entities appealed to in the compositional rules of natural language semantics. Secondly, natural languages contain context-shifting operators known as "monsters". In fact, it will be shown that these theses are simply two sides of the same coin.

Chapin reviewed this 1972 ZEITSCHRIFT paper that proves the completeness theorem for the logic of variable-binding-term operators created by Corcoran and his student John Herring in the 1971 LOGIQUE ET ANALYSE paper in which the theorem was conjectured. This leveraging proof extends completeness of ordinary first-order logic to the extension with vbtos. Newton da Costa independently proved the same theorem about the same time using a Henkin-type proof. This 1972 paper builds on the 1971 “Notes on a Semantic Analysis of (...) Variable Binding Term Operators” (Co-author John Herring), Logique et Analyse 55, 646–57. MR0307874 (46 #6989). A variable binding term operator (vbto) is a non-logical constant, say v, which combines with a variable y and a formula F containing y free to form a term (vy:F) whose free variables are exact ly those of F, excluding y. Kalish-Montague 1964 proposed using vbtos to formalize definite descriptions “the x: x+x=2”, set abstracts {x: F}, minimization in recursive function theory “the least x: x+x>2”, etc. However, they gave no semantics for vbtos. Hatcher 1968 gave a semantics but one that has flaws described in the 1971 paper and admitted by Hatcher. In 1971 we give a correct semantic analysis of vbtos. We also give axioms for using them in deductions. And we conjecture strong completeness for the deductions with respect to the semantics. The conjecture, proved in this paper with Hatcher’s help, was proved independently about the same time by Newton da Costa. (shrink)

A series of representations must be semantics-driven if the members of that series are to combine into a single thought: where semantics is not operative, there is at most a series of disjoint representations that add up to nothing true or false, and therefore do not constitute a thought at all. A consequence is that there is necessarily a gulf between simulating thought, on the one hand, and actually thinking, on the other. A related point is that a (...) popular doctrine - the so-called 'computational theory of mind' (CTM) - is based on a confusion. CTM is the view that thought-processes consist in 'computations', where a computation is defined as a 'form-driven' operation on symbols. The expression 'form-driven operation' is ambiguous, as it may refer either to syntax-driven operations or to morphology-driven operations. Syntax-driven operations presuppose the existence of operations that are driven by semantic and extra-semantic knowledge. So CTM is false if the terms 'computation' and 'form-driven operation' are taken to refer to syntax-driven operations. Thus, if CTM is to work, those expressions must be taken to refer to morphology-driven operations. CTM therefore fails, given that an operation must be semantics-driven if it is to qualify as a thought. CTM therefore fails on each possible disambiguation of the expressions 'formal operation' and 'computation,' and it is therefore false. (shrink)

This paper discusses a dualization of Fitting's notion of a "cut-down" operation on a bilattice, rendering a "track-down" operation, later used to represent the idea that a consistent opinion cannot arise from a set including an inconsistent opinion. The logic of track-down operations on bilattices is proved equivalent to the logic d_Sfde, dual to Deutsch's system S_fde. Furthermore, track-down operations are employed to provide an epistemic interpretation for paraconsistent weak Kleene logic. Finally, two logics of sequential combinations of cut-and track-down (...) operations allow settling positively the question of whether bilattice-based semantics are available for subsystems of S_fde. (shrink)

Coreferentialism refers to the common assumption in the literature that slurs and descriptors are coreferential expressions with precisely the same extension. For instance, Vallee recently writes that “If S is an ethnic slur in language L, then there is a non-derogatory expression G in L such that G and S have the same extension”. The non-derogatory expression G is commonly considered the nonpejorative correlate of the slur expression S and it is widely thought that every S has a coreferring G (...) that possesses precisely the same extension. Yet here I argue against this widespread assumption by first briefly introducing what slurs are and then considering four sources of supporting evidence showing that slurs and descriptors are in fact not coreferential expressions with precisely the same extension. I argue that since slurs and descriptors differ in their extension they thereby differ in their meaning or content also. This article additionally introduces the notion of a conceptual anchor in order to adequately account for the relationship between slurs and descriptors actually evidenced in the empirical data, and further considers the inadequacy of common dictionary definitions of slurs. This article therefore contributes to the literature on slurs by demonstrating that previous accounts operating on the assumption that slurs and descriptors are coreferential expressions with the same extension, and that they thereby have the same meaning or content, are inconsistent with empirical data and that an alternative account in accord with Croom better fits the facts concerning their actual meaning and use. (shrink)

n the philosophy of language, there are many ongoing controversies that stem from relying too heavily on an utterance-based framework. The traditional approach of rigidly partitioning the utterance’s meaning into what is grammatically determined from what is not may not fully capture the complexity of human language in real-world communicative contexts. To address this issue, we suggest shifting focus toward a broader analysis level encompassing conversations and discourses. From this broader perspective, it is possible to obtain a more integrated view (...) of how linguistic and extra-linguistic aspects dynamically interact and thus reconsider semantics/pragmatics dichotomy as complementary dimensions. Meaning is not confined to linguistic structures alone but emerges from the dynamic interplay of words, sociocultural knowledge, discursive situations, and psychological dispositions of speakers. Substantiating this perspective calls for embracing an interdisciplinary approach that synthesizes research from various domains, including linguistics, cognitive psychology, and philosophy of language. This paper focuses on a particularly compelling case study: aphasia. Speeches produced by individuals with aphasia represent complex scenarios where the balance between linguistic and extra-linguistic aspects is notably compromised, often to the former’s detriment. Aphasics’ productions represent a vivid example of how the interpretation of speeches can be far from involving fixed and static operations. Instead, it entails continuously reallocating cognitive resources toward the most readily available and accessible sources for the speakers. This case study ultimately demonstrates that the influence of semantic and pragmatic processes in shaping and conveying meanings displays remarkable adaptability, continuously adjusting to the ever changing demands placed upon speakers. -/- . (shrink)

In this paper I adopt Kaplan’s framework for distinguishing between descriptive and expressive content. Racial slurs are an especially difficult challenge for truth-conditional semantics because of their projection behaviors. That is to say, the offensive content of slurs “scopes out” of logical operators. I argue that racial slurs express contempt and lack descriptive content, so that many sentences containing slurs are not truth apt. My theory accounts for the intuition of the ordinary speaker who refuses to assent to the (...) truth of a sentence containing a slur, but accepts the same statement made using a neutral counterpart of that slur. Weaknesses of rival theories are briefly discussed. (shrink)

It is a widely held view in philosophy that propositions perform a plethora of different theoretical roles. Amongst other things, they are believed to be the semantic values of sentences in contexts, the objects of attitudes, the contents of illocutionary acts, and the referents of that-clauses. This assumption is often combined with the claim that propositions have their truth-values eternally. In this paper I aim to show that these two assumptions are incompatible: propositions cannot both fulfill the mentioned roles and (...) be eternally true or false. Following Kaplan and Lewis’s Operator Argument, I argue that compositional semantic values of sentences in contexts do not correspond to eternal propositions. Thus, either we regard the non-eternal entities that in fact realize the semantic role of propositions as also fulfilling the remaining propositional roles, or we abandon the assumption that there is a unique realizer of all the roles. The Operator Argument has recently come under attack, mainly for its tense-logical assumptions. However, rejecting these assumptions is not a sufficient defense of the compatibility of the two claims, since the extensional alternative to the tense-logical framework does not allow us to universally retain eternal propositions as compositional semantic values of sentences either. (shrink)

In some recent articles, Cobreros, Egré, Ripley, & van Rooij have defended the idea that abandoning transitivity may lead to a solution to the trouble caused by semantic paradoxes. For that purpose, they develop the Strict-Tolerant approach, which leads them to entertain a nontransitive theory of truth, where the structural rule of Cut is not generally valid. However, that Cut fails in general in the target theory of truth does not mean that there are not certain safe instances of Cut (...) involving semantic notions. In this article we intend to meet the challenge of answering how to regain all the safe instances of Cut, in the language of the theory, making essential use of a unary recovery operator. To fulfill this goal, we will work within the so-called Goodship Project, which suggests that in order to have nontrivial naïve theories it is sufficient to formulate the corresponding self-referential sentences with suitable biconditionals. Nevertheless, a secondary aim of this article is to propose a novel way to carry this project out, showing that the biconditionals in question can be totally classical. In the context of this article, these biconditionals will be essentially used in expressing the self-referential sentences and, thus, as a collateral result of our work we will prove that none of the recoveries expected of the target theory can be nontrivially achieved if self-reference is expressed through identities. (shrink)

Jeffrey King has recently argued: (i) that the semantic value of a sentence at a context is (or determines) a function from possible worlds to truth values, and (ii) that this undermines Jason Stanley's argument against the rigidity thesis, the claim that no rigid term has the same content as a non-rigid term. I show that King's main argument for (i) fails, and that Stanley's argument is consistent with the claim that the semantic value of a sentence at a context (...) is (or determines) a function from worlds to truth values. (shrink)

This paper highlights a small selection of cases where crosslinguistic insights have been important to big questions in the theory of semantics and the syntax/semantics interface. The selection includes (i) the role and representation of Speaker and Addressee in the grammar; (ii) mismatches between form and interpretation motivating high-placed silent operators for functional elements; and (iii) the explanation of semantic universals, including universals pertaining to inventories, in terms of learnability and the trade-off between informativeness and simplicity.

This paper discusses proof-theoretic semantics, the project of specifying the meanings of the logical constants in terms of rules of inference governing them. I concentrate on Michael Dummett’s and Dag Prawitz’ philosophical motivations and give precise characterisations of the crucial notions of harmony and stability, placed in the context of proving normalisation results in systems of natural deduction. I point out a problem for defining the meaning of negation in this framework and prospects for an account of the meanings (...) of modal operators in terms of rules of inference. (shrink)

It has recently been proposed that the framework of semantic relativism be put to use to describe mental content, as deployed in some of the fundamental operations of the mind. This programme has inspired in particular a novel strategy of accounting for the essential egocentricity of first-personal or de se thoughts in relativist terms, with the advantage of dispensing with a notion of self-representation. This paper is a critical discussion of this strategy. While it is based on a plausible appeal (...) to cognitive economy, the relativist theory does not fully account for the epistemic profile that distinguishes de se thinking, as some of its proponents hope to do. A deeper worry concerns the reliance of the theory on a primitive notion of “centre” that hasn’t yet received enough critical attention, and is ambiguous between a thin and a rich reading. I argue that while the rich reading is required if the relativist analysis of the de se is to achieve its most ambitious aims, it also deprives the theory of much of its explanatory power. (shrink)

Advances in emotion and affective science have yet to translate routinely into psychiatric research and practice. This is unfortunate since emotion and affect are fundamental components of many psychiatric conditions. Rectifying this lack of interdisciplinary integration could thus be a potential avenue for improving psychiatric diagnosis and treatment. In this contribution, we propose and discuss an ontological framework for explicitly capturing the complex interrelations between affective entities and psychiatric disorders, in order to facilitate mapping and integration between affective science and (...) psychiatric diagnostics. We build on and enhance the categorisation of emotion, affect and mood within the previously developed Emotion Ontology, and that of psychiatric disorders in the Mental Disease Ontology. This effort further draws on developments in formal ontology regarding the distinction between normal and abnormal in order to formalize the interconnections. This operational semantic framework is relevant for applications including clarifying psychiatric diagnostic categories, clinical information systems, and the integration and translation of research results across disciplines. (shrink)

We discuss a well-known puzzle about the lexicalization of logical operators in natural language, in particular connectives and quantifiers. Of the many logically possible operators, only few appear in the lexicon of natural languages: the connectives in English, for example, are conjunction _and_, disjunction _or_, and negated disjunction _nor_; the lexical quantifiers are _all, some_ and _no_. The logically possible nand (negated conjunction) and Nall (negated universal) are not expressed by lexical entries in English, nor in any natural language. Moreover, (...) the lexicalized operators are all upward or downward monotone, an observation known as the Monotonicity Universal. We propose a logical explanation of lexical gaps and of the Monotonicity Universal, based on the dynamic behaviour of connectives and quantifiers. We define update potentials for logical operators as procedures to modify the context, under the assumption that an update by \( \phi \) depends on the logical form of \( \phi \) and on the speech act performed: assertion or rejection. We conjecture that the adequacy of update potentials determines the limits of lexicalizability for logical operators in natural language. Finally, we show that on this framework the Monotonicity Universal follows from the logical properties of the updates that correspond to each operator. (shrink)

An important part of the Unified Medical Language System (UMLS) is its Semantic Network, consisting of 134 Semantic Types connected to each other by edges formed by one or more of 54 distinct Relation Types. This Network is however for many purposes overcomplex, and various groups have thus made attempts at simplification. Here we take this work further by simplifying the relations which involve the three Semantic Types – Diagnostic Procedure, Laboratory Procedure and Therapeutic or Preventive Procedure. We define operators (...) which can be used to generate terms instantiating types from this selected set when applied to terms designating certain other Semantic Types, including almost all the terms specifying clinical tasks. Usage of such operators thus provides a useful and economical way of specifying clinical tasks. The operators allow us to define a mapping between those types within the UMLS which do not represent clinical tasks and those which do. This mapping then provides a basis for an ontology of clinical tasks that can be used in the formulation of computer-interpretable clinical guideline models. (shrink)

The addition of "actually" operators to modal languages allows us to capture important inferential behaviours which cannot be adequately captured in logics formulated in simpler languages. Previous work on modal logics containing "actually" operators has concentrated entirely upon extensions of KT5 and has employed a particular modeltheoretic treatment of them. This paper proves completeness and decidability results for a range of normal and nonnormal but quasi-normal propositional modal logics containing "actually" operators, the weakest of which are conservative extensions of K, (...) using a novel generalisation of the standard semantics. (shrink)

This paper puts forward an argument for a systematic, technical approach to formulation in verbal interaction. I see this as a kind of expansion of Sacks’ membership categorization analysis, and as something that is not offered (at least not in a fully developed form) by sequential analysis, the currently dominant form of conversation analysis. In particular, I suggest a technique for the study of “occasioned semantics,” that is, the study of structures of meaningful expressions in actual occasions of conversation. (...) I propose that meaning and rhetoric be approached through consideration of various dimensions or operations or properties, including, but not limited to, contrast and co-categorization, generalization and specification, scaling, and marking. As illustration, I consider a variety of cases, focused on generalization and specification. The paper can be seen as a return to some classical concerns with meaning, as illuminated by more recent insights into indexicality, social action, and interaction in recorded talk. (shrink)

Epistemic two-dimensional semantics is a theory in the philosophy of language that provides an account of meaning which is sensitive to the distinction between necessity and apriority. While this theory is usually presented in an informal manner, I take some steps in formalizing it in this paper. To do so, I define a semantics for a propositional modal logic with operators for the modalities of necessity, actuality, and apriority that captures the relevant ideas of epistemic two-dimensional semantics. (...) I also describe some properties of the logic that are interesting from a philosophical perspective, and apply it to the so-called nesting problem. (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)

This paper argues that the types of intention can be modeled both as modal operators and via a multi-hyperintensional semantics. I delineate the semantic profiles of the types of intention, and provide a precise account of how the types of intention are unified in virtue of both their operations in a single, encompassing, epistemic space, and their role in practical reasoning. I endeavor to provide reasons adducing against the proposal that the types of intention are reducible to the mental (...) states of belief and desire, where the former state is codified by subjective probability measures and the latter is codified by a utility function. I argue, instead, that each of the types of intention -- i.e., intention-in-action, intention-as-explanation, and intention-for-the-future -- has as its aim the value of an outcome of the agent's action, as derived by her partial beliefs and assignments of utility, and as codified by the value of expected utility in evidential decision theory. (shrink)

Possibility semantics offers an elegant framework for a semantic analysis of modal logic that does not recruit fully determinate entities such as possible worlds. The present papers considers the application of possibility semantics to the modeling of the indeterminacy of the future. Interesting theoretical problems arise in connection to the addition of object-language determinacy operator. We argue that adding a two-dimensional layer to possibility semantics can help solve these problems. The resulting system assigns to the two-dimensional determinacy (...) operator a well-known logic (coinciding with the logic of universal modalities under global consequence). The paper concludes with some preliminary inroads into the question of how to distinguish two-dimensional possibility semantics from the more established branching framework. (shrink)

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.

We present SASC, Self-Adaptive Semantic Crossover, a new class of crossover operators for genetic programming. SASC operators are designed to induce the emergence and then preserve good building-blocks, using metacontrol techniques based on semantic compatibility measures. SASC performance is tested in a case study concerning the replication of investment funds.

Natural language contains simple lexical items for some but not all Boolean operators. English, for example, contains conjunction and, disjunction or, negated disjunction nor, but no word to express negated conjunction *nand nor any other Boolean connective. Natural language grammar can be described by a logic that expresses what the lexicon can express by its primitives, and the rest compositionally. Such logic for propositional connectives is described here as a bilateral extension of update semantics. The basic intuition is that (...) a context can be updated by assertion or by rejection, and by one or multiple propositions at once. These distinctions suffice to characterize the logic of the lexicon. (shrink)

I start out by reviewing the semantics of ‘seem’. As ‘seem’ is a subject-raising verb, ‘it seems’ can be treated as a sentential operator. I look at the semantic and logical properties of ‘it seems’. I argue that ‘it seems’ is a hyperintensional and contextually flexible operator. The operator distributes over conjunction but not over disjunction, conditionals or semantic entailments. I further argue that ‘it seems’ does not commute with negation and does not agglomerate with conjunction. I then show (...) that the mental states expressed by perceptual uses of ‘seem’ have non-conceptual, yet perspectival contents. In the final part of the paper I argue that while the content of the mental states expressed by perceptual uses of ‘seem’ are non-conceptual, having a mental state of this type requires possessing conceptual abilities corresponding to what the mental state represents. (shrink)

A general framework for translating various logical systems is presented, including a set of partial unary operators of affirmation and negation. Despite its usual reading, affirmation is not redundant in any domain of values and whenever it does not behave like a full mapping. After depicting the process of partial functions, a number of logics are translated through a variety of affirmations and a unique pair of negations. This relies upon two preconditions: a deconstruction of truth-values as ordered and structured (...) objects, unlike its mainstream presentation as a simple object; a redefinition of the Principle of Bivalence as a set of four independent properties, such that its definition does not equate with normality. (shrink)

In the TACITUS project for using commonsense knowledge in the understanding of texts about mechanical devices and their failures, we have been developing various commonsense theories that are needed to mediate between the way we talk about the behavior of such devices and causal models of their operation. Of central importance in this effort is the axiomatization of what might be called commonsense metaphysics. This includes a number of areas that figure in virtually every domain of discourse, such as granularity, (...) scales, time, space, material, physical objects, shape, causality, functionality, and force. Our effort has been to construct core theories of each of these areas, and then to define, or at least characterize, a large number of lexical items in terms provided by the core theories. In this paper we discuss our methodological principles and describe the key ideas in the various domains we are investigating. (shrink)

Truth is undefined for imperative statements. However, if imperatives implicitly reference a fact, they can be rephrased as truth­-valuable declaratives explicitly referencing that fact. But are there such facts? Kenny held that any imperative references a set of wishes held by its imperator. I extend his thesis by proposing that imperator wishes are facts implicitly referenced by imperatives and explicitly referencing them yields semantically isomorphic declaratives. I implement this thesis with modal operators for wants and cause with which declarative schemata (...) are formed to automate translation of imperatives into semantically isomorphic declaratives called proxy-­imperatives. The proxy-­imperatives match imperative behavior and provide semantic validation of imperative arguments thereby integrating imperative reasoning into classic truth­-valuable logic. (shrink)

Possible worlds are commonly seen as an interpretation of modal operators such as "possible" and "necessary". Here, we develop possible world semantics (PWS) which can be expressed in basic set theory and first-order logic, thus offering a reductionist account of modality. Specifically, worlds are understood as complete sets of statements and possible worlds are sets whose statements are consistent with a set of conceptual laws. We introduce the construction calculus (CC), a set of axioms and rules for truth, possibility, (...) worldness and consistency. We show that CC allows to prove fundamental theorems about necessity, possibility, impossibility and contigency, thus demonstrating prima-facie plausibility of PWS. Finally, we discuss the explanatory power of our approach and draw connections between our account and established philosophical conceptions of possible worlds. (shrink)

We present a sound and complete Fitch-style natural deduction system for an S5 modal logic containing an actuality operator, a diagonal necessity operator, and a diagonal possibility operator. The logic is two-dimensional, where we evaluate sentences with respect to both an actual world (first dimension) and a world of evaluation (second dimension). The diagonal necessity operator behaves as a quantifier over every point on the diagonal between actual worlds and worlds of evaluation, while the diagonal possibility quantifies over some point (...) on the diagonal. Thus, they are just like the epistemic operators for apriority and its dual. We take this extension of Fitch’s familiar derivation system to be a very natural one, since the new rules and labeled lines hereby introduced preserve the structure of Fitch’s own rules for the modal case. (shrink)

This paper considers proof-theoretic semantics for necessity within Dummett's and Prawitz's framework. Inspired by a system of Pfenning's and Davies's, the language of intuitionist logic is extended by a higher order operator which captures a notion of validity. A notion of relative necessary is defined in terms of it, which expresses a necessary connection between the assumptions and the conclusion of a deduction.

Episodic memory often is conceptualized as a uniquely human system of long-term memory that makes available knowledge accompanied by the temporal and spatial context in which that knowledge was acquired. Retrieval from episodic memory entails a form of first–person subjectivity called autonoetic consciousness that provides a sense that a recollection was something that took place in the experiencer’s personal past. In this paper I expand on this definition of episodic memory. Specifically, I suggest that (a) the core features assumed unique (...) to episodic memory are shared by semantic memory, (b) episodic memory cannot be fully understood unless one appreciates that episodic recollection requires the coordinated function of a number of distinct, yet interacting, “enabling” systems. Although these systems – ownership, self, subjective temporality, and agency – are not traditionally viewed as memorial in nature, each is necessary for episodic recollection and jointly they may be sufficient, and (c) the type of subjective awareness provided by episodic recollection (autonoetic) is relational rather than intrinsic – i.e., it can be lost in certain patient populations, thus rendering episodic memory content indistinguishable from the content of semantic long-term memory. (shrink)

Modifying the descriptive and theoretical generalizations of Relativized Minimality, we argue that a significant subset of weak island violations arise when an extracted phrase should scope over some intervener but is unable to. Harmless interveners seem harmless because they can support an alternative reading. This paper focuses on why certain wh-phrases are poor wide scope takers, and offers an algebraic perspective on scope interaction. Each scopal element SE is associated with certain operations (e.g., not with complements). When a wh-phrase scopes (...) over some SE, the operations associated with that SE are performed in its denotation domain. The requisite operations may or may not be available in a domain, however. We present an empirical analysis of a variety of wh-phrases. It is argued that the wh-phrases that escape all weak islands (i.e., can scope over any intervener) are those that range over individuals, the reason being that all Boolean operations are defined for their domain. Collectives, manners, amounts, numbers, etc. all denote in domains with fewer operations and are thus selectively sensitive to scopal interveners—a “semantic relativized minimality effect”. (shrink)

The first aim of this paper is to prove a topological completeness theorem for a weak version of Stalnaker’s logic KB of knowledge and belief. The weak version of KB is characterized by the assumption that the axioms and rules of KB have to be satisfied with the exception of the axiom (NI) of negative introspection. The proof of a topological completeness theorem for weak KB is based on the fact that nuclei (as defined in the framework of point-free topology) (...) give rise to a profusion of topological belief operators that are compatible with the familiar topological knowledge operator. Thereby a canonical topological model for weak KB can be constructed. For this canonical model a truth lemma for the K and B holds such that a completeness theorem for KB can be proved in the familiar way. The second aim of this paper is to show that the topological interpretation of knowledge K comes along with a complete Heyting algebra of belief operators B that all fit the knowledge operator K in the sense that the pairs (K, B) satisfy all axioms of weak KB. This amounts to a pluralistic relation between knowledge and belief: Knowledge does not fully determine belief, rather it designs a conceptual space for belief operators where different (competing) belief operators coexist. (shrink)

The meaning that expressions take on particular occasions often depends on the context in ways which seem to transcend its direct effect on context-sensitive parameters. ‘Truth-conditional pragmatics’ is the project of trying to model such semantic flexibility within a compositional truth-conditional framework. Most proposals proceed by radically ‘freeing up’ the compositional operations of language. I argue, however, that the resulting theories are too unconstrained, and predict flexibility in cases where it is not observed. These accounts fall into this position because (...) they rarely, if ever, take advantage of the rich information made available by lexical items. I hold, instead, that lexical items encode both extension and non-extension determining information. Under certain conditions, the non-extension determining information of an expression e can enter into the compositional processes that determine the meaning of more complex expressions which contain e. This paper presents and motivates a set of type-driven compositional operations that can access non-extension determining information and introduce bits of it into the meaning of complex expressions. The resulting multidimensional semantics has the tools to deal with key cases of semantic flexibility in appropriately constrained ways, making it a promising framework to pursue the project of truth-conditional pragmatics. (shrink)