In this paper we develop a novel propositional semantics based on the framework of branching time. The basic idea is to replace the moment-history pairs employed as parameters of truth in the standard Ockhamist semantics by pairs consisting of a moment and a consistent, downward closed set of so-called transitions. Whereas histories represent complete possible courses of events, sets of transitions can represent incomplete parts thereof as well. Each transition captures one of the alternative immediate future possibilities (...) open at a branching point. The transition semantics exploits the structural resources a branching time structure has to offer and provides a fine-grained picture of the interrelation of modality and time. In addition to temporal and modal operators, a so-called stability operator becomes interpretable as a universal quantifier over the possible future extensions of a given transition set. The stability operator allows us to specify how and how far time has to unfold for the truth value of a sentence at a moment to become settled and enables a perspicuous treatment of future contingents. We show that the semantics developed along those lines generalizes and extends extant approaches: both Peirceanism and Ockhamism can be viewed as limiting cases of the transition approach that build on restricted resources only, and on both accounts, stability collapses into truth. (shrink)

We examine the relationship between dependence logic and game logics. A variant of dynamic game logic, called Transition Logic, is developed, and we show that its relationship with dependence logic is comparable to the one between first-order logic and dynamic game logic discussed by van Benthem. This suggests a new perspective on the interpretation of dependence logic formulas, in terms of assertions about reachability in games of imperfect information against Nature. We then capitalize on this intuition by developing expressively (...) equivalent variants of dependence logic in which this interpretation is taken to the foreground. (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 paper I show that we have strong empirical and theoretical reasons to treat the verbs we use in our semantic theorizing—particularly ‘refers to ’, ‘applies to ’, and ‘is true of ’—as intensional transitive verbs. Stating our semantic theories with intensional vocabulary allows us to partially reconcile two competing approaches to the nature and subject-matter of semantics: the Chomskian approach, on which semantics is non-relational, internalistic, and concerns the psychology of language users, and the Lewisian approach, (...) on which semantics is fully relational, specifies truth-conditions, and has metaphysical implications. ITVs have two readings: an intensional, de dicto reading, and a relational, de re reading. A semantic theory stated with the de dicto readings of our semantic verbs captures the core insights of the Chomskian approach to semantics, in part because it allows us to assign extremely fine-grained semantic values to expressions, even when those expressions are empty. On the other hand, the de re reading yields a theory that is fully relational, and issues in truth-conditions. The resulting theories are related—and compatible—in that they are expressed by two different readings of the very same semantic vocabulary, and plausibly, the distinction between these two readings is one of scope. (shrink)

This paper investigates whether an abstract linguistic construction shows the kind of prototype effects characteristic of non-linguistic categories, in both adults and young children. Adapting the prototype-plus-distortion methodology of Franks and Bransford (1971), we found that whereas adults were lured toward false-positive recognition of sentences with prototypical transitive semantics, young children showed no such effect. We examined two main implications of the results. First, it adds a novel data point to a growing body of research in cognitive linguistics and (...) construction grammar that shows abstract linguistic categories can behave in similar ways to non-linguistic categories, for example, by showing graded membership of a category. Thus, the findings lend psychological validity to the existing cross-linguistic evidence for prototypical transitive semantics. Second, we discuss a possible explanation for the fact that prototypical sentences were processed differently in adults and children, namely, that children’s transitive semantic network is not as interconnected or cognitively coherent as adults’. (shrink)

The formal conception of computation (FCC) holds that computational processes are not sensitive to semantic properties. FCC is popular, but it faces well-known difficulties. Accordingly, authors such as Block and Peacocke pursue a ?semantically-laden? alternative, according to which computation can be sensitive to semantics. I argue that computation is insensitive to semantics within a wide range of computational systems, including any system with ?derived? rather than ?original? intentionality. FCC yields the correct verdict for these systems. I conclude that (...) there is only one promising strategy for semantically-laden theorists: identify special computational systems that help generate their own semantic properties, and then show that computation within those systems is semantically-laden. Unfortunately, the few existing discussions that pursue this strategy are problematic. (shrink)

Silent gesture is not considered to be linguistic, on par with spoken and sign languages. It is claimed that silent gestures, unlike language, represent events holistically, without compositional structure. However, recent research has demonstrated that gesturers use consistent strategies when representing objects and events, and that there are behavioral and clinically relevant limits on what form a gesture may take to effect a particular meaning. This systematicity challenges a holistic interpretation of silent gesture, which predicts that there should be no (...) stable form‐meaning correspondence across event representations. Here, we demonstrate to the contrary that untrained gesturers systematically manipulate the form of their gestures when representing events with and without a theme (e.g., Someone popped the balloon vs. Someone walked), that is, transitive and intransitive events. We elicited silent gestures and annotated them for manual features active in coding transitivity distinctions in sign languages. We trained linear support vector machines to make item‐by‐item transitivity predictions based on these features. Prediction accuracy was good across the entire dataset, thus demonstrating that systematicity in silent gesture can be explained with recourse to subunits. We argue that handshape features are constructs co‐opted from cognitive systems subserving manual action production and comprehension for communicative purposes, which may integrate into the linguistic system of emerging sign languages. We further suggest that nonsigners tend to map event participants to each hand, a strategy found across genetically and geographically distinct sign languages, suggesting the strategy's cognitive foundation. (shrink)

This chapter gives a truthmaker-based account of the semantics of 'reifying' quantifiers like 'something' when they act as complements of intensional transitive verbs ('need', 'look for'). It argues that such quantifiers range over 'variable satisfiers' of the attitudinal object described by the verb (e.g. the need or the search).

The transition semantics presented in Rumberg (J Log Lang Inf 25(1):77–108, 2016a) constitutes a fine-grained framework for modeling the interrelation of modality and time in branching time structures. In that framework, sentences of the transition language L_t are evaluated on transition structures at pairs consisting of a moment and a set of transitions. In this paper, we provide a class of first-order definable Kripke structures that preserves L_t-validity w.r.t. transition structures. As a consequence, for a (...) certain fragment of L_t, validity w.r.t. transition structures turns out to be axiomatizable. The result is then extended to the entire language L_t by means of a quite natural ‘Henkin move’, i.e. by relaxing the notion of validity to bundled structures. (shrink)

It is commonly assumed that causation is transitive and in this paper I aim to reconcile this widely-held assumption with apparent evidence to the contrary. I will discuss a familiar approach to certain well-known counterexamples, before introducing a more resistant sort of case of my own. I will then offer a novel solution, based on Yablo’s proportionality principle, that succeeds in even these more resistant cases. There is a catch, however. Either proportionality is a constraint on which causal claims are (...) true, and the solution works, or it is not and causation is not transitive after all. I will argue that the first horn has unacceptable consequences and should be rejected, but that the second horn is less costly than it might initially appear. (shrink)

The aim of this article is to show that, just like in recent years Cobreros, Égré, Ripley and van Rooij provided a non-transitive counterpart of classical logic (meaning by this that all classically acceptable inferences are valid, but Cut and other metainferences are not) the same can be done for every Tarskian logic, with full generality. In order to establish this fact, we take a semantic approach, by showing that appropriate structures can be devised to characterize a non-transitive counterpart of (...) every Tarskian logic, starting from the logical matrices that are usually taken to render them. (shrink)

The transition semantics presented in Rumberg :77–108, 2016a) constitutes a fine-grained framework for modeling the interrelation of modality and time in branching time structures. In that framework, sentences of the transition language \ are evaluated on transition structures at pairs consisting of a moment and a set of transitions. In this paper, we provide a class of first-order definable Kripke structures that preserves \-validity w.r.t. transition structures. As a consequence, for a certain fragment of \, (...) validity w.r.t. transition structures turns out to be axiomatizable. The result is then extended to the entire language \ by means of a quite natural ‘Henkin move’, i.e. by relaxing the notion of validity to bundled structures. (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)

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 also makes it G. This approach is hyperintensional and possesses desirable logical and modal features. In particular, 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 motivate my account over Correia and Skiles’ [11] prominent alternative and close by defining an irreflexive and asymmetric notion of analysis in terms of the symmetric and reflexive notion. (shrink)

