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)

There are some who defend a view of vagueness according to which there are intrinsically vague objects or attributes in reality. Here, in contrast, we defend a view of vagueness as a semantic property of names and predicates. All entities are crisp, on this view, but there are, for each vague name, multiple portions of reality that are equally good candidates for being its referent, and, for each vague predicate, multiple classes of objects that are equally good candidates for being (...) its extension. We provide a new formulation of these ideas in terms of a theory of granular partitions. We show that this theory provides a general framework within which we can understand the relation between vague terms and concepts on the one hand and correlated portions of reality on the other. We also sketch how it might be possible to formulate within this framework a theory of vagueness which dispenses with the notion of truth-value gaps and other artifacts of more familiar approaches. (shrink)

An important problem with machine learning is that when label number n>2, it is very difficult to construct and optimize a group of learning functions, and we wish that optimized learning functions are still useful when prior distribution P(x) (where x is an instance) is changed. To resolve this problem, the semantic information G theory, Logical Bayesian Inference (LBI), and a group of Channel Matching (CM) algorithms together form a systematic solution. MultilabelMultilabel A semantic channel in the G theory consists (...) of a group of truth functions or membership functions. In comparison with likelihood functions, Bayesian posteriors, and Logistic functions used by popular methods, membership functions can be more conveniently used as learning functions without the above problem. In Logical Bayesian Inference (LBI), every label’s learning is independent. For Multilabel learning, we can directly obtain a group of optimized membership functions from a big enough sample with labels, without preparing different samples for different labels. A group of Channel Matching (CM) algorithms are developed for machine learning. For the Maximum Mutual Information (MMI) classification of three classes with Gaussian distributions on a two-dimensional feature space, 2-3 iterations can make mutual information between three classes and three labels surpass 99% of the MMI for most initial partitions. For mixture models, the Expectation-Maxmization (EM) algorithm is improved and becomes the CM-EM algorithm, which can outperform the EM algorithm when mixture ratios are imbalanced, or local convergence exists. The CM iteration algorithm needs to combine neural networks for MMI classifications on high-dimensional feature spaces. LBI needs further studies for the unification of statistics and logic. (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)

A computer can come to understand natural language the same way Helen Keller did: by using “syntactic semantics”—a theory of how syntax can suffice for semantics, i.e., how semantics for natural language can be provided by means of computational symbol manipulation. This essay considers real-life approximations of Chinese Rooms, focusing on Helen Keller’s experiences growing up deaf and blind, locked in a sort of Chinese Room yet learning how to communicate with the outside world. Using the SNePS (...) computational knowledge-representation system, the essay analyzes Keller’s belief that learning that “everything has a name” was the key to her success, enabling her to “partition” her mental concepts into mental representations of: words, objects, and the naming relations between them. It next looks at Herbert Terrace’s theory of naming, which is akin to Keller’s, and which only humans are supposed to be capable of. The essay suggests that computers at least, and perhaps non-human primates, are also capable of this kind of naming. (shrink)

A new trend in deep learning, represented by Mutual Information Neural Estimation (MINE) and Information Noise Contrast Estimation (InfoNCE), is emerging. In this trend, similarity functions and Estimated Mutual Information (EMI) are used as learning and objective functions. Coincidentally, EMI is essentially the same as Semantic Mutual Information (SeMI) proposed by the author 30 years ago. This paper first reviews the evolutionary histories of semantic information measures and learning functions. Then, it briefly introduces the author’s semantic information G theory with (...) the rate-fidelity function R(G) (G denotes SeMI, and R(G) extends R(D)) and its applications to multi-label learning, the maximum Mutual Information (MI) classification, and mixture models. Then it discusses how we should understand the relationship between SeMI and Shannon’s MI, two generalized entropies (fuzzy entropy and coverage entropy), Autoencoders, Gibbs distributions, and partition functions from the perspective of the R(G) function or the G theory. An important conclusion is that mixture models and Restricted Boltzmann Machines converge because SeMI is maximized, and Shannon’s MI is minimized, making information efficiency G/R close to 1. A potential opportunity is to simplify deep learning by using Gaussian channel mixture models for pre-training deep neural networks’ latent layers without considering gradients. It also discusses how the SeMI measure is used as the reward function (reflecting purposiveness) for reinforcement learning. The G theory helps interpret deep learning but is far from enough. Combining semantic information theory and deep learning will accelerate their development. (shrink)

