'Mass terms', words like water, rice and traffic, have proved very difficult to accommodate in any theory of meaning since, unlike count nouns such as house or dog, they cannot be viewed as part of a logical set and differ in their grammatical properties. In this study, motivated by the need to design a computer program for understanding natural language utterances incorporating mass terms, Harry Bunt provides a thorough analysis of the problem and offers an original and detailed solution. An (...) extension of classical set theory, Ensemble Theory, is defined, and this provides the conceptual basis of a framework for the analysis of natural language meaning which Dr Bunt calls Two-level model-theoretic semantics. The validity of the framework is convincingly demonstrated by the formal analysis of a fragment of English including sentences with quantified and modified mass terms. Separate chapters of the book are devoted to an axiomatic definition of Ensemble Theory and a detailed discussion of its status as a mathematical formalism. (shrink)

Revenge arguments purport to show that any proposed solution to the semantic paradoxes generates new paradoxes that prove that solution to be inadequate. In this paper, I focus on revenge arguments that employ the model-theoretic semantics of a target theory and I argue, contra the current revenge-theoretic wisdom, that they can constitute genuine expressive limitations. I consider the anti-revenge strategy elaborated by Field and argue that it does not offer a way out of the revenge problem. (...) More generally, I argue that the difference between ‘standard’ and ‘revenge’ paradoxes is ill-conceived and should be abandoned. This will contribute to show that the theories that provide a uniform account of truth and other semantic notions are the ones best equipped to avoid the paradoxes altogether—‘standard’ and ‘revenge’ alike. (shrink)

In the early days of natural language semantics, Donald Davidson issued a challenge to those, like Richard Montague, who would do semantics in a model-theoretic framework that gives a central role to a model-relative notion of truth. Davidson argued that no theory of this kind can claim to be an account of real truth conditions unless it first makes clear how the relativized notion relates to our ordinary non-relativized notion of truth. In the 1990s, Davidson’s (...) challenge was developed by Etchemendy into an argument against the model-theoretic account of logical consequence, one that also threatens the attempt to capture natural language entailment relations in modeltheoretic terms—one of the central desiderata of semantics. Nevertheless, the modeltheoretic framework has flourished within natural language semantics. But it has flourished without any consensus among semanticists as to how to answer Davidson’s challenge. The aim of this essay is to develop an answer. I argue that model-theoretic semantics is best understood as model-based science: a semantics for a natural language is a scientific model of truth conditions. This makes good sense of the way model-theoretic tools are used in natural language semantics. And it allows us to answer Davidson’s challenge by showing how a theory that employs a relativized notion of truth manages to tell us about ordinary truth conditions. Moreover, I argue that it helps us see how semantics can provide genuine explanations for natural language entailment and other truth-conditional phenomena. (shrink)