The paper’s novelty is in combining two comparatively new fields of research: non-transitive logic and the proof method of correspondence analysis. To be more detailed, in this paper the latter is adapted to Weir’s non-transitive trivalent logic \({\mathbf{NC}}_{\mathbf{3}}\). As a result, for each binary extension of \({\mathbf{NC}}_{\mathbf{3}}\), we present a sound and complete Lemmon-style natural deduction system. Last, but not least, we stress the fact that Avron and his co-authors’ general method of obtaining _n_-sequent proof systems for any _n_-valent logic (...) with deterministic or non-deterministic matrices is not applicable to \({\mathbf{NC}}_{\mathbf{3}}\) and its binary extensions. (shrink)

This paper studies the properties of eight semantic consequence relations defined from a Tarski-logic L and a preference relation ≺. They are equivalent to Shoham’s so-called preferential entailment for smooth model structures, but avoid certain problems of the latter in non-smooth configurations. Each of the logics can be characterized in terms of what we call multi-selection semantics. After discussing this type of semantics, we focus on some concrete proposals from the literature, checking a number of meta-theoretic properties and (...) elaborating on their intuitive motivation. As it turns out, many of their meta-properties only hold in case ≺ is transitive. To tackle this problem, we propose slight modifications of each of the systems, showing the resulting logics to behave better at the intuitive level and in metatheoretic terms, for arbitrary ≺. (shrink)