Observe that complement questions can be either directly or indirectly conjoined, but they can only be indirectly disjoined. • What theories of questions and coordination predict this difference? • Look at Partition theory (Groenendijk & Stokhof 1984) and Inquisitive Semantics (Groenendijk & Roelofsen 2009, Ciardelli et al. 2012).

This paper investigates the prospects for a semantic theory that treats disjunction as a modal operator. Potential motivation for such a theory comes from the way in which modals embed within disjunctions. After reviewing some of the relevant data, I go on to distinguish a variety of modal theories of disjunction. I analyze these theories by considering pairs of conflicting desiderata, highlighting some of the tradeoffs they must face.

Roman Suszko said that “Obviously, any multiplication of logical values is a mad idea and, in fact, Łukasiewicz did not actualize it.” The aim of the present paper is to qualify this ‘obvious’ statement through a number of logical and philosophical writings by Professor Jan Woleński, all focusing on the nature of truth-values and their multiple uses in philosophy. It results in a reconstruction of such an abstract object, doing justice to what Suszko held a ‘mad’ project within a generalized (...) logic of judgments. Four main issues raised by Woleński will be considered to test the insightfulness of such generalized truth-values, namely: the principle of bivalence, the logic of scepticism, the coherence theory of truth, and nothingness. (shrink)

The paper surveys the currently available axiomatizations of common belief (CB) and common knowledge (CK) by means of modal propositional logics. (Throughout, knowledge- whether individual or common- is defined as true belief.) Section 1 introduces the formal method of axiomatization followed by epistemic logicians, especially the syntax-semantics distinction, and the notion of a soundness and completeness theorem. Section 2 explains the syntactical concepts, while briefly discussing their motivations. Two standard semantic constructions, Kripke structures and neighbourhood structures, are introduced in (...) Sections 3 and 4, respectively. It is recalled that Aumann's partitional model of CK is a particular case of a definition in terms of Kripke structures. The paper also restates the well-known fact that Kripke structures can be regarded as particular cases of neighbourhood structures. Section 3 reviews the soundness and completeness theorems proved w.r.t. the former structures by Fagin, Halpern, Moses and Vardi, as well as related results by Lismont. Section 4 reviews the corresponding theorems derived w.r.t. the latter structures by Lismont and Mongin. A general conclusion of the paper is that the axiomatization of CB does not require as strong systems of individual belief as was originally thought- only monotonicity has thusfar proved indispensable. Section 5 explains another consequence of general relevance: despite the "infinitary" nature of CB, the axiom systems of this paper admit of effective decision procedures, i.e., they are decidable in the logician's sense. (shrink)

It has been recently argued that the well-known square of opposition is a gathering that can be reduced to a one-dimensional figure, an ordered line segment of positive and negative integers [3]. However, one-dimensionality leads to some difficulties once the structure of opposed terms extends to more complex sets. An alternative algebraic semantics is proposed to solve the problem of dimensionality in a systematic way, namely: partition (or bitstring) semantics. Finally, an alternative geometry yields a new and (...) unique pattern of oppositions that proceeds with colored diagrams and an increasing set of bitstrings. (shrink)

Since the early 1980s, there has been a debate in the semantics literature pertaining to whether wh-interrogatives can be directly disjoined, as main clauses and as complements. Those who held that the direct disjunction of wh-interrogatives was in conflict with certain theoretical considerations proposed that they could be disjoined indirectly. Indirect disjunction proceeds by first lifting both wh-interrogatives and then disjoining them; it assigns matrix-level scope to OR. As we will see, the notorious theoretical need for indirect disjunction has (...) disappeared by today. But the factual question remains. Are wh-complements disjoined directly or indirectly? What is the fact of the matter? This paper argues that the case for indirect disjunction remains reasonably strong. (shrink)

The aim of this paper is to make sense of the Keynes–Johnson octagon of oppositions. We will discuss Keynes' logical theory, and examine how his view is reflected on this octagon. Then we will show how this structure is to be handled by means of a semantics of partition, thus computing logical relations between matching formulas with a semantic method that combines model theory and Boolean algebra.

