It is argued that most anaphors have semantic content and that the semantic content of a given anaphoric atom plays an active role in determining both its distribution and the interpretation of the sentences in which it is employed. It is first demonstrated that semantic distinctions between semantically relational anaphoric atoms predict differences between their distributions. It is then argued that all of the semantically relational anaphoric atoms respect Principle A, while semantically contentless anaphors often (...) do not. (shrink)

Psychology suffers from the absence of mathematically-formalized primitives. As a result, conceptual and quantitative studies lack an ontological basis that would situate them in the company of natural sciences. The article addresses this problem by describing a minimal psychic structure, expressed in the algebra of quantum theory. The structure is demarcated into categories of emotion and color, renowned as elementary psychological phenomena. This is achieved by means of quantum-theoretic qubit state space, isomorphic to emotion and color experiences both in meaning (...) and math. In particular, colors are mapped to the qubit states through geometric affinity between the HSL-RGB color solids and the Bloch sphere, widely used in physics. The resulting correspondence aligns with the recent model of subjective experience, producing a unified spherical map of emotions and colors. This structure is identified as a semantic atom of natural thinking—a unit of affectively-colored personal meaning, involved in elementary acts of a binary decision. The model contributes to finding a unified ontology of both inert and living Nature, bridging previously disconnected fields of research. In particular, it enables theory-based coordination of emotion, decision, and cybernetic sciences, needed to achieve new levels of practical impact. (shrink)

In this paper, we consider some contributions to the model theory of the logic of formal inconsistency $\mathsf{QmbC}$ as a reply to Walter Carnielli, Marcelo Coniglio, Rodrigo Podiacki and Tarcísio Rodrigues’ call for a ‘wider model theory.’ This call demands that we align the practices and techniques of model theory for logics of formal inconsistency as closely as possible with those employed in classical model theory. The key result is a proof that the Keisler–Shelah isomorphism theorem holds for $\mathsf{QmbC}$, i.e. (...) that the strong elementary equivalence of two $\mathsf{QmbC}$ models $\mathfrak{A}$ and $\mathfrak{B}$ is equivalent to them having strongly isomorphic ultrapowers. As intermediate steps, we introduce some notions of model-theoretic equivalence between $\mathsf{QmbC}$ models, explicitly prove Łoś’ theorem and introduce a useful technique of model-theoretic ‘atomization’ in which the satisfaction sets of non-deterministically evaluated formulae are associated with new predicates. Finally, we consider some of the extensions of $\mathsf{QmbC}$, explicitly showing that Keisler–Shelah holds for $\mathsf{QCi}$ and suggesting that it holds of extensions like $\mathsf{QCila}$ and $\mathsf{QCia}$ as well. (shrink)

Elaborating on Wittgenstein’s ontology of facts, semantic frames are described axiomatically as based on the notion of an elementary situation being the verifier of a proposition. Conditions are investigated then for such frames to be atomic, i.e. to have lattice-theoretic counterparts of his “Sachverhalte”.

Inferentialism is a theory in the philosophy of language which claims that the meanings of expressions are constituted by inferential roles or relations. Instead of a traditional model-theoretic semantics, it naturally lends itself to a proof-theoretic semantics, where meaning is understood in terms of inference rules with a proof system. Most work in proof-theoretic semantics has focused on logical constants, with comparatively little work on the semantics of non-logical vocabulary. Drawing on Robert Brandom’s notion of material inference and Greg Restall’s (...) bilateralist interpretation of the multiple conclusion sequent calculus, I present a proof-theoretic semantics for atomic sentences and their constituent names and predicates. The resulting system has several interesting features: (1) the rules are harmonious and stable; (2) the rules create a structure analogous to familiar model-theoretic semantics; and (3) the semantics is compositional, in that the rules for atomic sentences are determined by those for their constituent names and predicates. (shrink)

This essay addresses one of the open questions of proof-theoretic semantics: how to understand the semantic values of atomic sentences. I embed a revised version of the explanatory proof system of Millson and Straßer (2019) into the proof-theoretic semantics of Francez (2015) and show how to specify (part of) the intended interpretation of atomic sentences on the basis of their occurrences in the premises and conclusions of inferences to and from best explanations.

기존의 증명론적 의미론은 대부분 논리상항의 의미에 대한 증명론적 규명에 그 초점이 맞추어져왔다. 그러나 원자문장의 의미에 대한 증명론적 규명이 이루어지지 않는 한 증명론적 의미론은 불완전한 이론에 머무르게 된다. 이 글에서는 증명론적 의미론의 원자적 기반에 관한 문제가 검토되고 그 해결책이 모색될 것이다. 증명론적 의미론의 대표적인 형태인 프라위츠와 덤밋의 증명론적 타당성개념의 핵심 사항들에 대해 논의하고, 이 이론에 대한 원자적 기반의 문제를 제기한 후, 최소한 귀납적으로 정의된 술어에 관해서는 만족스런 원자적 기반이 마련될 수 있음을 보일 것이며, 이를 넘어서 보다 포괄적인 원자적 기반을 제시하는 문제가 (...) 검토되고 그 해결책이 모색될 것이다. (shrink)