[...] I will only investigate [Austin's] claims as challenges to present-day model theoretic semantics. My main point will be to draw a sharp line between the semantic and pragmatic aspects of performatives and thereby discover a gap in Austin’s treatment. This will in my view naturally lead to the proposal in Section 2, that is, to treating performatives as denoting changes in intensional models. The rest of Section 2 will be concerned with the status of felicity conditions (...) and a tentative extension of Montague’s PTQ. (shrink)

This contribution is concerned with a particular model theoretic semantics of the object language of quantum physics. The object language considered here comprises logically connected propositions, sequentially connected propositions and modal propositions. The model theoretic semantics arises from the already established dialogic semantics, if the pragmatic concept of the dialog-game is replaced by a "metaphysical" concept of the game. The game is determined by a game tree, the branches of which constitute a set, (...) the set of "possible worlds" of an individual quantum physical system. The semantic concepts like truth, falsity and valuation are defined with respect to this set. (shrink)

Based on an idea of Ajdukiewiu, a method of equifunctionality is developed to provide a formal explication of the notion of sameness of use relative to some system of rules. Given this, a set‐theoretic explication of Lauener's context dependent conception of synonymy is introduced by looking at languages of ropositional logic, and compared both with Ajdukiewicz's original conception and with Carnap's explication of synonymy based on his method of extension and intention.

What do the rules of logic say about the meanings of the symbols they govern? In this book, James W. Garson examines the inferential behaviour of logical connectives, whose behaviour is defined by strict rules, and proves definitive results concerning exactly what those rules express about connective truth conditions. He explores the ways in which, depending on circumstances, a system of rules may provide no interpretation of a connective at all, or the interpretation we ordinarily expect for it, or an (...) unfamiliar or novel interpretation. He also shows how the novel interpretations thus generated may be used to help analyse philosophical problems such as vagueness and the open future. His book will be valuable for graduates and specialists in logic, philosophy of logic, and philosophy of language. (shrink)

This paper introduces three model-theoretic constructions for generalized Epstein semantics: reducts, ultramodels and $\textsf {S}$ -sets. We apply these notions to obtain metatheoretical results. We prove connective inexpressibility by means of a reduct, compactness by an ultramodel and definability theorem which states that a set of generalized Epstein models is definable iff it is closed under ultramodels and $\textsf {S}$ -sets. Furthermore, a corollary concerning definability of a set of models by a single formula is given on (...) the basis of the main theorem and the compactness theorem. We also provide an example of a natural set of generalized Epstein models which is undefinable. Its undefinability is proven by means of an $\textsf {S}$ -set. (shrink)

The semantic view of theoriesis one according to which theoriesare construed as models of their linguisticformulations. The implications of thisview for scientific realism have been little discussed. Contraryto the suggestion of various champions of the semantic view,it is argued that this approach does not makesupport for a plausible scientific realism anyless problematic than it might otherwise be.Though a degree of independence of theory fromlanguage may ensure safety frompitfalls associated with logical empiricism, realism cannot be entertained unless models or (abstractedand/or idealized) (...) aspects thereof are spelled out in terms of linguistic formulations (such as mathematical equations),which can be interpreted in terms of correspondencewith the world. The putative advantage of thesemantic approach – its linguistic independence – isthus of no help to the realist. I consider recent treatmentsof the model-theoretic view (Suppe, Giere, Smith), and find that although some of these accounts harbour the promiseof realism, this promise is deceptive. (shrink)

I show that words with indefinite implicit complements occasion a dilemma for their model theory. There has been only two previous attempts to address this problem, one by Fodor and Fodor (1980) and one by Dowty (1981). Each requires that any word tolerating an implicit complement be treated as ambiguous between two different lexical entries and that a meaning postulate or lexical rule be given to constrain suitably the meanings of the various entries for the word. I show that (...) the positing of such an ambiguity runs counter to the facts and propose an alternative solution which does not appeal to ambiguity, meaning postulates or lexical rules. Indeed, I show that the dilemma posed by indefinite implicit complements is posed by all implicit complements and that a general solution to the problem of implicit complements follows from an independently motivated, single treatment of five other problems, that of subcategorization, that of phrasal projections of words, that of defining a model theoretic structure for phrase structure grammars, that of complement polyvalence and that of complement polyadicity. (shrink)

The paper presents a proof-theoretic semantics (PTS) for a fragment of natural language, providing an alternative to the traditional model-theoretic (Montagovian) semantics (MTS), whereby meanings are truth-condition (in arbitrary models). Instead, meanings are taken as derivability-conditions in a dedicated natural-deduction (ND) proof-system. This semantics is effective (algorithmically decidable), adhering to the meaning as use paradigm, not suffering from several of the criticisms formulated by philosophers of language against MTS as a theory of meaning. In (...) particular, Dummett’s manifestation argument does not obtain, and assertions are always warranted, having grounds of assertion. The proof system is shown to satisfy Dummett’s harmony property, justifying the ND rules as meaning conferring. The semantics is suitable for incorporation into computational linguistics grammars, formulated in type-logical grammar. (shrink)

This paper introduces a compositional semantics of locativeprepositional phrases which is based on a vector space ontology.Model-theoretic properties of prepositions like monotonicity andconservativity are defined in this system in a straightforward way.These notions are shown to describe central inferences with spatialexpressions and to account for the grammaticality of prepositionmodification. Model-theoretic constraints on the set of possibleprepositions in natural language are specified, similar to the semanticuniversals of Generalized Quantifier Theory.

The paper briefly surveys the sentential proof-theoretic semantics for fragment of English. Then, appealing to a version of Frege’s context-principle (specified to fit type-logical grammar), a method is presented for deriving proof-theoretic meanings for sub-sentential phrases, down to lexical units (words). The sentential meaning is decomposed according to the function-argument structure as determined by the type-logical grammar. In doing so, the paper presents a novel proof-theoretic interpretation of simple type, replacing Montague’s model-theoretic type interpretation (...) (in arbitrary Henkin models). The domains of derivations are collections of derivations in the associated “dedicated” natural-deduction proof-system, and functions therein (with no appeal to models, truth-values and elements of a domain). The compositionality of the semantics is analyzed. (shrink)

Since 1976 Hilary Putnam has on many occasions proposed an argument, founded on some model-theoretic results, to the effect that any philosophical programme whose purpose is to naturalize semantics would fail to account for an important feature of every natural language, the determinacy of reference. Here, after having presented the argument, I will suggest that it does not work, because it simply assumes what it should prove, that is that we cannot extend the metatheory: Putnam appears to (...) think that all we may determinately say about the relations between words and entities in the world is what the model theory tells us, but he has never offered justifications for that. At the end of the article, I will discuss the apparently reliable intuition that seems to me to be at the root of the argument, that is that, given a formal theory, there is an infinite number of ways of connecting it to, or of projecting it onto, the world. I will suggest that we should resist this intuition, because it rests on a very doubtful notion of world, which assumes that for any class of objects there is a corresponding property. (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 proposes a semantic value for the logical constants (connectives and quantifiers) within the framework of proof-theoretic semantics, basic meaning on the introduction rules of a meaning conferring natural deduction proof system. The semantic value is defined based on Fregecontributions” to sentential meanings as determined by the function-argument structure as induced by a type-logical grammar. In doing so, the paper proposes a novel proof-theoretic interpretation of the semantic types, traditionally interpreted in Henkin models. The compositionality of (...) the resulting attribution of semantic values is discussed. Elsewhere, the same method was used for defining proof-theoretic meaning of subsentential phrases in a fragment of natural language. Doing the same for (the simpler and clearer case of) logic sheds more light on the proposal. (shrink)

The main aim of this work is to evaluate whether Boolos’ semantics for second-order languages is model-theoretically equivalent to standard model-theoretic semantics. Such an equivalence result is, actually, directly proved in the “Appendix”. I argue that Boolos’ intent in developing such a semantics is not to avoid set-theoretic notions in favor of pluralities. It is, rather, to prevent that predicates, in the sense of functions, refer to classes of classes. Boolos’ formal semantics (...) differs from a semantics of pluralities for Boolos’ plural reading of second-order quantifiers, for the notion of plurality is much more general, not only of that set, but also of class. In fact, by showing that a plurality is equivalent to sub-sets of a power set, the notion of plurality comes to suffer a loss of generality. Despite of this equivalence result, I maintain that Boolos’ formal semantics does not committ second-order languages to second-order entities, contrary to standard semantics. Further, such an equivalence result provides a rationale for many criticisms to Boolos’ formal semantics, in particular those by Resnik and Parsons against its alleged ontological innocence and on its Platonistic presupposition. The key set-theoretic notion involved in the equivalence proof is that of many-valued function. But, first, I will provide a clarification of the philosophical context and theoretical grounds of the genesis of Boolos’ formal semantics. (shrink)

Abstract A general framework is proposed for accommodating the recent results of studies into ?natural? decision making. A crucial element of this framework is the notion of a ?partial structure?, recently introduced into the semantic approach to scientific theories. It is through the introduction of this element that connections can be made with certain problems regarding inconsistency and rationality in general.

In this book Emma Ruttkamp demonstrates the power of the full-blown employment of the model-theoretic paradigm in the philosophy of science. Within this paradigm she gives an account of sciences as process and product. She expounds the "received statement" and the "non-statement" views of science, and shows how the model-theoretic approach resolves the spurious tension between these views. In this endeavour she also engages the views of a number of contemporary philosophers of science with affinity to (...) model theory. This text can be read by specialists working in philosophy of science or formal semantics, by logicians working on the structure of theories, and by students in philosophy of science - this text offers a thorough introduction to non-statement accounts of sciences as well as a discussion of the traditional statement account of science. (shrink)

The major argument against Ramsey-style epistemic structural realism is the model-theoretic refinement of Newman’s objection against Russell, presented in Ketland : 409–424, 2004), where a technical result is interpreted as showing that the Ramsey-sentence approach collapses into instrumentalism. This paper addresses some questions raised by the application of model theory to the scientific realism debate. Firstly, I will suggest three different formal semantics for the positions in the debate. Then, some technicalities of Ketland’s result will be (...) scrutinized in light of comments by Zahar and Demopoulos. Finally, I will formalize Ketland’s argument by means of an intensional operator and focus on one problematic premise. The conclusion is that, with some adjustments, the Ramsey-sentence approach can represent an intermediate position between realism and instrumentalism, but the term “structuralism” does not suit it well. (shrink)

ABSTRACT: Paper currently being revised.

A varietyV satisfies a strong Malcev condition ∃f1,…, ∃fnθ where θ is a conjunction of equations in the function variablesf1, …,fnand the individual variablesx1, …,xm, if there are polynomial symbolsp1, …,pnin the language ofVsuch that ∀x1, …,xmθ is a law ofV. Thus a strong Malcev condition involves restricted second order quantification of a strange sort. The quantification is restricted to functions which are “polynomially definable”. This notion was introduced by Malcev [6] who used it to describe those varieties all of (...) whose members have permutable congruence relations. The general formal definition of Malcev conditions is due to Grätzer [1]. Since then and especially since Jónsson's [3] characterization of varieties with distributive congruences there has been extensive study of strong Malcev conditions and the related concepts: Malcev conditions and weak Malcev conditions.In [9], Taylor gives necessary and sufficient semantic conditions for a class of varieties to be defined by a Malcev condition. A key to the proof is the translation of the restricted second order concepts into first order concepts in a certain many sorted language. In this paper we show that, given this translation, Taylor's theorem is an easy consequence of a result of Tarski [8] and the standard preservation theorems of first order logic. (shrink)

This chapter contains sections titled: Abstract The Model ‐ Theoretic Argument Difficulties and Differences Putnam's Progress Implications Objections and Replies References.

The 3-valued paraconsistent logic Ciore was developed by Carnielli, Marcos and de Amo under the name LFI2, in the study of inconsistent databases from the point of view of logics of formal inconsistency (LFIs). They also considered a first-order version of Ciore called LFI2*. The logic Ciore enjoys extreme features concerning propagation and retropropagation of the consistency operator: a formula is consistent if and only if some of its subformulas is consistent. In addition, Ciore is algebraizable in the sense of (...) Blok and Pigozzi. On the other hand, the logic LFI2* satisfies a somewhat counter-intuitive property: the universal and the existential quantifier are inter-definable by means of the paraconsistent negation, as it happens in classical first-order logic with respect to the classical negation. This feature seems to be unnatural, given that both quantifiers have the classical meaning in LFI2*, and that this logic does not satisfy the De Morgan laws with respect to its paraconsistent negation. The first goal of the present article is to introduce a first-order version of Ciore (which we call QCiore) preserving the spirit of Ciore, that is, without introducing unexpected relationships between the quantifiers. The second goal of the article is to adapt to QCiore the partial structures semantics for the first-order paraconsistent logic LPT1 introduced by Coniglio and Silvestrini, which generalizes the semantic notion of quasi-truth considered by Mikeberg, da Costa and Chuaqui. Finally, some important results of classical Model Theory are obtained for this logic, such as Robinson’s joint consistency theorem, amalgamation and interpolation. Although we focus on QCiore, this framework can be adapted to other 3-valued first-order LFIs. (shrink)

We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model- theoretic probabilistic reasoning and to default reasoning in System . In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of (...) default reasoning in System . That is, we provide a new probabilistic semantics for System , which neither uses infinitesimal probabilities nor atomic bound (or big-stepped) probabilities. These results also provide new algorithms for probabilistic reasoning under coherence and for default reasoning in System , and they give new insight into default reasoning with conditional objects. (shrink)

This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory. The field of proof-theoretic semantics has existed for (...) almost 50 years, but the term itself was proposed by Schroeder-Heister in the 1980s. Proof-theoretic semantics explains the meaning of linguistic expressions in general and of logical constants in particular in terms of the notion of proof. This volume emerges from presentations at the Second International Conference on Proof-Theoretic Semantics in Tübingen in 2013, where contributing authors were asked to provide a self-contained description and analysis of a significant research question in this area. The contributions are representative of the field and should be of interest to logicians, philosophers, and mathematicians alike. (shrink)

The paper introduces a proof-theoretic semantics for adjectival modification as an alternative to the traditional model-theoretic semantics basing meaning on truth-conditions. The paper considers the proof-theoretic meaning of modification by means of the three traditional adjective classes: intersective, subsective and privative. It does so by introducing a meaning-conferring natural-deduction proof system for such modification. The PTS theory of meaning is not polluted by ontological commitments, for example, a scale for beauty and a yardstick for (...) being beautiful. It only uses syntactic artefacts of the proof language. The paper also defines, by suitable rules, iterated modification, shedding light on the relationship between iteration and adjectival classes. Modification via coordinated adjectives is covered too. An appendix delineates briefly the main ingredients of PTS. (shrink)

Information theoretic semantics proposes to construe predicate reference in terms of nomological relations between distal properties and properties of representational mental events. Research on the model has largely concentrated on the problem of choosing the nomological relation in terms of which distal properties are to be singled out. I argue that, in addition to this, an information theoretic account has to provide a specification of which properties of representational mental events will play a role in determining (...) reference, qua bearers of nomological relations. I contend that this task poses a serious additional challenge to the viability of the model. (shrink)

The present paper studies the general implications of theprinciple of compositionality for the organization of grammar.It will be argued that Janssen''s (1986) requirement that syntax andsemantics be similar algebras is too strong, and that the moreliberal requirement that syntax be interpretable into semanticsleads to a formalization that can be motivated and applied more easily,while it avoids the complications that encumber Janssen''s formalization.Moreover, it will be shown that this alternative formalization evenallows one to further complete the formal theory of compositionality, inthat (...) it is capable of clarifying the role played by translation,model-theoretic interpretation and meaning postulates,of which the latter two aspects received little or no attention inMontague (1970) and Janssen (1986). (shrink)

Proof-theoretic semantics is an alternative to model-theoretic semantics. It aims at explaining the meaning of the logical constants in terms of the inference rules that govern their behaviour in proofs. We argue that this must be construed as the task of explaining these meanings relative to a logic, i.e., to a consequence relation. Alas, there is no agreed set of properties that a relation must have in order to qualify as a consequence relation. Moreover, the (...) association of a consequence relation to a logical calculus is not as straightforward as it may seem. We show that these facts are problematic for the proof-theoretic project but the problems can be solved. Our thesis is that the consequence relation relevant for proof-theoretic semantics is the one given by the sequent-to-sequent derivability relation in Gentzen systems. (shrink)