Abstract: We propose a view of vagueness as a semantic property of names and predicates. All entities are crisp, on this semantic view, but there are, for each vague name, multiple portions of reality that are equally good candidates for being its referent, and, for each vague predicate, multiple classes of objects that are equally good candidates for being its extension. We provide a new formulation of these ideas in terms of a theory of granular partitions. We show that this (...) theory provides a general framework within which we can understand the relation between vague terms and concepts and the corresponding crisp portions of reality. We also sketch how it might be possible to formulate within this framework a theory of vagueness which dispenses with the notion of truth-value gaps and other artifacts of more familiar approaches. Central to our approach is the idea that judgments about reality involve in every case (1) a separation of reality into foreground and background of attention and (2) the feature of granularity. On this basis we attempt to show that even vague judgments made in naturally occurring contexts are not marked by truth-value indeterminacy. We distinguish, in addition to crisp granular partitions, also vague partitions, and reference partitions, and we explain the role of the latter in the context of judgments that involve vagueness. We conclude by showing how reference partitions provide an effective means by which judging subjects are able to temper the vagueness of their judgments by means of approximations. (shrink)

Our approach is based on a tri-partite method of integrating psychodynamic hypotheses, cognitive subliminal processes, and psychophysiological alpha power measures. We present ten social phobic subjects with three individually selected groups of words representing unconscious conflict, conscious symptom experience, and Osgood Semantic negative valence words used as a control word group. The unconscious conflict and conscious symptom words, presented subliminally and supraliminally, act as primes preceding the conscious symptom and control words presented as supraliminal targets. With alpha power as a (...) marker of inhibitory brain activity, we show that unconscious conflict primes, only when presented subliminally, have a unique inhibitory effect on conscious symptom targets. This effect is absent when the unconscious conflict primes are presented supraliminally, or when the target is the control words. Unconscious conflict prime effects were found to correlate with a measure of repressiveness in a similar previous study (Shevrin et al., 1992, 1996). Conscious symptom primes have no inhibitory effect when presented subliminally. Inhibitory effects with conscious symptom primes are present, but only when the primes are supraliminal, and they did not correlate with repressiveness in a previous study (Shevrin et al., 1992, 1996). We conclude that while the inhibition following supraliminal conscious symptom primes is due to conscious threat bias, the inhibition following subliminal unconscious conflict primes provides a neurological blueprint for dynamic repression: it is only activated subliminally by an individual's unconscious conflict and has an inhibitory effect specific only to the conscious symptom. These novel findings constitute neuroscientific evidence for the psychoanalytic concepts of unconscious conflict and repression, while extending neuroscience theory and methods into the realm of personal, psychological meaning. (shrink)

Hugh MacColl is commonly seen as a pioneer of modal and many-valued logic, given his introduction of modalities that go beyond plain truth and falsehood. But a closer examination shows that such a legacy is debatable and should take into account the way in which these modalities proceeded. We argue that, while MacColl devised a modal logic in the broad sense of the word, he did not give rise to a many-valued logic in the strict sense. Rather, his logic is (...) similar to a “non-Fregean logic”: an algebraic logic that partitions the semantic classes of truth and falsehood into subclasses but does not extend the range of truth-values. (shrink)

The logical basis for information theory is the newly developed logic of partitions that is dual to the usual Boolean logic of subsets. The key concept is a "distinction" of a partition, an ordered pair of elements in distinct blocks of the partition. The logical concept of entropy based on partition logic is the normalized counting measure of the set of distinctions of a partition on a finite set--just as the usual logical notion of probability based (...) on the Boolean logic of subsets is the normalized counting measure of the subsets (events). Thus logical entropy is a measure on the set of ordered pairs, and all the compound notions of entropy (join entropy, conditional entropy, and mutual information) arise in the usual way from the measure (e.g., the inclusion-exclusion principle)--just like the corresponding notions of probability. The usual Shannon entropy of a partition is developed by replacing the normalized count of distinctions (dits) by the average number of binary partitions (bits) necessary to make all the distinctions of the partition. (shrink)