Nazariyat, Journal for the History of Islamic Philosophy and Sciences, issued twice a year in English and Turkish (Nazariyat İslam Felsefe ve Bilim Tarihi Araştırmaları Dergisi), is a refereed international journal. It publishes original studies, critical editions of classical texts and book reviews on Islamic philosophy, kalām, theoretical aspects of Sufism and the history of sciences. The goal of Nazariyat is to contribute to the discovery, examination and reinterpretation of the theoretical traditions in the history of Islamic thought, by giving (...) special attention to the post-classical period of it. **ISSN: 2148-8088 E-ISBN: 2547-9415**. (shrink)

Contemporary arguments for forms of psycho-physical dualism standardly depart from phenomenal aspects of consciousness. Conceptual aspects of conscious experience, as opposed to phenomenal or visual/perceptual ones, are often taken to be within the scope of functionalist, reductionist, or physicalist theories. I argue that the particular conceptual structure of human consciousness makes this asymmetry unmotivated. The argument for a form of dualism defended here proceeds from the empirical premise that conceptual structure in a linguistic creature like us is a combinatorial and (...) compositional system that implicates a distinction between simple and complex, or 'atomic' and 'molecular' concepts. The argument is that conceptual atoms, qua atoms, are irreducible to anything else. If so, and if the atoms are essentially semantic, a form of dualism follows: though positively inviting naturalistic inquiry into the semantic and mental aspects of nature, it requires that we look at the mental as a primitive domain of nature. Schematically, then, the argument is as follows: Human consciousness/thought is conceptually structured. The human conceptual system is a 'particulate' system at a syntactic and semantic level of representation. This implies the existence of conceptual 'particles', concepts that have no further semantic decomposition. A conceptual atom cannot be explained in terms of anything that does not involve its own intrinsic properties. Physicalism as normally conceived is inconsistent with and. (shrink)

What are the semantic representations that underlie language production? We use structural priming to distinguish between two competing theories. Thematic roles define semantic structure in terms of atomic units that specify event participants and are ordered with respect to each other through a hierarchy of roles. Event structures instead instantiate semantic structure as embedded sub‐predicates that impose an order on verbal arguments based on their relative positioning in these embeddings. Across two experiments, we found that priming for (...) datives depended on the degree of overlap in event structures. Specifically, while all dative structures showed priming, due to common syntax, there was a boost for compositional datives priming other compositional datives. Here, the two syntactic forms have distinct event structures. In contrast, there was no boost in priming for dative light verbs, where the two forms map onto a single event representation. On the thematic roles hypothesis, we would have expected a similar degree of priming for the two cases. Thus, our results support event structural approaches to semantic representation and not thematic roles. (shrink)

It is argued that the usual proposals for dealing with mass-Quantification--All x is f--Are inadequate with the predicate is complex or when multiple quantification is considered. Mass-Quantification is seen as a generalisation of ordinary (thing) quantification in that the specialising assumption that the domain of quantification is atomic is not made. It is suggested that the semantic values of predicates are complete ideals of the boolean algebra consisting of the quantity which is the domain of quantification and all its (...) sub-Quantities, While logical connectives are represented by operations on complete ideals. (shrink)

We present a semantic game for Gödel logic and its extensions, where the players’ interaction stepwise reduces arbitrary claims about the relative order of truth degrees of complex formulas to atomic ones. The paper builds on a previously developed game for Gödel logic with projection operator in Fermüller et al., Information processing and management of uncertainty in knowledge-based systems, Springer, Cham, 2020, pp. 257–270). This game is extended to cover Gödel logic with involutive negations and constants, and then lifted (...) to a provability game using the concept of disjunctive strategies. Winning strategies in the provability game, with and without constants and involutive negations, turn out to correspond to analytic proofs in a version of \ :1941–1958, 2010) and in a sequent-of-relations calculus, Automated reasoning with analytic tableaux and related methods, Springer, Berlin, 1999, pp. 36–51) respectively. (shrink)