Logicians interested in naive theories of truth or set have proposed logical frameworks in which classical operational rules are retained but structural rules are restricted. One increasingly popular way to do this is by restricting transitivity of entailment. This paper discusses a series of logics in this tradition, in which the transitivity restrictions are effected by a determinacy constraint on assumptions occurring in both the major and minor premises of certain rules. Semantics and proof theory for 3-valued, continuum-valued and (...) surreal-valued semantics are given and the proof theory for the systems outlined. The framework is robust in the sense that no conditional, defined or primitive, which sustains the contraction principles underlying Curry paradoxes can be expressed. Classical recapture is smoothly achievable in the system which however is expressively limited and not semantically closed. The conclusion considers the issue of how to extend the system to capture full naive set theory. (shrink)

Autocatalytic networks have been used to model the emergence of self‐organizing structure capable of sustaining life and undergoing biological evolution. Here, we model the emergence of cognitive structure capable of undergoing cultural evolution. Mental representations (MRs) of knowledge and experiences play the role of catalytic molecules, and interactions among them (e.g., the forging of new associations) play the role of reactions and result in representational redescription. The approach tags MRs with their source, that is, whether they were acquired through social (...) learning, individual learning (of pre‐existing information), or creative thought (resulting in the generation of new information). This makes it possible to model how cognitive structure emerges and to trace lineages of cumulative culture step by step. We develop a formal representation of the cultural transition from Oldowan to Acheulean tool technology using Reflexively Autocatalytic and Food set generated (RAF) networks. Unlike more primitive Oldowan stone tools, the Acheulean hand axe required not only the capacity to envision and bring into being something that did not yet exist, but hierarchically structured thought and action, and the generation of new MRs: the concepts EDGING, THINNING, SHAPING, and a meta‐concept, HAND AXE. We show how this constituted a key transition toward the emergence of semantic networks that were self‐organizing, self‐sustaining, and autocatalytic, and we discuss how such networks replicated through social interaction. The model provides a promising approach to unraveling one of the greatest anthropological mysteries: that of why development of the Acheulean hand axe was followed by over a million years of cultural stasis. (shrink)

Previous studies have shown that children retreat from argument‐structure overgeneralization errors (e.g., *Don’t giggle me) by inferring that frequently encountered verbs are unlikely to be grammatical in unattested constructions, and by making use of syntax‐semantics correspondences (e.g., verbs denoting internally caused actions such as giggling cannot normally be used causatively). The present study tested a new account based on a unitary learning mechanism that combines both of these processes. Seventy‐two participants (ages 5–6, 9–10, and adults) rated overgeneralization errors with (...) higher (*The funny man’s joke giggled Bart) and lower (*The funny man giggled Bart) degrees of direct external causation. The errors with more‐direct causation were rated as less unacceptable than those with less‐direct causation. This finding is consistent with the new account, under which children acquire—in an incremental and probabilistic fashion—the meaning of particular constructions (e.g., transitive causative = direct external causation) and particular verbs, rejecting generalizations where the incompatibility between the two is too great. (shrink)

Points of variation manifested by adjectives crosslinguistically have received much recent attention in the literature. This paper argues that one way in which adjectives may differ is in their projection of a degree argument position in the syntax. Under standard analyses of adjectival meaning, semantic transitivity implies syntactic transitivity. However, the Navajo data presented in this paper suggests that while all Navajo adjectives have a degree argument in their semantics, syntactic projection of the degree argument is only licensed by (...) special morphology on the adjective. (shrink)

Kleene algebras and action logic were proposed to be solutions to the finite axiomatization problem of the algebra of regular sets (of strings). They are treated here as nonclassical logics—with Hilbert-style axiomatizations and semantics. We also provide intuitive accounts in terms of information states of the semantics which provide further insights into the formalisms. The three types of "Kripke-style'' semantics which we define develop insights from gaggle theory, and from our four-valued and generalized Kripke semantics for (...) the minimal substructural logic. Soundness and completeness are proven each time. (shrink)

De jure coreference in a discourse is typically understood as explicit coreference that speakers are required to recognize in order to count as having correctly understood the discourse. For example, in an utterance of the sentence ‘Tom went to the market because he needed soy milk’, the two underlined terms are typically coreferential in a way that appreciating their coreference is required to fully understand the utterance. Often, de jure coreference is understood as an equivalence relation, so in particular it (...) is thought of as a transitive relation. However, Pinillos (Philos Stud 154(2):301–324, 2011) provides examples that apparently challenge the transitivity of de jure coreference. In this paper, I argue for two claims. First, while it is inconclusive whether the relevant terms in Pinillos’s examples satisfy his third condition, it is much clearer that they fail to satisfy his first two conditions. Given that Pinillos’s conditions capture important characteristics of de jure coreference, his examples do not successfully show the non-transitivity of de jure coreference. Second, I present an alternative account of his examples, one that shows which representation the anaphoric pronoun in an example of the sort that he presents is de jure coreferential with. (shrink)