This paper deals with Gärdenfors’ theory of conceptual spaces. Let \({\mathcal {S}}\) be a conceptual space consisting of 2-type fuzzy sets equipped with several kinds of metrics. Let a finite set of prototypes \(\tilde{P}_1,\ldots,\tilde{P}_n\in \mathcal {S}\) be given. Our main result is the construction of a classification algorithm. That is, given an element \({\tilde{A}}\in \mathcal {S},\) our algorithm classifies it into the conceptual field determined by one of the given prototypes \(\tilde{P}_i.\) The construction of our algorithm uses some physical analogies (...) and the Newton potential plays a significant role here. Importantly, the resulting conceptual fields are not convex in the Euclidean sense, which we believe is a reasonable departure from the assumptions of Gardenfors’ original definition of the conceptual space. A partitioning algorithm of the space \(\mathcal {S}\) is also considered in the paper. In the application section, we test our classification algorithm on real data and obtain very satisfactory results. Moreover, the example we consider is another argument against requiring convexity of conceptual fields. (shrink)

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

This is a re-look at the (Indian) Partition event through the lens of Advaita Vedanta.

We have a variety of different ways of dividing up, classifying, mapping, sorting and listing the objects in reality. The theory of granular partitions presented here seeks to provide a general and unified basis for understanding such phenomena in formal terms that is more realistic than existing alternatives. Our theory has two orthogonal parts: the first is a theory of classification; it provides an account of partitions as cells and subcells; the second is a theory of reference or intentionality; it (...) provides an account of how cells and subcells relate to objects in reality. We define a notion of well-formedness for partitions, and we give an account of what it means for a partition to project onto objects in reality. We continue by classifying partitions along three axes: (a) in terms of the degree of correspondence between partition cells and objects in reality; (b) in terms of the degree to which a partition represents the mereological structure of the domain it is projected onto; and (c) in terms of the degree of completeness with which a partition represents this domain. (shrink)

Classical logic is usually interpreted as the logic of propositions. But from Boole's original development up to modern categorical logic, there has always been the alternative interpretation of classical logic as the logic of subsets of any given (nonempty) universe set. Partitions on a universe set are dual to subsets of a universe set in the sense of the reverse-the-arrows category-theoretic duality--which is reflected in the duality between quotient objects and subobjects throughout algebra. Hence the idea arises of a dual (...) logic of partitions. That dual logic is described here. Partition logic is at the same mathematical level as subset logic since models for both are constructed from (partitions on or subsets of) arbitrary unstructured sets with no ordering relations, compatibility or accessibility relations, or topologies on the sets. Just as Boole developed logical finite probability theory as a quantitative treatment of subset logic, applying the analogous mathematical steps to partition logic yields a logical notion of entropy so that information theory can be refounded on partition logic. But the biggest application is that when partition logic and the accompanying logical information theory are "lifted" to complex vector spaces, then the mathematical framework of quantum mechanics is obtained. Partition logic models indefiniteness (i.e., numerical attributes on a set become more definite as the inverse-image partition becomes more refined) while subset logic models the definiteness of classical physics (an entity either definitely has a property or definitely does not). Hence partition logic provides the backstory so the old idea of "objective indefiniteness" in QM can be fleshed out to a full interpretation of quantum mechanics. (shrink)

Classical physics and quantum physics suggest two meta-physical types of reality: the classical notion of a objectively definite reality with properties "all the way down," and the quantum notion of an objectively indefinite type of reality. The problem of interpreting quantum mechanics (QM) is essentially the problem of making sense out of an objectively indefinite reality. These two types of reality can be respectively associated with the two mathematical concepts of subsets and quotient sets (or partitions) which are category-theoretically dual (...) to one another and which are developed in two mathematical logics, the usual Boolean logic of subsets and the more recent logic of partitions. Our sense-making strategy is "follow the math" by showing how the logic and mathematics of set partitions can be transported in a natural way to Hilbert spaces where it yields the mathematical machinery of QM--which shows that the mathematical framework of QM is a type of logical system over ℂ. And then we show how the machinery of QM can be transported the other way down to the set-like vector spaces over ℤ₂ showing how the classical logical finite probability calculus (in a "non-commutative" version) is a type of "quantum mechanics" over ℤ₂, i.e., over sets. In this way, we try to make sense out of objective indefiniteness and thus to interpret quantum mechanics. (shrink)

Abstract: This paper introduces and analyses the doctrine of externalism about semantic content; discusses the Twin Earth argument for externalism and the assumptions behind it, and examines the question of whether externalism about content is compatible with a privileged knowledge of meanings and mental contents.

Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary “propositional” logic should in general be the logic of subsets of a given universe set. Partitions on a set are dual to subsets of a set in the sense of the category-theoretic duality of epimorphisms and monomorphisms—which is reflected in the duality between quotient objects and subobjects throughout algebra. If “propositional” logic is thus seen as the logic of subsets of (...) a universe set, then the question naturally arises of a dual logic of partitions on a universe set. This paper is an introduction to that logic of partitions dual to classical subset logic. The paper goes from basic concepts up through the correctness and completeness theorems for a tableau system of partition logic. (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)

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.

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

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

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)