This book offers a state-of-the-art introduction to the basic techniques and results of neighborhood semantics for modal logic. In addition to presenting the relevant technical background, it highlights both the pitfalls and potential uses of neighborhood models – an interesting class of mathematical structures that were originally introduced to provide a semantics for weak systems of modal logic. In addition, the book discusses a broad range of topics, including standard modal logic results ; bisimulations for neighborhood models and other model-theoretic (...) constructions; comparisons with other semantics for modal logic ; neighborhood semantics for first-order modal logic, applications in game theory ; applications in epistemic logic ; and non-normal modal logics with dynamic modalities. The book can be used as the primary text for seminars on philosophical logic focused on non-normal modal logics; as a supplemental text for courses on modal logic, logic in AI, or philosophical logic ; or as the primary source for researchers interested in learning about the uses of neighborhood semantics in philosophical logic and game theory. (shrink)

This paper gives a simple method for providing categorial brands of feature-based unification grammars with a model-theoretic semantics. The key idea is to apply the paradigm of fibred semantics (or layered logics, see Gabbay (1990)) in order to combine the two components of a feature-based grammar logic. We demonstrate the method for the augmentation of Lambek categorial grammar with Kasper/Rounds-style feature logic. These are combined by replacing (or annotating) atomic formulas of the first logic, i.e. the basic syntactic types, by (...) formulas of the second. Modelling such a combined logic is less trivial than one might expect. The direct application of the fibred semantics method where a combined atomic formula like np (num: sg & pers: 3rd) denotes those strings which have the indicated property and the categorial operators denote the usual left- and right-residuals of these string sets, does not match the intuitive, unification-based proof theory. Unification implements a global bookkeeping with respect to a proof whereas the direct fibring method restricts its view to the atoms of the grammar logic. The solution is to interpret the (embedded) feature terms as global feature constraints while maintaining the same kind of fibred structures. For this adjusted semantics, the anticipated proof system is sound and complete. (shrink)

We investigate extensions of dependence logic with generalized quantifiers. We also introduce and investigate the notion of a generalized atom. We define a system of semantics that can accommodate variants of dependence logic, possibly extended with generalized quantifiers and generalized atoms, under the same umbrella framework. The semantics is based on pairs of teams, or double teams. We also devise a game-theoretic semantics equivalent to the double team semantics. We make use of the double team semantics by defining a (...) logic $$\hbox {DC}^2$$ DC 2 which canonically fuses together two-variable dependence logic $$\hbox {D}^2$$ D 2 and two-variable logic with counting quantifiers $$\hbox {FOC}^2$$ FOC 2 . We establish that the satisfiability and finite satisfiability problems of $$\hbox {DC}^2$$ DC 2 are complete for $$\hbox {NEXPTIME}$$ NEXPTIME. (shrink)

In "A Problem in Possible-World Semantics," David Kaplan presented a consistent and intelligible modal principle that cannot be validated by any possible world frame (in the terminology of modal logic, any neighborhood frame). However, Kaplan's problem is tempered by the fact that his principle is stated in a language with propositional quantification, so possible world semantics for the basic modal language without propositional quantifiers is not directly affected, and the fact that on careful inspection his principle does not target the (...) world part of possible world semantics—the atomicity of the algebra of propositions—but rather the idea of propositional quantification over a complete Boolean algebra of propositions. By contrast, in this paper we present a simple and intelligible modal principle, without propositional quantifiers, that cannot be validated by any possible world frame precisely because of their assumption of atomicity (i.e., the principle also cannot be validated by any atomic Boolean algebra expansion). It follows from a theorem of David Lewis that our logic is as simple as possible in terms of modal nesting depth (two). We prove the consistency of the logic using a generalization of possible world semantics known as possibility semantics. We also prove the completeness of the logic (and two other relevant logics) with respect to possibility semantics. Finally, we observe that the logic we identify naturally arises in the study of Peano Arithmetic. (shrink)

This paper spells out the positive theory sketched at the end of "Against Stepping Back".): According to deflationists, [p] is true is in some sense equivalent to p. The problem that the semantic paradoxes pose for the deflationist is to explicate this equivalence without relying on a semantics grounded in the sort of real reference relations that a deflationist thinks do not exist. More generally, the deflationist is challenged to give an account of logical validity that does not force (...) us to countenance such relations. (The usual model-theoretic definition seems to presuppose that there is some special interpretation, the intended interpretation, such that truth simpliciter is truth on that intended interpretation. So if the deflationist adopts this sort of definition, the deflationist will be challenged to identify the intended interpretation without positing real reference relations.) Fortunately, a precise semantics compatible with the deflationist philosophy can be had as follows: First, we define a context as a certain sort of set constructed from a basis of literals (atomic sentences and negations of atomic sentences). This formal account of contexts has to be supplemented with an account of the conditions under which a structure satisfying the formal definition is the structure of that kind pertinent ot a given conversation. For each syntactic type of sentence, we define the conditions under which a sentence of that type is assertible relative to a context. In particular, we define the conditions under which sentences of the form " [p] is true" are assertible in a context, and we define the conditions under which sentences of the form "[p] is assertible in context G" are assertible in a context. Finally, logical validity is defined as preservation of assertibility in a context. It is demonstrated that this approach to semantics resists the semantic paradoxes. (shrink)