Models are constructed for a variety of systems of quantified relevance logic with identity. Models are given for systems with different principles governing the transitivity of identity and substitution, and the relative merits of these principles are discussed. The models in this paper are all extensions of the semantics of Fine's Semantics for Quantified Relevance Logic (Journal of Philosophical Logic 17 (1988)).

We draw parallels between several closely related logics that combine — in different proportions — elements of game theory, computation tree logics, and epistemic logics to reason about agents and their abilities. These are: the coalition game logics CL and ECL introduced by Pauly 2000, the alternating-time temporal logic ATL developed by Alur, Henzinger and Kupferman between 1997 and 2002, and the alternating-time temporal epistemic logic ATEL by van der Hoek and Wooldridge (2002). In particular, we establish some subsumption and (...) equivalence results for their semantics, as well as interpretation of the alternating-time temporal epistemic logic into ATL. The focus in this paper is on models: alternating transition systems, multi-player game models (alias concurrent game structures) and coalition effectivity models turn out to be intimately related, while alternating epistemic transition systems share much of their philosophical and formal apparatus. Our approach is constructive: we present ways to transform between different types of models and languages. (shrink)

Linguists, biological anthropologists, and cognitive scientists come together in this book to explore the origins and early evolution of phonology, syntax, and semantics. They consider the nature of pre- and proto-linguistic communication, the internal and external triggers that led to its transformation into language, and whether and how language may be considered to have evolved after its inception. Evidence is drawn from many domains, including computer simulations of language emergence, the songs of finches, problem-solving abilities in monkeys, sign language, (...) and the structure of languages today. (shrink)

This paper will deal with three questions regarding Carnap's transition from the position he held at the time of writing Syntax to the doctrines he held during his semantic phase: (1) What was Carnap's attitude towards truth at the time of writing Syntax? (2) What was Carnap's position regarding questions of reference and ontology at the time of writing Syntax? (3) Was Carnap's acceptance of Tarski's analysis of truth and reference detrimental to his philosophical project? Section 1 of this (...) paper will deal with the first of these questions. Special attention will be paid to identifying what it was that prevented Carnap from defining a truth predicate for descriptive languages in Syntax. Section 2 of this paper will deal with the question of Carnap's attitude towards reference and ontology in Syntax. It will be shown that the attempt in Syntax to address ontological questions is seriously defective. Section 3 of this paper addresses the last of the questions posed above. It is argued that in the light of what is established in Sections 1 and 2, Carnap could not have retained the position of Syntax with respect to truth and reference. (shrink)

A coherence-based probability semantics for categorical syllogisms of Figure I, which have transitive structures, has been proposed recently (Gilio, Pfeifer, & Sanfilippo [15]). We extend this work by studying Figure II under coherence. Camestres is an example of a Figure II syllogism: from Every P is M and No S is M infer No S is P. We interpret these sentences by suitable conditional probability assessments. Since the probabilistic inference of ~????|???? from the premise set {????|????, ~????|????} is not (...) informative, we add ????(????|(????∨????))>0 as a probabilistic constraint (i.e., an “existential import assumption”) to obtain probabilistic informativeness. We show how to propagate the assigned (precise or interval-valued) probabilities to the sequence of conditional events (????|????,~????|????,????|(????∨????)) to the conclusion ~????|???? . Thereby, we give a probabilistic meaning to the other syllogisms of Figure II. Moreover, our semantics also allows for generalizing the traditional syllogisms to new ones involving generalized quantifiers (like Most S are P) and syllogisms in terms of defaults and negated defaults. (shrink)

In this paper, we give an alternative semantics to the non-normal logic of knowing how proposed by Fervari et al., based on a class of Kripke neighborhood models with both the epistemic relations and neighborhood structures. This alternative semantics is inspired by the same quantifier alternation pattern of ∃∀\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\exists \forall $$\end{document} in the semantics of the know-how modality and the neighborhood semantics for the standard modality. We show (...) that this new semantics is equivalent to the original Kripke semantics in terms of the validities. A key result is a representation theorem showing that the more abstract Kripke neighborhood models can be represented by the concrete Kripke models with action transitions modulo the valid formulas. We prove the completeness of the logic for the neighborhood semantics. The neighborhood semantics can be adapted to other variants of logics of knowing how. It provides us a powerful technical tool to study these logics while preserving the basic semantic intuition. (shrink)