In this short note many conjectures on partitions of integers as summations of prime numbers are presented, which are extension of Goldbach conjecture.

In “Is semantics possible?” Putnam connected two themes: the very possibility of semantics (as opposed to formal model theory) for natural languages and the proper semantic treatment of common nouns. Putnam observed that abstract semantic accounts are modeled on formal languages model theory: the substantial contribution is rules for logical connectives (given outside the models), whereas the lexicon (individual constants and predicates) is treated merely schematically by the models. This schematic treatment may be all that is needed for (...) an account of validity in a formal setting, but it does not help to understand how proper and common nouns function in reality (not in models). Putnam then initiated the empirical study of such nouns to indicate, (i), that the popular Frege-Carnap account of them as (“disguised” compound) predicates is empirically incorrect, and, (ii), that they offer a new paradigm for a naturalistic semantics of natural languages. We take Putnam’s program a couple of steps further. First, we investigate the semantics of common nouns and argue that they refer (to kinds), rather than apply by satisfaction/truth to a designation/denotation. Second, we point to general results about semantics as a theory whose fulcrum is the reference relation rather than satisfaction in models and validity across them. (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)

I provide an analysis of sentences of the form ‘To be F is to be G’ in terms of exact truth-maker semantics—an approach that identifies the meanings of sentences with the states of the world directly responsible for their truth-values. Roughly, I argue that these sentences hold just in case that which makes something F is that which makes it G. This approach is hyperintensional, and possesses desirable logical and modal features. These sentences are reflexive, transitive and symmetric, and, (...) if they are true, then they are necessarily true, and it is necessary that all and only Fs are Gs. I close by defining an asymmetric and irreflexive notion of analysis in terms of the reflexive and symmetric one. (shrink)

In his “Bridging mainstream and formal ontology”, Augusto (2021) gives an excellent analysis of Dietrich von Freiberg’s idea of using causality as a partitioning principle for upper ontologies. For this Dietrich’s notion of extrinsic principles is crucial. The question whether causation can and indeed should be used as a partitioning principle for ontologies is discussed using mathematics and physics as examples.

According to Amie Thomasson's Modal Normativism (MN), knowledge of metaphysical modality is to be explained in terms of a speaker’s mastery of semantic rules, as opposed to one’s epistemic grasp of independent modal facts. In this chapter, I outline (MN)'s account of modal knowledge (§1) and argue that more than semantic mastery is needed for knowledge of metaphysical modality. Specifically (§2), in reasoning aimed at gaining such knowledge, a competent speaker needs to further deploy essentialist principles and information. In response, (...) normativists might contend that a competent speaker will only need to appeal to specific independence counterfactuals, on analogy with quasi-realism about morality. These conditionals fix the meaning of our terms at the actual world, independently of the particular context in which a statement is evaluated. However, I show that this strategy causes several problems for the account (§3). While those problems might perhaps be avoided by endorsing a certain picture of modal metaphysics (Modal Monism), such a picture involves notorious issues that normativists will have to address (§4). It is thus doubtful that (MN) can explain knowledge of metaphysical modality. Still, it may explain some modal knowledge without committing to Modal Monism. As I show (§5), semantic mastery may suffice for gaining knowledge of logical-conceptual modality or analyticity. (shrink)

In this paper I will be concerned with the question of the extent to which semantics can be thought of as a purely formal exercise, which we can engage in in a way that is neutral with respect to how our formal system is to be interpreted. I will be arguing, to the contrary, that the features of the formal systems which we use to do semantics are closely linked, in several different ways, to the interpretation that we (...) give to those formal systems. The occasion for this question, and the main example that I will use to illustrate my answer to it, is the close relationship between the formal systems employed in recent statements of apparently competing accounts of epistemic modals with the dynamic, expressivist, and relativist theoretical paradigms. The structure of the paper will be straightforward. In part 1, I will briefly introduce four theories of epistemic modals – one dynamic theory, two expressivist theories, and one relativist theory. Then in part 2 I’ll show that one expressivist theory is formally equivalent to the dynamic theory, that the other is formally equivalent to the relativist theory, and that the two expressivist theories are themselves essentially notational variants. I’ll use these facts to pose our central question: if these theories have so much formally in common, then doesn’t that suggest that we can separate the task of constructing a formal semantics from the task of deciding between competing interpretations of it? Finally, in part 3 I’ll answer that question in the negative. There are at least three reasons why formal semantics cannot be separated from questions of interpretation that are illustrated by the theories I introduce in part 1. (shrink)

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

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)

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 essay describes computational semantic networks for a philosophical audience and surveys several approaches to semantic-network semantics. In particular, propositional semantic networks are discussed; it is argued that only a fully intensional, Meinongian semantics is appropriate for them; and several Meinongian systems are presented.

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)

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)