Expressivism - the sophisticated contemporary incarnation of the noncognitivist research program of Ayer, Stevenson, and Hare - is no longer the province of metaethicists alone. Its comprehensive view about the nature of both normative language and normative thought has also recently been applied to many topics elsewhere in philosophy - including logic, probability, mental and linguistic content, knowledge, epistemic modals, belief, the a priori, and even quantifiers. Yet the semantic commitments of expressivism are still poorly understood and have not (...) been very far developed. As argued within, expressivists have not yet even managed to solve the "negation problem" - to explain why atomic normative sentences are inconsistent with their negations. As a result, it is far from clear that expressivism even could be true, let alone whether it is. Being For seeks to evaluate the semantic commitments of expressivism, by showing how an expressivist semantics would work, what it can do, and what kind of assumptions would be required, in order for it to do it. Building on a highly general understanding of the basic ideas of expressivism, it argues that expressivists can solve the negation problem - but only in one kind of way. It shows how this insight paves the way for an explanatorily powerful, constructive expressivist semantics, which solves many of what have been taken to be the deepest problems for expressivism. But it also argues that no account with these advantages can be generalized to deal with constructions like tense, modals, or binary quantifiers. Expressivism, the book argues, is coherent and interesting, but false. (shrink)

In the present paper, we start studying epistemic updates using the standard toolkit of duality theory. We focus on public announcements, which are the simplest epistemic actions, and hence on Public Announcement Logic without the common knowledge operator. As is well known, the epistemic action of publicly announcing a given proposition is semantically represented as a transformation of the model encoding the current epistemic setup of the given agents; the given current model being replaced with its submodel relativized to the (...) announced proposition. We dually characterize the associated submodel-injection map as a certain pseudo-quotient map between the complex algebras respectively associated with the given model and with its relativized submodel. As is well known, these complex algebras are complete atomic BAOs . The dual characterization we provide naturally generalizes to much wider classes of algebras, which include, but are not limited to, arbitrary BAOs and arbitrary modal expansions of Heyting algebras . Thanks to this construction, the benefits and the wider scope of applications given by a point-free, intuitionistic theory of epistemic updates are made available. As an application of this dual characterization, we axiomatize the intuitionistic analogue of PAL, which we refer to as IPAL, prove soundness and completeness of IPAL w.r.t. both algebraic and relational models, and show that the well known Muddy Children Puzzle can be formalized in IPAL. (shrink)

When it comes to Kripke-style semantics for quantified modal logic, there’s a choice to be made concerning the interpretation of the quantifiers. The simple approach is to let quantifiers range over all possible objects, not just objects existing in the world of evaluation, and use a special predicate to make claims about existence. This is the constant domain approach. The more complicated approach is to assign a domain of objects to each world. This is the varying domain approach. Assuming that (...) all terms denote, the semantics of predication on the constant domain approach is obvious: either the denoted object has the denoted property in the world of evaluation, or it hasn’t. On the varying domain approach, there’s a third possibility: the object in question doesn’t exist. Terms may denote objects not included in the domain of the world of evaluation. The question is whether an atomic formula then should be evaluated as true or false, or if its truth value should be undefined. This question, however, cannot be answered in isolation. The consequences of one’s choice depends on the interpretation of molecular formulas. Should the negation of a formula whose truth value is undefined also be undefined? What about conjunction, universal quantification and necessitation? The main contribution of this paper is to identify two partial semantics for logical operators, a weak and a strong one, which uniquely satisfy a list of reasonable constraints. I also show that, provided that the point of using varying domains is to be able to make certain true claims about existence without using any existence predicate, this result yields two possible partial semantics for quantified modal logic with varying domains. (shrink)

I here propose a hitherto unnoticed possibility of solving embedding problems for noncognitivist expressivists in metaethics by appeal to Conceptual Role Semantics. I show that claims from the latter as to what constitutes various concepts can be used to define functions from states expressed by atomic sentences to states expressed by complex sentences, thereby allowing an expressivist semantics that satisfies a rather strict compositionality constraint. The proposal can be coupled with several different types of concept individuation claim, and is shown (...) to pave the way to novel accounts for, e.g., negation. (shrink)