In their chapter, Bourmayan and Recanati discuss the intransitive use of 'eat' and cognate verbs which take (on such uses) an indefinite implicit argument. Sometimes, Recanati pointed out in early work, the implicit argument of intransitive 'eat' seems definite ; there are also seemingly anaphoric and bound uses. How to account for them ? Recanati's early account invoked free enrichment, but Marti's negation test provides counter-examples to that account. Bourmayan and Recanati offer a new, situation-theoretic account, show that it can (...) handle the negation data, and discuss the implications of the account for the Recanati-Stanley debate over for the semantics/pragmatics interface. (shrink)

The word buddhi is an important term of Indian philosophical discourse, but some aspects of its use have caused confusion and continue to occasion difficulties. This paper undertakes a survey of the usage of the word buddhi in general Sanskrit literature from its earliest late Vedic occurrences up to the middle of the first millennium CE. Signifying fundamentally “awareness,” the word “buddhi” is shown to refer often to a being’s persisting capacity or faculty of awareness and also, often, to the (...) content of a being’s awareness. There are also instances where it is hard to determine which of these two kinds of reference are intended in our written sources, and there are other instances where both senses seem present simultaneously. Various examples attest to the use of the word to refer to an affective and volitional capacity in a being—and to affective and volitional content—as well as to a cognitive faculty and cognitive content. One feature that occurs frequently in the word’s use is that this faculty and, or, its content, regularly describe alterations of a subject’s knowledge of the surrounding situation, the transformation of surrounding complexity or multiplicity into a simpler and more manageable mental construct—an understanding, an interpretation, a decision, a plan, etc. As the word buddhi is related to the primary Sanskrit word-family used to describe the concrete experience of awakening—moving from no awareness to clear awareness—it is not surprising that its more abstract usage would often incorporate a similar dynamic, a transition from less clear to more clear knowledge, a rendering of early knowledge to better and more useful knowledge, in short, a faculty of “intellect” that produces refined decisions, resolutions, and determinations. It is suggested that this element of its semantic profile contributed to the word’s eventually becoming the preferred word for the most important of the mental functions of beings in one of the most widespread philosophical psychologies of ancient India, that which ultimately became formally enshrined in the philosophical system “Sāṃkhya.”. (shrink)

The word buddhi is an important term of Indian philosophical discourse, but some aspects of its use have caused confusion and continue to occasion difficulties. This paper undertakes a survey of the usage of the word buddhi in general Sanskrit literature from its earliest late Vedic occurrences up to the middle of the first millennium CE. Signifying fundamentally “awareness,” the word “buddhi” is shown to refer often to a being’s persisting capacity or faculty of awareness and also, often, to the (...) content of a being’s awareness. There are also instances where it is hard to determine which of these two kinds of reference are intended in our written sources, and there are other instances where both senses seem present simultaneously. Various examples attest to the use of the word to refer to an affective and volitional capacity in a being—and to affective and volitional content—as well as to a cognitive faculty and cognitive content. One feature that occurs frequently in the word’s use is that this faculty and, or, its content, regularly describe alterations of a subject’s knowledge of the surrounding situation, the transformation of surrounding complexity or multiplicity into a simpler and more manageable mental construct—an understanding, an interpretation, a decision, a plan, etc. As the word buddhi is related to the primary Sanskrit word-family used to describe the concrete experience of awakening—moving from no awareness to clear awareness—it is not surprising that its more abstract usage would often incorporate a similar dynamic, a transition from less clear to more clear knowledge, a rendering of early knowledge to better and more useful knowledge, in short, a faculty of “intellect” that produces refined decisions, resolutions, and determinations. It is suggested that this element of its semantic profile contributed to the word’s eventually becoming the preferred word for the most important of the mental functions of beings in one of the most widespread philosophical psychologies of ancient India, that which ultimately became formally enshrined in the philosophical system “Sāṃkhya.”. (shrink)