In the present version of these lecture notes only a number of typos and a few glaring mistakes have been corrected. Thanks to Paul Dekker for his help in this respect. No attempt has been been made to update the original text or to incorporate new insights and approaches. For a more recent overview, see our ‘Questions’ in the Handbook of Logic and Language (edited by Johan van Benthem and Alice ter Meulen, Elsevier, 1997).

There is a prevalent notion among cognitive scientists and philosophers of mind that computers are merely formal symbol manipulators, performing the actions they do solely on the basis of the syntactic properties of the symbols they manipulate. This view of computers has allowed some philosophers to divorce semantics from computational explanations. Semantic content, then, becomes something one adds to computational explanations to get psychological explanations. Other philosophers, such as Stephen Stich, have taken a stronger view, advocating doing away with (...) semantics entirely. This paper argues that a correct account of computation requires us to attribute content to computational processes in order to explain which functions are being computed. This entails that computational psychology must countenance mental representations. Since anti-semantic positions are incompatible with computational psychology thus construed, they ought to be rejected. Lastly, I argue that in an important sense, computers are not formal symbol manipulators. (shrink)

Epistemic Contextualism is the view that “knows that” is semantically context-sensitive and that properly accommodating this fact into our philosophical theory promises to solve various puzzles concerning knowledge. Yet Epistemic Contextualism faces a big—some would say fatal—problem: The Semantic Error Problem. In its prominent form, this runs thus: speakers just don’t seem to recognise that “knows that” is context-sensitive; so, if “knows that” really is context-sensitive then such speakers are systematically in error about what is said by, or how to (...) evaluate, ordinary uses of “S knows that p”; but since it's wildly implausible that ordinary speakers should exhibit such systematic error, the expression “knows that” isn't context-sensitive. We are interested in whether, and in what ways, there is such semantic error; if there is such error, how it arises and is made manifest; and, again, if there is such error to what extent it is a problem for Epistemic Contextualism. The upshot is that some forms of The Semantic Error Problem turn out to be largely unproblematic. Those that remain troublesome have analogue error problems for various competitor conceptions of knowledge. So, if error is any sort of problem, then there is a problem for every extant competitor view. (shrink)

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.

Moeser suggested participants default to linear ordering elements but they can be primed to impose either linear or partial ordering. This study seems problematic insofar as ‘greater than’ might be understood to incline participants to favor linear orderings. Recent follow-up studies strongly suggest participants do not default to linear ordering. It seems plausible, moreover, that the observed priming effect is far more pervasive than Moeser countenanced. The present work explores the extent to which priming for linear or partial orders conflicts (...) with the construction of linear or partial ordering lists. Our two experiments suggest friction between priming and task, and also show once the priming tasks are cleared of potentially confounding semantic content, participants perform equally with respect to constructing linear or partial orders under similar priming conditions. (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)

We present a minimum message length (MML) framework for trajectory partitioning by point selection, and use it to automatically select the tolerance parameter ε for Douglas-Peucker partitioning, adapting to local trajectory complexity. By examining a range of ε for synthetic and real trajectories, it is easy to see that the best ε does vary by trajectory, and that the MML encoding makes sensible choices and is robust against Gaussian noise. We use it to explore the identification of micro-activities within a (...) longer trajectory. This MML metric is comparable to the TRACLUS metric – and shares the constraint of abstracting only by omission of points – but is a true lossless encoding. Such encoding has several theoretical advantages – particularly with very small segments (high frame rates) – but actual performance interacts strongly with the search algorithm. Both differ from unconstrained piecewise linear approximations, including other MML formulations. (shrink)