Proof-theoretic semantics (P-tS) is the paradigm of semantics in which meaning in logic is based on proof (as opposed to truth). A particular instance of P-tS for intuitionistic propositional logic (IPL) is its base-extension semantics (B-eS). This semantics is given by a relation called support, explaining the meaning of the logical constants, which is parameterized by systems of rules called bases that provide the semantics of atomic propositions. In this paper, we interpret bases as collections of definite formulae and use (...) the operational view of them as provided by uniform proof-search—the proof-theoretic foundation of logic programming (LP)—to establish the completeness of IPL for the B-eS. This perspective allows negation, a subtle issue in P-tS, to be understood in terms of the negation-as-failure protocol in LP. Specifically, while the denial of a proposition is traditionally understood as the assertion of its negation, in B-eS we may understand the denial of a proposition as the failure to find a proof of it. In this way, assertion and denial are both prime concepts in P-tS. (shrink)

This extended investigation of the semantics of event (and state) sentences in their various forms is a major contribution to the semantics of natural language, simultaneously encompassing important issues in linguistics, philosophy, and logic. It develops the view that the logical forms of simple English sentences typically contain quantification over events or states and shows how this view can account for a wide variety of semantic phenomena. Focusing on the structure of meaning in English sentences at a &"subatomic&" level&-that (...) is, a level below the one most theories accept as basic or &"atomic&"&-Parsons asserts that the semantics of simple English sentences require logical forms somewhat more complex than is normally assumed in natural language semantics. His articulation of underlying event theory explains a wide variety of apparently diverse semantic characteristics of natural language, and his development of the theory shows the importance of seeing the distinction between events and states. Parsons demonstrates that verbs, also, indicate kinds of actions rather than specific, individual actions. Verb phrases, too, he argues, depend on modifiers to make their function and meaning in a sentence specific. An appendix gives many of the details needed to formalize the theory discussed in the body of the text and provides a series of templates that permit the generation of atomic formulas of English. (shrink)

In _The Philosophy of Logical Atomism_, Russell defends a version of semantic empiricism according to which direct acquaintance with logical atoms is the source of our semantic capacities. Previous commentators have construed Russellian acquaintance in one of two ways: either as an act of _de re_ designation involving neither conceptualization nor propositional content, or as a species of belief _de re_, which does involve conceptualization or classification. I argue that two further, interim possibilities have been overlooked: that (...) direct acquaintance involves purely phenomenal content or that direct acquaintance involves protoconceptual content. I conclude, however, that on none of the four interpretations considered, can direct acquaintance with logical atoms be the source of our semantic capacities. (shrink)

info:eu-repo/semantics/publishedVersion.

We propose an approach to natural language inference based on a model of natural logic, which identifies valid inferences by their lexical and syntactic features, without full semantic interpretation. We greatly extend past work in natural logic, which has focused solely on semantic containment and monotonicity, to incorporate both semantic exclusion and implicativity. Our system decomposes an inference problem into a sequence of atomic edits linking premise to hypothesis; predicts a lexical entailment relation for each edit using (...) a statistical classifier; propagates these relations upward through a syntax tree according to semantic properties of intermediate nodes; and composes the resulting entailment relations across the edit sequence. We evaluate our system on the FraCaS test suite, and achieve a 27% reduction in error from previous work. We also show that hybridizing an existing RTE system with our natural logic system yields significant gains on the RTE3 test suite. (shrink)

The paper argues that two distinct and independent notions of plurality are involved in natural language anaphora and quantification: plural reference (the usual non-atomic individuals) and plural discourse reference, i.e., reference to a quantificational dependency between sets of objects (e.g., atomic/non-atomic individuals) that is established and subsequently elaborated upon in discourse. Following van den Berg (PhD dissertation, University of Amsterdam, 1996), plural discourse reference is modeled as plural information states (i.e., as sets of variable assignments) in a new dynamic system (...) couched in classical type logic that extends Compositional DRT (Muskens, Linguistics and Philosophy, 19, 143-186, 1996). Given the underlying type logic, compositionality at sub-clausal level follows automatically and standard techniques from Montague semantics become available. The idea that plural info states are semantically necessary (in addition to non-atomic individuals) is motivated by relative-clause donkey sentences with multiple instances of singular donkey anaphora that have mixed (weak and strong) readings. At the same time, allowing for non-atomic individuals in addition to plural info states enables us to capture the intuitive parallels between singular and plural (donkey) anaphora, while deriving the incompatibility between singular (donkey) anaphora and collective predicates. The system also accounts for empirically unrelated phenomena, e.g., the uniqueness effects associated with singular (donkey) anaphora discussed in Kadmon (Linguistics and Philosophy, 13, 273-324, 1990) and Heim (Linguistics and Philosophy, 13, 131-177, 1990) among others. (shrink)