Whilst certain verbs may appear in both the intransitive inchoative and the transitive causative constructions (The ball rolled/The man rolled the ball), others may appear in only the former (The man laughed/*The joke laughed the man). Some accounts argue that children acquire these restrictions using only (or mainly) statistical learning mechanisms such as entrenchment and pre-emption. Others have argued that verb semantics are also important. To test these competing accounts, adults (Experiment 1) and children aged 5–6 and 9–10 (Experiment (...) 2) were taught novel verbs designed to be construed — on the basis of their semantics — as either intransitive-only or alternating. In support of the latter claim, participants' grammaticality judgments revealed that even the youngest group respected these semantic constraints. Frequency (entrenchment) effects were observed for familiar, but not novel, verbs (Experiment 1). We interpret these findings in the light of a new theoretical account designed to yield effects of both verb semantics and entrenchment/pre-emption. (shrink)

We consider the problem of semantic opposition; in particular, theproblem of determining adjective-verb opposition for transitive changeof state verbs and adjectivally modified grammatical objects. Semanticopposition problems of this type are a sub-case of the classic FrameProblem; the well-known problem of knowing what is preserved orchanged in the world as a result of some action or event. Bydefinition, grammatical objects of change of state verbs undergomodification. In cases where the object is adjectivally modified, theproblem reduces to determining whether the property denoted (...) by theadjective still holds true after the event denoted by the verb. Inthis paper, we evaluate the efficacy of WordNet, a network of conceptsorganized around linguistically relevant semantic relations includingantonymy, for this task. Test examples are drawn from the linguisticliterature. Results are analyzed in detail with a view towardsproviding feedback on the concept of a network as an appropriate modelof semantic relations for problems in semantic inference. (shrink)

There is good reason to think that, in every case of perceptual consciousness, there is something of which we are conscious; but there is also good reason to think that, in some cases of perceptual consciousness—for instance, hallucinations—there is nothing of which we are conscious. This paper resolves this inconsistency—which we call the presentation problem—by (a) arguing that ‘conscious of’ and related expressions function as intensional transitive verbs and (b) defending a particular semantic approach to such verbs, on which they (...) have readings that lack direct objects or themes. The paper further argues that this approach serves not only as a linguistic proposal about the semantics of ‘conscious of’, but also as a proposal about the metaphysics of conscious states. (shrink)

In this study, we test a number of predictions concerning children's knowledge of the transitive Subject-Verb-Object (SVO) construction between two and three years on one child (Thomas) for whom we have densely collected data. The data show that the earliest SVO utterances reflect earlier use of those same verbs, and that verbs acquired before 2;7 show an earlier move towards adult-like levels of use in the SVO construction and in object argument complexity than later acquired verbs. There is not a (...) close relation with the input in the types of subject and object referents used, nor a close adherence to Preferred Argument Structure (PAS) before 2;7, but both early and late acquired verbs show a simultaneous move towards PAS patterns in selection of referent type at 2;9. The event semantics underpinning early transitive utterances do not straightforwardly fit prototype (high or inalienable) notions of transitivity, but rather may reflect sensitivity to animacy and intentionality in a way that mirrors the input. We conclude that children's knowledge of the transitive construction continues to undergo significant development between 2;0 and 3;0, reflecting the gradual abstraction and integration of the SVO and VO constructions, verb semantics, discourse pragmatics, and the interactions between these factors. These factors are considered in the context of a prototype for the transitive construction. (shrink)

In the context of propositional logics, we apply semantics modulo satisfiability—a restricted semantics which comprehends only valuations that satisfy some specific set of formulas—with the aim to efficiently solve some computational tasks. Three possible such applications are developed.We begin by studying the possibility of implicitly representing rational McNaughton functions in Łukasiewicz Infinitely-valued Logic through semantics modulo satisfiability. We theoretically investigate some approaches to such representation concept, called representation modulo satisfiability, and describe a polynomial algorithm that builds representations (...) in the newly introduced system. An implementation of the algorithm, test results and ways to randomly generate rational McNaughton functions for testing are presented. Moreover, we propose an application of such representations to the formal verification of properties of neural networks by means of the reasoning framework of Łukasiewicz Infinitely-valued Logic.Then, we move to the investigation of the satisfiability of joint probabilistic assignments to formulas of Łukasiewicz Infinitely-valued Logic, which is known to be an NP-complete problem. We provide an exact decision algorithm derived from the combination of linear algebraic methods with semantics modulo satisfiability. Also, we provide an implementation for such algorithm for which the phenomenon of phase transition is empirically detected.Lastly, we study the game theory situation of observable games, which are games that are known to reach a Nash equilibrium, however, an external observer does not know what is the exact profile of actions that occur in a specific instance; thus, such observer assigns subjective probabilities to players actions. We study the decision problem of determining if a set of these probabilistic constraints is coherent by reducing it to the problems of satisfiability of probabilistic assignments to logical formulas both in Classical Propositional Logic and Łukasiewicz Infinitely-valued Logic depending on whether only pure equilibria or also mixed equilibria are allowed. Such reductions rely upon the properties of semantics modulo satisfiability. We provide complexity and algorithmic discussion for the coherence problem and, also, for the problem of computing maximal and minimal probabilistic constraints on actions that preserves coherence.prepared by Sandro Márcio da Silva Preto.E-mail: [email protected]:https://doi.org/10.11606/T.45.2021.tde-17062021-163257. (shrink)

LAS is a program that acquires augmented transition network (ATN) grammars. It requires as data sentences of the language and semantic network representatives of their meaning. In acquiring the ATN grammars, it induces the word classes of the language, the rules of formation for sentences, and the rules mapping sentences onto meaning. The induced ATN grammar can be used both for sentence generation and sentence comprehension. Critical to the performance of the program are assumptions that it makes about the (...) relation between sentence structure and surface structure (the graph deformation condition), about when word classes may be formed and when ATN networks may be merged, and about the structure of noun phrases. These assumptions seem to be good heuristics which are largely true for natural languages although they would not be true for many nonnatural languages. Provided these assumptions are satisfied LAS seems capable of learning any context‐free language. (shrink)

When searching for concepts in memory—as in the verbal fluency task of naming all the animals one can think of—people appear to explore internal mental representations in much the same way that animals forage in physical space: searching locally within patches of information before transitioning globally between patches. However, the definition of the patches being searched in mental space is not well specified. Do we search by activating explicit predefined categories and recall items from within that category, or do we (...) activate and recall a connected sequence of individual items without using categorical information, with each item recalled leading to the retrieval of an associated item in a stream, or both? Using semantic representations in a search of associative memory framework and data from the animal fluency task, we tested competing hypotheses based on associative and categorical search models. Associative, but not categorical, patch transitions took longer to make than position-matched productions, suggesting that categorical transitions were not true transitions. There was also clear evidence of associative search even within categorical patch boundaries. Furthermore, most individuals' behavior was best explained by an associative search model without the addition of categorical information. Thus, our results support a search process that does not use categorical information, but for which patch boundaries shift with each recall and local search is well described by a random walk in semantic space, with switches to new regions of the semantic space when the current region is depleted. (shrink)

Following Kit Fine (2007), we can say that the de jure pair represent the referent as the same while the second one does not do so. There are roughly three ways of capturing this difference. One could say that de jure coreference between two expression occurrences happen because (a) the occurrences have identical meanings, (b) they have identical syntactic properties, or (c) they enter into a semantic relation not grounded in identity of meaning or syntax. In what follows, I give (...) some reason to think that de jure coreference is not a transitive relation. As a consequence, we can rule out (a) and (b) just on these grounds alone (since identity is a transitive relation). (c) then looks promising. I argue that this gives further support for a relationist semantics along the lines of what Kit Fine has proposed. (shrink)

Sentence comprehension involves maintaining and continuously integrating linguistic information and, thus, makes demands on working memory. Past research has demonstrated that semantic WM, but not phonological WM, is critical for integrating word meanings across some distance and resolving semantic interference in sentence comprehension. Here, we examined the relation between phonological and semantic WM and the comprehension of center-embedded relative clause sentences, often argued to make heavy demands on WM. Additionally, we examined the relation between phonological and semantic WM and the (...) comprehension of transitive and dative active and passive sentences, which may also draw on WM resources depending on the number of propositions that must be maintained and the difficulty of processing passive clauses. In a large sample of individuals with aphasia, we assessed whether comprehension performance on more complex vs. simpler active-passive or embedded relative clause sentences would be predicted by semantic but not phonological WM when controlling for single word comprehension. For performance on the active-passive comprehension task, we found that semantic WM, but not phonological WM, predicted comprehension of dative sentences when controlling for comprehension of transitive sentences. We also found that phonological WM, but not semantic WM, predicted mean comprehension for reversible active-passive sentences when controlling for trials with lexical distractors. On the relative clause comprehension task, consistent with prior results, we found that semantic WM, but not phonological WM, predicted comprehension of object relative clause sentences and relative clause sentences with a passive construction. However, both phonological WM and semantic WM predicted mean comprehension across all relative clause types for reversible trials when controlling for trials with lexical distractors. While we found evidence of semantic WM’s role in comprehension, we also observed unpredicted relations between phonological WM and comprehension in some conditions. Post-hoc analyses provided preliminary evidence that phonological WM maintains a backup phonological representation of the sentence that may be accessed when sentence comprehension processing is less efficient. Future work should investigate possible roles that phonological WM may play across sentence types. (shrink)

This is a reply to the commentaries on my paper 'Truthmaker Semantics for Natural Language: Attitude Verbs, Modals, and Intensional Transitive Verbs'. The paper is a commissioned 'target' article, with commentaries by W. Davis, B. Arsenijevic, K. Moulton, K. Liefke, M. Kaufman, R. Matthews, P. Portner and A. Rubinstein, P. Elliott, and G. Ramchand.

In the recent paper “Naive modus ponens”, Zardini presents some brief considerations against an approach to semantic paradoxes that rejects the transitivity of entailment. The problem with the approach is, according to Zardini, that the failure of a meta-inference closely resembling modus ponens clashes both with the logical idea of modus ponens as a valid inference and the semantic idea of the conditional as requiring that a true conditional cannot have true antecedent and false consequent. I respond on behalf of (...) the non-transitive approach. I argue that the meta-inference in question is independent from the logical idea of modus ponens, and that the semantic idea of the conditional as formulated by Zardini is inadequate for his purposes because it is spelled out in a vocabulary not suitable for evaluating the adequacy of the conditional in semantics for non-transitive entailment. I proceed to generalize the semantic idea of the conditional and show that the most popular semantics for non-transitive entailment satisfies the new formulation. (shrink)

If □ is conceived as an operator, i.e., an expression that gives applied to a formula another formula, the expressive power of the language is severely restricted when compared to a language where □ is conceived as a predicate, i.e., an expression that yields a formula if it is applied to a term. This consideration favours the predicate approach. The predicate view, however, is threatened mainly by two problems: Some obvious predicate systems are inconsistent, and possible-worlds semantics for predicates (...) of sentences has not been developed very far. By introducing possible-worlds semantics for the language of arithmetic plus the unary predicate □, we tackle both problems. Given a frame (W, R) consisting of a set W of worlds and a binary relation R on W, we investigate whether we can interpret □ at every world in such a way that □ $\ulcorner A \ulcorner$ holds at a world ᵆ ∊ W if and only if A holds at every world $\upsilon$ ∊ W such that ᵆR $\upsilon$ . The arithmetical vocabulary is interpreted by the standard model at every world. Several 'paradoxes' (like Montague's Theorem, Gödel's Second Incompleteness Theorem, McGee's Theorem on the ω-inconsistency of certain truth theories, etc.) show that many frames, e.g., reflexive frames, do not allow for such an interpretation. We present sufficient and necessary conditions for the existence of a suitable interpretation of □ at any world. Sound and complete semi-formal systems, corresponding to the modal systems K and K4, for the class of all possible-worlds models for predicates and all transitive possible-worlds models are presented. We apply our account also to nonstandard models of arithmetic and other languages than the language of arithmetic. (shrink)

It has been suggested that the Modal Interpretation of Quantum Mechanics (QM) is "incomplete" if it lacks a dynamics for possessed values. I argue that this is only one of two possible attitudes one might adopt toward a Modal Interpretation without dynamics. According to the other attitude, such an interpretation is a complete interpretation of QM as standardly formulated, an interpretation whose innovation is to attempt to make sense of the quantum realm without the expedient of novel physics. Then I (...) explain why this attitude, though available, is unattractive. Without dynamics, the Modal Interpretation vanquishes the measurement problem only, it seems, to succumb to the problem of state preparation. On this view, the Modal Interpretation needs dynamics not to be an interpretation at all, but to be an adequate one. I review reasons to suspect that the dynamics which would best suit the Modal Interpretation--a dynamics equivalent to a set of two time transition probabilities of the sort used to solve the preparation problem--is not a dynamics the interpretation can have. I close with a brief discussion of versions of the Modal Interpretation that may not succumb to the considerations presented here. (shrink)

We present a model-theoretic approach for reasoning about security protocols, applying recent insights from dynamic epistemic logics. This enables us to describe exactly the subsequent epistemic states of the agents participating in the protocol, using Kripke models and transitions between these based on updates of the agent's beliefs associated with steps in the protocol. As a case study we will consider the SRA Three Pass protocol and discuss the Wide-Mouthed Frog protocol.

The paper presents a truth-maker semantics for Strict/Tolerant Logic (ST), which is the currently most popular logic among advocates of the non-transitive approach to paradoxes. Besides being interesting in itself, the truth-maker presentation of ST offers a new perspective on the recently discovered hierarchy of meta-inferences that, according to some, generalizes the idea behind ST. While fascinating from a mathematical perspective, there is no agreement on the philosophical significance of this hierarchy. I aim to show that there is no (...) clear philosophical significance of meta-inferences above the first level. (shrink)

Fixpoint semantics are provided for ambiguity blocking and propagating variants of Nute's defeasible logic. The semantics are based upon the well-founded semantics for logic programs. It is shown that the logics are sound with respect to their counterpart semantics and complete for locally finite theories. Unlike some other nonmonotonic reasoning formalisms such as Reiter's default logic, the two defeasible logics are directly skeptical and so reject floating conclusions. For defeasible theories with transitive priorities on defeasible rules, (...) the logics are shown to satisfy versions of Cut and Cautious Monotony. For theories with either conflict sets closed under strict rules or strict rules closed under transposition, a form of Consistency Preservation is shown to hold. The differences between the two logics and other variants of defeasible logic—specifically those presented by Billington, Antoniou, Governatori, and Maher—are discussed. (shrink)