Intuitionistic sentential logic is shown to be sound and complete with respect to a semantics centered around extensions of atomic bases (i.e. sets of inference rules for atomic sentences). The result is made possible through a non-standard interpretation of disjunction, whereby, roughly speaking, a disjunction is taken to hold just in case every atomic sentence that follows from each of the disjuncts separately holds; it is argued that this interpretation makes good sense provided that rules in atomic bases are conceived (...) of as being accepted hypothetically rather than categorically. (shrink)

Prawitz conjectured that proof-theoretic validity offers a semantics for intuitionistic logic. This conjecture has recently been proven false by Piecha and Schroeder-Heister. This article resolves one of the questions left open by this recent result by showing the extensional alignment of proof-theoretic validity and general inquisitive logic. General inquisitive logic is a generalisation of inquisitive semantics, a uniform semantics for questions and assertions. The paper further defines a notion of quasi-proof-theoretic validity by restricting proof-theoretic validity to allow double negation elimination (...) for atomic formulas and proves the extensional alignment of quasi-proof-theoretic validity and inquisitive logic. (shrink)

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

In proof-theoretic semantics, model-theoretic validity is replaced by proof-theoretic validity. Validity of formulae is defined inductively from a base giving the validity of atoms using inductive clauses derived from proof-theoretic rules. A key aim is to show completeness of the proof rules without any requirement for formal models. Establishing this for propositional intuitionistic logic raises some technical and conceptual issues. We relate Sandqvist’s (complete) base-extension semantics of intuitionistic propositional logic to categorical proof theory in presheaves, reconstructing categorically the soundness (...) and completeness arguments, thereby demonstrating the naturality of Sandqvist’s constructions. This naturality includes Sandqvist’s treatment of disjunction that is based on its second-order or elimination-rule presentation. These constructions embody not just validity, but certain forms of objects of justifications. This analysis is taken a step further by showing that from the perspective of validity, Sandqvist’s semantics can also be viewed as the natural disjunction in a category of sheaves. (shrink)

The paper presents an alternative substitutional semantics for first-order modal logic which, in contrast to traditional substitutional (or truth-value) semantics, allows for a fine-grained explanation of the semantical behavior of the terms from which atomic formulae are composed. In contrast to denotational semantics, which is inherently reference-guided, this semantics supports a non-referential conception of modal truth and does not give rise to the problems which pertain to the philosophical interpretation of objectual domains (concerning, e.g., possibilia or trans-world identity). The paper (...) also proposes the notion of modality de nomine as an alternative to the denotational notion of modality de re. (shrink)

Causal Modeling Semantics (CMS, e.g., Galles and Pearl 1998; Pearl 2000; Halpern 2000) is a powerful framework for evaluating counterfactuals whose antecedent is a conjunction of atomic formulas. We extend CMS to an evaluation of the probability of counterfactuals with disjunctive antecedents, and more generally, to counterfactuals whose antecedent is an arbitrary Boolean combination of atomic formulas. Our main idea is to assign a probability to a counterfactual (A ∨ B) € C at a causal model M as a weighted (...) average of the probability of C in those submodels that truthmake A ∨ B (Briggs 2012; Fine 2016, 2017). The weights of the submodels are given by the inverse distance to the original model M, based on a distance metric proposed by Eva, Stern, and Hartmann (2019). Apart from solving a major problem in the epistemology of counterfactuals, our paper shows how work in semantics, causal inference and formal epistemology can be fruitfully combined. (shrink)

This paper presents an approach to the elementary temporal semantics of the English tense system, the atoms of which are the present tense, the past tense, the progressive auxiliary, the perfective auxiliary, and the modal will as used for the future. It offers accounts of the forms of temporal semantics of core verb phrases of different categories and of the atoms of the tense system, using machinery that that yields appropriate compositional accounts of the temporal semantics of compound, (...) tensed verb phrases. This machinery also yields a novel account of the Kenny-Vendler classification of core verb phrases. (shrink)

info:eu-repo/semantics/publishedVersion.

One of the major arenas for debate within generative grammar is the nature of paradigmatic relations among words. Intervening in key debates at the interface between syntax and semantics, this book examines the relation between structure and meaning, and analyses how it affects the internal properties of words and corresponding syntactic manifestations. Adapting notions from the Evo-Devo project in biology (the idea of 'co-linearity' between structural units and behavioural manifestations) Juan Uriagereka addresses a major puzzle: how words can be both (...) decomposable so as to be acquired by children, and atomic, so that they do not manifest themselves as modular to adults. (shrink)

Se presenta un esquema ontológico en el que el par relacional/atómico desempeña un papel central. La noción basica, la que se define en terminos positivos, es la de “relacionalidad”. La atomicidad es definida negativamente, como no-relacionalidad. En realidad, se distinguen diversas nociones positivas, emparentadas entre sí, que pueden verse como diferentes formas de relacionalidad a las que corresponden diferentes formas de atomicidad (o no-relacionalidad). A continuación, ese instrumental ontológico se aplica al planteamiento de dos cuestiones semánticas: se trata brevemente la (...) cuestión deI individualismo y, más en detalle, la cuestión deI holismo semántico.An ontological framework is presented in which the relational/atomic pair plays a central role. The basic notion, which is defined in positive terms, is that of “relationality”. “Atomicity” is negatively defined as non-relationality. More exactly, we distinguish between several related positive notions that can be seen as different kinds of relationality. Correspondingly, we distinguish between several kinds of atomicity (or nonrelationality). Then, the ontological tools are applied to two semantic issues: we briefly deal with the individualism issue and in more detail with the issue of semantic holism. (shrink)

This article provides an introduction to Kaplan-style semantics. The formal semantics usually employs the notion of a model, which, besides supplying the sets utterance contexts, circumstances and a domain M 0 of individuals, and also interprets the nonlogical atomic expressions of the language. Standard compositionality applies only to character: Funct makes immediate sense, since character assigns a semantic value directly to expressions. For semantic functions taking contextual arguments, the notion of compositionality must be revised. Notions of contextual compositionality (...) apply directly to the functional version of the setup that starts with the function char, and defines the other semantics from it. The point of evaluation semantics is indeed basic: if it is compositional, so is the content semantics, and the character semantics. (shrink)

Suppose we want to take seriously the neoverificationist idea that an intuitionistic theory of meaning can be generalized in such a way as to be applicable not only to mathematical but also to empirical sentences. The paper explores some consequences of this attitude and takes some steps towards the realization of this program. The general idea is to develop a meaning theory, and consequently a formal semantics, based on the idea that knowing the meaning of a sentence is tantamount to (...) having a criterion for establishing what is a justification for it. Section 1 motivates a requirement of epistemic transparency imposed onto justifications conceived as mental states. In Section 2, the formal notion of justification for an atomic formula is defined, in terms of the notion of cognitive state. In Section 3, the definition is extended to logically complex formulas. In Section 4, the notion of truth-ground is introduced and is used to give a definition of logical validity. (shrink)

The mass/count distinction attracts a lot of attention among cognitive scientists, possibly because it involves in fundamental ways the relation between language (i.e. grammar), thought (i.e. extralinguistic conceptual systems) and reality (i.e. the physical world). In the present paper, I explore the view that the mass/count distinction is a matter of vagueness. While every noun/concept may in a sense be vague, mass nouns/concepts are vague in a way that systematically impairs their use in counting. This idea has never been systematically (...) pursued, to the best of my knowledge. I make it precise relying on supervaluations (more specifically, ‘data semantics’) to model it. I identify a number of universals pertaining to how the mass/count contrast is encoded in the languages of the world, along with some of the major dimensions along which languages may vary on this score. I argue that the vagueness based model developed here provides a useful perspective on both. The outcome (besides shedding light on semantic variation) seems to suggest that vagueness is not just an interface phenomenon that arises in the interaction of Universal Grammar (UG) with the Conceptual/Intentional System (to adopt Chomsky’s terminology), but it is actually part of the architecture of UG. (shrink)

The goal of the paper is to develop a universal semantic approach to derivable rules of propositional multiple-conclusion sequent calculi with structural rules, which explicitly involve not only atomic formulas, treated as metavariables for formulas, but also formula set variables, upon the basis of the conception of model introduced in :27–37, 2001). One of the main results of the paper is that any regular sequent calculus with structural rules has such class of sequent models that a rule is derivable (...) in the calculus iff it is sound with respect to each model of the semantics. We then show how semantics of admissible rules of such calculi can be found with using a method of free models. Next, our universal approach is applied to sequent calculi for many-valued logics with equality determinant. Finally, we exemplify this application by studying sequent calculi for some of such logics. (shrink)

The paper studies Heyting algebras within the framework of computable structure theory. We prove that the class _K_ containing all Heyting algebras with distinguished atoms and coatoms is complete in the sense of the work of Hirschfeldt et al. (Ann Pure Appl Logic 115(1-3):71-113, 2002). This shows that the class _K_ is rich from the computability-theoretic point of view: for example, every possible degree spectrum can be realized by a countable structure from _K_. In addition, there is no simple (...) syntactic characterization of computably categorical members of _K_ (i.e., structures from _K_ possessing a unique computable copy, up to computable isomorphisms). (shrink)

Fine (J Philos Logic 46(6):625–674, 2017) develops a unilateral and a bilateral truthmaker semantics for propositional logic. The unilateral approach trades off the primitive exact falsification relation of the bilateral approach for a primitive exclusion relation between states, thereby raising the question if exclusion serves any purpose other than to avoid exact falsification. We argue that exclusion is motivated independently of its use in avoiding exact falsification, namely as a foundation for the reconstruction of modal notions such as possibility and (...) necessity. This reconstruction in turn motivates what we call _emergent exclusion_: an atomic state can exclude a sum of atomic states collectively without excluding any of these atomic states individually. Emergent exclusion is banned in Fine (2017a) in order to maintain exact equivalence in de Morgan’s law \(\lnot (P \wedge Q) \Leftrightarrow \lnot P \vee \lnot Q\) ; we argue that the two sides of this law are not exactly equivalent and discuss a variety of state spaces that feature emergent exclusion. This paper aims to be accessible to linguists without prior exposure to truthmaker semantics. We highlight points of contact with natural language semantics, such as event semantics and algebraic semantics of plurals and conjunction. (shrink)

First we have individual variables, as usual in first-order logics. (We do not have individual constants, but this is a minor point.) The propositional logic LP has justification constants, but in FOLP these are generalized to allow individual variables as arguments. Thus we have as justification constants c, c(x), c(x, y), . . . . Similarly LP has justification variables, but in FOLP these can be parametrized with individual variables p, p(x), p(x, y), . . . . To keep terminology (...) in line with past papers, we will still refer to things as justification constants and justification variables, even though they have structure to them. As in LP, justification terms are built up from justification constants and justification variables using ·, +, ! as usual. In addition there is a new constructor, genx, introduced by Artemov, and there is one further new constructor, exsx, introduced in this paper. If t is a justification term and x is an individual variable, genxt and exsxt are justification terms. An individual variable x is free in a justification term unless it is bound by genx or exsx. More specifically, the free variables of p(x, y, . . .) and of c(x, y, . . .) are {x, y, . . .}, the free variables of s · t and of s + t are the free variables of s together with the free variables of t, the free variables of !s are the free variables of s, and the free variables of genxt and of exsxt are the free variables of t except for x. Formulas are built up from atomic formulas, including ⊥, in the way standard in first-order logic, together with the additional formation rule: t:X is a formula provided t is a justification term, X is a formula, and all free variables of X occur in t. We assume ⊃, ⊥, and ∀ are basic, with other connectives and quantifier defined. The axiomatization used here is a combination of an LP axiomatization and a standard axiomatization of first-order logic, together with a version of the Barcan formula, and one additional axiom that corresponds to the converse Barcan formula.. (shrink)

Proof-theoretic semantics (P-tS) is an innovative approach to grounding logical meaning in terms of proofs rather than traditional truth-conditional semantics. The point is not that one provides a proof system, but rather that one articulates meaning in terms of proofs and provability. To elucidate this paradigm shift, we commence with an introduction that contrasts the fundamental tenets of P-tS with the more prevalent model-theoretic approach to semantics. The contribution of this paper is a P-tS for a substructural logic, intuitionistic multiplicative (...) linear logic (IMLL). Specifically, we meticulously examine and refine the established P-tS for intuitionistic propositional logic. Subsequently, we present two novel and comprehensive forms of P-tS for IMLL. Notably, the semantics for IMLL in this paper embodies its resource interpretation through its number-of-uses reading (restricted to atoms). This stands in contrast to the conventional model-theoretic semantics of the logic, underscoring the value that P-tS brings to substructural logics. (shrink)

In a previous paper we investigated the extraction of proof-theoretic properties of natural deduction derivations from their impredicative translation into System F. Our key idea was to introduce an extended equational theory for System F codifying at a syntactic level some properties found in parametric models of polymorphic type theory. A different approach to extract proof-theoretic properties of natural deduction derivations was proposed in a recent series of papers on the basis of an embedding of intuitionistic propositional logic into a (...) predicative fragment of System F, called atomic System F. In this paper we show that this approach finds a general explanation within our equational study of second-order natural deduction, and a clear semantic justification in terms of parametricity. (shrink)

This article focuses on the relevance of computational complexity for cognition. The syntactic items may be expressions that are surface strings. But in general, strings are syntactically ambiguous in that they can be generated in more than one way from atomic expressions and operations. The semantic function must take disambiguated items as arguments. When expressions are ambiguous, expressions cannot be the arguments. Instead, it is common to take the arguments to be terms, whose surface syntax reflects the derivation of (...) the string. The semantic function differs in one other important respect from an arithmetic function, since it maps entities between domains, from a syntactic to an ontic or conceptual domain of meanings. Compositionality helps to explain the rate of success in linguistic communication when the sentence used or the content communicated is new. (shrink)