While monadic second-order logic (MSO) has played a prominent role in model theoretic syntax, modal logics have been used in this context since its inception. When comparing propositional dynamic logic (PDL) to MSO over trees, Kracht (1997) noted that there are tree languages that can be defined in MSO that can only be defined in PDL by adding new features whose distribution is predictable. He named such features “inessential features”. We show that Kracht’s observation can be extended (...) to other modal logics of trees in two ways. First, we demonstrate that for each stronger logic, there exists a tree language that can only be defined in a weaker logic with inessential features. Second, we show that any tree language that can be defined in a stronger logic, but not in some weaker logic, can be defined with inessential features. Additionally, we consider Kracht’s definition of inessential features more closely. It turns out that there are features whose distribution can be predicted, but who fail to be inessential in Kracht’s sense. We will look at ways to modify his definition. (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)

What is the mind? How does it work? How does it influence behavior? Some psychologists hope to answer such questions in terms of concepts drawn from computer science and artificial intelligence. They test their theories by modeling mental processes in computers. This book shows how computer models are used to study many psychological phenomena--including vision, language, reasoning, and learning. It also shows that computer modeling involves differing theoretical approaches. Computational psychologists disagree about some basic questions. For instance, should the mind (...) be modeled by digital computers, or by parallel-processing systems more like brains? Do computer programs consist of meaningless patterns, or do they embody (and explain) genuine meaning? (shrink)

This chapter focuses on the frameworks of Head‐Driven Phrase Structure Grammar (HPSG) as it developed from Generalized Phrase Structure Grammar (GPSG), and Lexical‐Functional Grammar (LFG). Declarative frameworks are not generative, as they do not ‘generate’ anything in the sense of the preceding paragraph. Pullum refers to that kind of approach as Generative‐Enumerative Syntax and differentiates it from Model‐Theoretic Syntax: GPSG, HPSG, and LFG essentially fall in the latter category. It describes some key aspects of declarative frameworks, (...) and the motivation for them. The chapter considers how declarative frameworks instantiate a view of Generative Grammar directly inspired by Noam Chomsky's early work, but without the procedural component. It presents some of the core design features which motivate declarative frameworks, and explores how syntactic phenomena are factorized and formalized in declarative frameworks, with a view to comparison with Minimalist Program analyses. (shrink)

An adequate semantics for generic sentences must stake out positions across a range of contested territory in philosophy and linguistics. For this reason the study of generic sentences is a venue for investigating different frameworks for understanding human rationality as manifested in linguistic phenomena such as quantification, classification of individuals under kinds, defeasible reasoning, and intensionality. Despite the wide variety of semantic theories developed for generic sentences, to date these theories have been almost universally model-theoretic and representational. This (...) essay outlines a range of proof-theoretic analyses for characterizing generics. Particular attention is given to an expressivist proof-theory that can be traced to 1) work on logical syntax that Carnap undertook prior to his turn toward truth-conditional model theory in the late 1930s, and 2) research on sequent calculi and natural deduction systems that originate in work from Gentzen and Prawitz.11 This essay offers a more precise exposition of some of the material discussed in the first two chapters of my dissertation (Stovall Citation2015a). These ideas developed in the context of a working group on non-monotonic logic run by Robert Brandom, and they were subsequently clarified through the work of Nissim Francez (particularly Francez Citation2015). I am indebted to many people for feedback and criticism on this essay, though I am sure none among them would agree with everything I say and do here. I would particularly like to thank Brandom, Francez, Ulf Hlobil, Daniel Kaplan, Jared Millson, Bernhard Nickel, Jaroslav Peregrin, Jeffry Pelletier, Thomas Ricketts, Mark Risjord, Shawn Standefer, and two reviewers for this journal. Work on this essay was supported by the joint Lead-Agency research grant between the Austrian Science Foundation (FWF) and the Czech Science Foundation (GAČR), Inferentialism and Collective Intentionality, GF17-33808L. It was substantially revised prior to its final submission. (shrink)

In this paper, I address the issue of scientific modelling in contemporary linguistics, focusing on the generative tradition. In so doing, I identify two common varieties of linguistic idealisation, which I call determination and isolation respectively. I argue that these distinct types of idealisation can both be described within the remit of Weisberg’s :639–659, 2007) minimalist idealisation strategy in the sciences. Following a line set by Blutner :27–35, 2011), I propose this minimalist idealisation analysis for a broad construal of the (...) generative linguistic programme and thus cite examples from a wide range of linguistic frameworks including early generative syntax, Minimalism, the parallel architecture and optimality theory. Lastly, I claim that from a modelling perspective, the dynamic turn in syntax can be explained as a continuation, as opposed to a marked shift, of the generative modelling paradigm. Seen in this light, my proposal is an even broader construal of the generative tradition, along scientific modelling lines. Thus, I offer a lens through which to appreciate the scientific contribution of generative grammar, amid an increased resistance to some of its core theoretical posits, in terms of a brand of structural realism in the philosophy of science and specifically scientific modelling. (shrink)

Split constructions are widespread in natural languages. The separation of the semantic restriction of a quantifier from that quantifier is a typical example of such a construction. This study addresses the problem that such discontinuous strings exhibit--namely, a number of locality constraints, including intervention effects. These are shown to follow from the interaction of a minimalist syntax with a semantics that directly assigns a model-theoretic interpretation to syntactic logical forms. The approach is shown to have wide empirical (...) coverage and a conceptual simplicity. The book will be of interest to scholars and advanced students of syntax and semantics. (shrink)

In this paper, we shall present a generalization of phrase structure grammar, in which all functional categories have type restrictions, that is, their argument types are specific domains. In ordinary phrase structure grammar, there is just one universal domain of individuals. The grammar does not make a distinction between verbs and adjectives in terms of domains of applicability. Consequently, it fails to distinguish between sentences like every line intersects every line, which is well typed, and every line intersects every point, (...) which is ill typed.Our generalization relates to ordinary phrase structure grammar in the same way as the higherlevel constructive type theory of Martin-Löf relates to the simple type theory of Church . Simple type theory has been used in linguistics and related with phrase structure grammar, especially in the tradition based on the work of Montague .Our definition of the grammar will be more formal than Montague's in the sense that we shall use a formal metalanguage, that of constructive type theory, for defining both the object language and its interpretation. The grammar, both syntax and semantics, is thus readily implementable in the type-theoretical proof system ALF . Inside type theory, a distinction can be made between the object language and the model, in other words, between syntactic and semantic types. It will turn out that the object language cannot be defined independently of the model, as in ordinary Tarski semantics. This is a direct consequence of introducing the typing restrictions.The grammar presented here can be seen as a formal linguistic elaboration of the work presented in Ranta 1991 and 1994. The organization of generative grammar as categorial grammar followed by sugaring should now look more familiar to the linguist, as the grammatical formalism on which sugaring operates is no longer full type theory but a set of phrase structure trees. (shrink)

An elementary algebra identifies conceptual and corresponding applicational limitations in John Kemeny and Paul Oppenheim’s (K-O) 1956 model of theoretical reduction in the sciences. The K-O model was once widely accepted, at least in spirit, but seems afterward to have been discredited, or in any event superceeded. Today, the K-O reduction model is seldom mentioned, except to clarify when a reduction in the Kemeny-Oppenheim sense is not intended. The present essay takes a fresh look at the basic (...) mathematics of K-O comparative vocabulary theoretical term reductions, from historical and philosophical standpoints, as a contribution to the history of the philosophy of science. The K-O theoretical reduction model qualifies a theory replacement as a successful reduction when preconditions of explanatory adequacy and comparable systematicization are met, and there occur fewer numbers of theoretical terms identified as replicable syntax types in the most economical statement of a theory’s putative propositional truths, as compared with the theoretical term count for the theory it replaces. The challenge to the historical model developed here, to help explain its scope and limitations, involves the potential for equivocal theoretical meanings of multiple theoretical term tokens of the same syntactical type. (shrink)

Natural language syntax yields an unbounded array of hierarchically structured expressions. We claim that these are used in the service of active inference in accord with the free-energy principle (FEP). While conceptual advances alongside modelling and simulation work have attempted to connect speech segmentation and linguistic communication with the FEP, we extend this program to the underlying computations responsible for generating syntactic objects. We argue that recently proposed principles of economy in language design—such as “minimal search” criteria from theoretical (...) syntax—adhere to the FEP. This affords a greater degree of explanatory power to the FEP—with respect to higher language functions—and offers linguistics a grounding in first principles with respect to computability. While we mostly focus on building new principled conceptual relations between syntax and the FEP, we also show through a sample of preliminary examples how both tree-geometric depth and a Kolmogorov complexity estimate (recruiting a Lempel–Ziv compression algorithm) can be used to accurately predict legal operations on syntactic workspaces, directly in line with formulations of variational free energy minimization. This is used to motivate a general principle of language design that we term Turing–Chomsky Compression (TCC). We use TCC to align concerns of linguists with the normative account of self-organization furnished by the FEP, by marshalling evidence from theoretical linguistics and psycholinguistics to ground core principles of efficient syntactic computation within active inference. (shrink)

Dynamic Syntax (DS: Kempson et al. 2001; Cann et al. 2005) is an action-based grammar formalism which models the process of natural language understanding as monotonic tree growth. This paper presents an introduction to the notions of incrementality and underspecification and update, drawing on the assumptions made by DS. It lays out the tools of the theoretical framework that are necessary to understand the accounts developed in the other contributions to the Special Issue. It also represents an up-to-date account (...) of the framework, combining the developments that have previously remained distributed in a diverse body of literature. (shrink)

After a quick overview of the field of study known as “Lexical Semantics”, where we advocate the need of accessing additional information besides syntax and Montague-style semantics at the lexical level in order to complete the full analysis of an utterance, we summarize the current formulations of a well-known theory of that field. We then propose and justify our own model of the Generative Lexicon Theory, based upon a variation of classical compositional semantics, and outline its formalization. Additionally, (...) we discuss the theoretical place of informational, knowledge-related data supposed to exist within the lexicon as well as within discourse and other linguistic constructs. The formalization of the structure of natural language utterances around a surface form (phenogrammatics), a deep structure (tectogrammatics) and the meaning thereof as a logical form (semantics) has developed from the original theories of Curry and Montague to form coherent, type-driven models. Most of these new theories rely upon variations of the compositional analysis of the sentence: from pheno to tectogrammatics, and then to semantics. Our contribution to this work aims at giving such a model a means to overcome the problems posed by polysemous lexical units during the semantical analysis of the tectogrammatical form. Building upon an assumed “deep structure”, we formalize parts of Pustejovsky’s Generative Lexicon Theory, linguistically motivated in Pustejovsky (The generative lexicon, MIT Press, Cambridge, MA, 1995), in a pre-processing of the semantics of the sentence. The mechanisms of Lexical Semantics we propose are an additional layer of classical Montague compositional semantics, and, as such, integrate smoothly within such an analysis; we proceed by converting the lexical data to modifiers of the logical form. This treatment of Lexical Semantics furthermore induces us to think that some sort of non-evident background knowledge of the common use of words is necessary to perform a correct semantic analysis of an utterance. This “commonsense metaphysics” would therefore not be strictly confined to pragmatics, as is often assumed. (shrink)

Most syntacticians, no matter their theoretical persuasion, agree that features are the most important units of analysis. Within Chomskyan generative grammar, the importance of features has grown steadily and within minimalism, it can be said that everything depends on features. They are obstacles in any interdisciplinary investigation concerning the nature of language and it is hard to imagine a syntactic description that does not explore them. For the first time, this book turns grammar upside down and proposes a new (...) class='Hi'>model of syntax that is better suited for interdisciplinary interactions, and shows how syntax can proceed free of lexical influence. The empirical domain examined is vast, and all the fundamental units and properties of syntax are rethought. Opening up new avenues of investigation, this book will be invaluable to researchers and students in syntactic theory, and linguistics more broadly. (shrink)

We use the category of presheaves over PTIME-functions in order to show that Cook and Urquhart's higher-order function algebra PV ω defines exactly the PTIME-functions. As a byproduct we obtain a syntax-free generalisation of PTIME-computability to higher types. By restricting to sheaves for a suitable topology we obtain a model for intuitionistic predicate logic with ∑ 1 b -induction over PV ω and use this to re-establish that the provably total functions in this system are polynomial time computable. (...) Finally, we apply the category-theoretic approach to a new higher-order extension of Bellantoni-Cook's system BC of safe recursion. (shrink)

This book presents a new approach to studying the syntax of human language, one which emphasizes how we think about time. Tilsen argues that many current theories are unsatisfactory because those theories conceptualize syntactic patterns with spatially arranged structures of objects. These object-structures are atemporal and do not lend well to reasoning about time. The book develops an alternative conceptual model in which oscillatory systems of various types interact with each other through coupling forces, and in which the (...) relative energies of those systems are organized in particular ways. Tilsen emphasizes that the two primary mechanisms of the approach - oscillators and energy levels - require alternative ways of thinking about time. Furthermore, his theory leads to a new way of thinking about grammaticality and the recursive nature of language. The theory is applied to a variety of syntactic phenomena: word order, phrase structure, morphosyntax, constituency, case systems, ellipsis, anaphora, and islands. The book also presents a general program for the study of language in which the construction of linguistic theories is itself an object of theoretical analysis. (shrink)

This review considers Semantic Syntax and Slavic Transformational Syntax particularly in the light of their contributions to the theory of grammar. Semantic Syntax is shown to have a polemical bias against the Aspects model and toward generative semantics. Its editor's position in the constellation of semantic logicians is defined; pro-Chomskian objections to the logical-cognitive semantic theory are advanced. Slavic Transformational Syntax is comprised of essays with a wide range of theoretical stances; the insights of the (...) radical case grammar of James Miller are compared with those of Semantic Syntax. Remarks on deixis by Richard Brecht are discussed in relationship to semantic-logic approaches. Certain similarities of Jakobsonian functionalism and generative semantics are discussed. (shrink)

This paper is about a special version of PDL, proposed by Marcus Kracht, for reasoning about sibling ordered trees. It has four basic programs corresponding to the child, parent, left- and right-sibling relations in such trees. The original motivation for this language is rooted in the field of model-theoretic syntax. Motivated by recent developments in the area of semi-structured data, and, especially, in the field of query languages for XML (eXtensible Markup Language) documents, we revisit the language. (...) This renewed interest comes with a special focus on complexity and expressivity aspects of the language, aspects that have so far largely been ignored. We survey and derive complexity results, and spend most of the paper on the most important open question concerning the language: what is its expressive power? We approach this question from two angles: Which first-order properties can be expressed? And which second-order properties? While we are still some way from definitive answers to these questions, we discuss two first-order fragments of the PDL language for ordered trees, and show how the language can be used to express some typical (second-order) problems, like the boolean circuit and the frontier problem. (shrink)

We establish, generalizing Di Nola and Lettieri’s categorical equivalence, a Morita-equivalence between the theory of lattice-ordered abelian groups and that of perfect MV-algebras. Further, after observing that the two theories are not bi-interpretable in the classical sense, we identify, by considering appropriate topos-theoretic invariants on their common classifying topos, three levels of bi-interpretability holding for particular classes of formulas: irreducible formulas, geometric sentences, and imaginaries. Lastly, by investigating the classifying topos of the theory of perfect MV-algebras, we obtain various (...) results on its syntax and semantics also in relation to the cartesian theory of the variety generated by Chang’s MV-algebra, including a concrete representation for the finitely presentable models of the latter theory as finite products of finitely presentable perfect MV-algebras. Among the results established on the way, we mention a Morita-equivalence between the theory of lattice-ordered abelian groups and that of cancellative lattice-ordered abelian monoids with bottom element. (shrink)

Intensional logic has emerged, since the 1960' s, as a powerful theoretical and practical tool in such diverse disciplines as computer science, artificial intelligence, linguistics, philosophy and even the foundations of mathematics. The present volume is a collection of carefully chosen papers, giving the reader a taste of the frontline state of research in intensional logics today. Most papers are representative of new ideas and/or new research themes. The collection would benefit the researcher as well as the student. This book (...) is a most welcome addition to our series. The Editors CONTENTS PREFACE IX JOHAN VAN BENTHEM AND NATASHA ALECHINA Modal Quantification over Structured Domains PATRICK BLACKBURN AND WILFRIED MEYER-VIOL Modal Logic and Model-Theoretic Syntax 29 RUY J. G. B. DE QUEIROZ AND DOV M. GABBAY The Functional Interpretation of Modal Necessity 61 VLADIMIR V. RYBAKOV Logics of Schemes for First-Order Theories and Poly-Modal Propositional Logic 93 JERRY SELIGMAN The Logic of Correct Description 107 DIMITER VAKARELOV Modal Logics of Arrows 137 HEINRICH WANSING A Full-Circle Theorem for Simple Tense Logic 173 MICHAEL ZAKHARYASCHEV Canonical Formulas for Modal and Superintuitionistic Logics: A Short Outline 195 EDWARD N. ZALTA 249 The Modal Object Calculus and its Interpretation NAME INDEX 281 SUBJECT INDEX 285 PREFACE Intensional logic has many faces. In this preface we identify some prominent ones without aiming at completeness. (shrink)

Recent work on the acquisition of number words has emphasized the importance of integrating linguistic and developmental perspectives [Musolino, J. (2004). The semantics and acquisition of number words: Integrating linguistic and developmental perspectives. Cognition93, 1-41; Papafragou, A., Musolino, J. (2003). Scalar implicatures: Scalar implicatures: Experiments at the semantics-pragmatics interface. Cognition, 86, 253-282; Hurewitz, F., Papafragou, A., Gleitman, L., Gelman, R. (2006). Asymmetries in the acquisition of numbers and quantifiers. Language Learning and Development, 2, 76-97; Huang, Y. T., Snedeker, J., Spelke, (...) L. (submitted for publication). What exactly do numbers mean?]. Specifically, these studies have shown that data from experimental investigations of child language can be used to illuminate core theoretical issues in the semantic and pragmatic analysis of number terms. In this article, I extend this approach to the logico-syntactic properties of number words, focusing on the way numerals interact with each other (e.g. Three boys are holding two balloons) as well as with other quantified expressions (e.g. Three boys are holding each balloon). On the basis of their intuitions, linguists have claimed that such sentences give rise to at least four different interpretations, reflecting the complexity of the linguistic structure and syntactic operations involved. Using psycholinguistic experimentation with preschoolers (n=32) and adult speakers of English (n=32), I show that (a) for adults, the intuitions of linguists can be verified experimentally, (b) by the age of 5, children have knowledge of the core aspects of the logical syntax of number words, (c) in spite of this knowledge, children nevertheless differ from adults in systematic ways, (d) the differences observed between children and adults can be accounted for on the basis of an independently motivated, linguistically-based processing model [Geurts, B. (2003). Quantifying kids. Language Acquisition, 11(4), 197-218]. In doing so, this work ties together research on the acquisition of the number vocabulary with a growing body of work on the development of quantification and sentence processing abilities in young children [Geurts, 2003; Lidz, J., Musolino, J. (2002). Children's command of quantification. Cognition, 84, 113-154; Musolino, J., Lidz, J. (2003). The scope of isomorphism: Turning adults into children. Language Acquisition, 11(4), 277-291; Trueswell, J., Sekerina, I., Hilland, N., Logrip, M. (1999). The kindergarten-path effect: Studying on-line sentence processing in young children. Cognition, 73, 89-134; Noveck, I. (2001). When children are more logical than adults: Experimental investigations of scalar implicature. Cognition, 78, 165-188; Noveck, I., Guelminger, R., Georgieff, N., & Labruyere, N. (2007). What autism can tell us about every. . . not sentences. Journal of Semantics,24(1), 73-90. On a more general level, this work confirms the importance of integrating formal and developmental perspectives [Musolino, 2004], this time by highlighting the explanatory power of linguistically-based models of language acquisition and by showing that the complex structure postulated by linguists has important implications for developmental accounts of the number vocabulary. (shrink)

Two kinds of theoretical framework for syntax are encountered in current linguistics. One emerged from the mathematization of proof theory, and is referred to here as generative-enumerative syntax (GES). A less explored alternative stems from the semantic side of logic, and is here called model-theoretic syntax (MTS). I sketch the outlines of each, and give a capsule summary of some mathematical results pertaining to the latter. I then briefly survey some diverse types of evidence suggesting (...) that in some ways MTS seems better suited to theorizing about the relevant linguistic phenomena. (shrink)

The purpose of this article is to update and defend syntax-based gene concepts. I show how syntax-based concepts can and have been extended to accommodate complex cases of processing and gene expression regulation. In response to difficult cases and causal parity objections, I argue that a syntax-based approach fleshes out a deflationary concept defining genes as genomic sequences and organizational features of the genome contributing to a phenotype. These organizational features are an important part of accepted molecular (...) explanations, provide the theoretical basis for a large number of experimental techniques and practical applications, and play a crucial role in in annotating the genome, deriving predictions and constructing bioinformatics models. (shrink)

Pregroup grammars were developed in 1999 and stayed Lambek’s preferred algebraic model of grammar. The set-theoretic semantics of pregroups, however, faces an ambiguity problem. In his latest book, Lambek suggests that this problem might be overcome using finite dimensional vector spaces rather than sets. What is the right notion of composition in this setting, direct sum or tensor product of spaces?

We present Logical Description Grammar (LDG), a model ofgrammar and the syntax-semantics interface based on descriptions inelementary logic. A description may simultaneously describe the syntacticstructure and the semantics of a natural language expression, i.e., thedescribing logic talks about the trees and about the truth-conditionsof the language described. Logical Description Grammars offer a naturalway of dealing with underspecification in natural language syntax andsemantics. If a logical description (up to isomorphism) has exactly onetree plus truth-conditions as a model, (...) it completely specifies thatgrammatical object. More common is the situation, corresponding tounderspecification, in which there is more than one model. A situation inwhich there are no models corresponds to an ungrammatical input. (shrink)

In this study, we apply MOSAIC (model of syntax acquisition in children) to the simulation of the developmental patterning of children's optional infinitive (OI) errors in 4 languages: English, Dutch, German, and Spanish. MOSAIC, which has already simulated this phenomenon in Dutch and English, now implements a learning mechanism that better reflects the theoretical assumptions underlying it, as well as a chunking mechanism that results in frequent phrases being treated as 1 unit. Using 1, identical model that (...) learns from child‐directed speech, we obtain a close quantitative fit to the data from all 4 languages despite there being considerable cross‐linguistic and developmental variation in the OI phenomenon. MOSAIC successfully simulates the difference between Spanish (a pro‐drop language in which OI errors are virtually absent) and obligatory subject languages that do display the OI phenomenon. It also highlights differences in the OI phenomenon across German and Dutch, 2 closely related languages whose grammar is virtually identical with respect to the relation between finiteness and verb placement. Taken together, these results suggest that (a) cross‐linguistic differences in the rates at which children produce OIs are graded, quantitative differences that closely reflect the statistical properties of the input they are exposed to and (b) theories of syntax acquisition need to consider more closely the role of input characteristics as determinants of quantitative differences in the cross‐linguistic patterning of phenomena in language acquisition. (shrink)

This paper studies some model-theoretic properties of special groups of finite type. Special groups are a first-order axiomatization of the algebraic theory of quadratic forms, introduced by Dickmann and Miraglia, which is essentially equivalent to abstract Witt rings. More precisely, we consider elementary equivalence, saturation, elementary embeddings, quantifier elimination, stability and Morley rank.

This paper argues for the hypothesis of direct compositionality (as in, e.g., Montague 1974), according to which the combinatory syntactic rules specify a set of well-formed expressions while the semantic combinatory rules work in tandem to directly supply a model-theoretic interpretation to each expression as it is "built" in the syntax. (This thus obviates the need for any level like LF and, concomitantly, for any rules mapping surface structures to such a level.) I focus here on one (...) related group of phenomena: the interaction of "paycheck" pronouns with Weak Crossover effects and i-within-i effects. These interactions were studied in Jacobson (1977) as they show up in Back-Peters sentences. There I argued that these interactions show that paycheck pronouns have a complex representation at LF; here I show that all of the observations in this earlier work are compatible with the hypothesis of direct compositionality. The key tool is the adoption of a variation-free semantics (a semantics which makes no use of variables as part of the semantic machinery). In addition to the general consequences for the syntax/semantics interface, there are two other main results. First, I provide new arguments for a variable-free semantics. For example, it will be shown that under this view the paycheck reading of a pronoun comes for free; most other theories posit additional mechanisms and/or an additional lexical meaning for pronouns, and thus paycheck and regular pronouns are only accidentally homophonous. Second, I reiterate one of the central points in Jacobson (1977): this is that the first pronoun in a Bach-Peters sentence is indeed a paycheck pronoun, and hence nothing special needs to be said about these sentences nor does any new machinery need to be invoked for them. (shrink)

The equivalence of leaf languages of tree adjoining grammars and monadic linear context-free grammars was shown about a decade ago. This paper presents a proof of the strong equivalence of these grammar formalisms. Non-strict tree adjoining grammars and monadic linear context-free grammars define the same class of tree languages. We also present a logical characterisation of this tree language class showing that a tree language is a member of this class iff it is the two-dimensional yield of an MSO-definable three-dimensional (...) tree language. (shrink)

Logical inferentialism claims that the meaning of the logical constants should be given, not model-theoretically, but by the rules of inference of a suitable calculus. It has been claimed that certain proof-theoretical systems, most particularly, labelled deductive systems for modal logic, are unsuitable, on the grounds that they are semantically polluted and suffer from an untoward intrusion of semantics into syntax. The charge is shown to be mistaken. It is argued on inferentialist grounds that labelled deductive systems are (...) as syntactically pure as any formal system in which the rules define the meanings of the logical constants. (shrink)

Formal semantics is an approach to SEMANTICS1, the study of meaning, with roots in logic, the philosophy of language, and linguistics, and since the 1980’s a core area of linguistic theory. Characteristics of formal semantics to be treated in this article include the following: Formal semanticists treat meaning as mind-independent (though abstract), contrasting with the view of meanings as concepts “in the head” (see I-LANGUAGE AND E-LANGUAGE and MEANING EXTERNALISM AND INTERNALISM); formal semanticists distinguish semantics from knowledge of semantics (Lewis (...) 1975, Cresswell 1978), which has consequences for the notion of semantic COMPETENCE. A central part of the meaning of a sentence on this approach is its TRUTH CONDITIONS, and most although not all formal semantics is model-theoretic, relating linguistic expressions to model-theoretically constructed semantic values cast in terms of truth, REFERENCE, and possible worlds. This sets formal semantics apart from approaches which view semantics as relating a sentence just to a representation on another linguistic “level” (LOGICAL FORM) or a representation in an innate LANGUAGE OF THOUGHT. The formal semanticist could accept such representations as an aspect of semantics but would insist on asking what the model-theoretic semantic interpretation of the given representationlanguage is (Lewis 1970). Formal semantics is centrally concerned with COMPOSITIONALITY at the SYNTAX-SEMANTICS INTERFACE, how the meanings of larger constituents are built up from the meanings of their parts on the basis of their syntactic structure, and with the relation between compositional SENTENCE MEANING and meaning in discourse. (shrink)

Minimal predicates P satisfying a given first-order description φ(P) occur widely in mathematical logic and computer science. We give an explicit first-order syntax for special first-order ‘PIA conditions’ φ(P) which guarantees unique existence of such minimal predicates. Our main technical result is a preservation theorem showing PIA-conditions to be expressively complete for all those first-order formulas that are preserved under a natural model-theoretic operation of ‘predicate intersection’. Next, we show how iterated predicate minimization on PIA-conditions yields a (...) language MIN(FO) equal in expressive power to LFP(FO), first-order logic closed under smallest fixed-points for monotone operations. As a concrete illustration of these notions, we show how our sort of predicate minimization extends the usual frame correspondence theory of modal logic, leading to a proper hierarchy of modal axioms: first-order-definable, first-order fixed-point definable, and beyond. (shrink)

Linguists often sharply distinguish the different modules that support linguistics competence, e.g., syntax, semantics, pragmatics. However, recent work has identified phenomena in syntax (polarity sensitivity) and pragmatics (implicatures), which seem to rely on semantic properties (monotonicity). We propose to investigate these phenomena and their connections as a window into the modularity of our linguistic knowledge. We conducted a series of experiments to gather the relevant syntactic, semantic and pragmatic judgments within a single paradigm. The comparison between these quantitative (...) data leads us to four main results, (i) Our results support a departure from one element of the classical Gricean approach, thus helping to clarify and settle an empirical debate. This first outcome also confirms the soundness of the methodology, as the results align with standard contemporary accounts of scalar implicature (SI), (ii) We confirm that the formal semantic notion of monotonicity underlies negative polarity item (NPI) syntactic acceptability, but (iii) our results indicate that the notion needed is perceived monotonicity. We see results (ii) and (iii) as the main contribution of this study: (ii) provides an empirical interpretation and confirmation of one of the insights of the model-theoretic approach to semantics, while (iii) calls for an incremental, cognitive implementation of the current generalizations, (iv) Finally, our results do not indicate that the relationship between NPI acceptability and monotonicity is mediated by pragmatic features related to Sis: this tells against elegant attempts to unify polarity sensitivity and Sis (pioneered by Krifka and Chierchia). These results illustrate a new methodology for integrating theoretically rigorous work in formal semantics with an experimentally-grounded cognitively-oriented view of linguistic competence. (shrink)

Introduction -- The concept of logical consequence -- Tarski's characterization of the common concept of logical consequence -- The logical consequence relation has a modal element -- The logical consequence relation is formal -- The logical consequence relation is A priori -- Logical and non-logical terminology -- The meanings of logical terms explained in terms of their semantic properties -- The meanings of logical terms explained in terms of their inferential properties -- Model-theoretic and deductive-theoretic conceptions of (...) logic -- Linguistic preliminaries : the language M -- Syntax of M -- The definition of a well formed formula of M -- Semantics for M -- The sentential connectives are defined -- The notion of satisfaction is introduced and the quantifiers are defined -- Model-theoretic consequence -- Truth in a structure -- Satisfaction revisited -- Formalized definition of truth -- Model-theoretic consequence defined -- The model-theoretic definition and the concept of logical consequence -- Does the model theoretic consequence relation reflect the salient features of the common concept of logical consequence? -- What is a logical constant? -- Deductive consequence -- Deductive system n -- The deductive theoretic definition and the concept of logical consequence -- Tarski's criticism of the deductive theoretic definition -- Is N a correct deductive system? (shrink)

The main goal of this work is to present the proof-theoretical and model-theoretical approaches to probabilistic logics which allow reasoning about independence and probabilistic support. We extend the existing formalisms [14] to obtain several variants of probabilistic logics by adding the operators for independence and confirmation to the syntax. We axiomatize these logics, provide corresponding semantics, prove that the axiomatizations are sound and strongly complete, and discuss decidability issues.

Though deceptively simple and plausible on the face of it, Craig's interpolation theorem has proved to be a central logical property that has been used to reveal a deep harmony between the syntax and semantics of first order logic. Craig's theorem was generalized soon after by Lyndon, with application to the characterization of first order properties preserved under homomorphism. After retracing the early history, this article is mainly devoted to a survey of subsequent generalizations and applications, especially of many-sorted (...) interpolation theorems. Attention is also paid to methodological considerations, since the Craig theorem and its generalizations were initially obtained by proof-theoretic arguments while most of the applications are model-theoretic in nature. The article concludes with the role of the interpolation property in the quest for "reasonable" logics extending first-order logic within the framework of abstract model theory. (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)

Tarski has exerted enormous influence not only on the development of mathematical logic, but on twentieth-century philosophy and philosophical analysis. This influence has been twofold, with the two components pulling in a sense in opposite directions. A comparison with the influence of the Vienna Circle provides an instructive vantage point in viewing Tarski’s influence. On the one hand, Tarski has provided powerful tools for logical analysis in philosophy. His first and most important contribution was to show that — and how (...) — the crucial semantical concept of truth can be defined for various formal languages. They include the most central types of language used and studied by twentieth century logicians and philosophers. The subsequent work by Tarski and his school in creating contemporary model theory in its narrow sense as a branch of technical logic has likewise enriched tremendously the conceptual arsenal of philosophers. The extent and depth of Tarski’s influence is in fact easily underestimated. In comparison, Carnap’s well-known books in logical syntax and logical semantics did not in the same way contribute to the logical techniques that philosophers might find useful. A large part of Tarski’s influence lies in facilitating a switch of emphasis from purely syntactical to model-theoretical, semantical methods. It was Gödel’s and Tarski’s early work that forced logicians and philosophers for the first time to take seriously the distinction between semantical and syntactical concepts and methods. The general theoretical implications of the distinction were not realized at once. In the light of hindsight, it is for instance quite striking that Tarski still in his classical monograph repeatedly assimilates to each other the task of defining truth for some part of mathematics or logic and axiomatizing its truths in a sense that involves explicit syntactical rules of inference. It was nevertheless Tarski more than anyone else who began to develop and exploit systematically model-theoretical concepts in logical theory. In comparison, Gödel never developed systematically the model-theoretical aspects of logic. Others, for instance Quine, stubbornly remained within the syntactical tradition. Carnap, who did switch his attention from the syntactical to a semantical approach, was not powerful enough a logician to create a sufficiently rich store of model-theoretical techniques and ideas to be equally helpful in philosophical analysis. In contrast, several major developments in analytic philosophy have had their starting points in Tarski’s ideas. Well-known cases in point are Davidson’s truth-conditional semantics and the possible worlds semantics developed by Tarski’s favorite former student Richard Montague. (shrink)

An introduction to the model-theoretic approach in the philosophy of science is given and it is argued that this program is further enhanced by the introduction of partial structures. It is then shown that this leads to a natural and intuitive account of both "iconic" and mathematical models and of the role of the former in science itself.

In the monograph [1] of Chang and Keisler, a considerable extent of model theory of the first order continuous logic is ingeniously developed without using any notion of provability.In this paper we shall define the notion of provability in continuous logic as well as the notion of matrix, which is a natural extension of one in finite-valued logic in [2], and develop the syntax and semantics of it mostly along the line in the preceding paper [2]. Fundamental theorems (...) of model theory in continuous logic, which have been proved with purely model-theoretic proofs in [1], will be proved with proofs which are natural extensions of those in two-valued logic. (shrink)

Semantics plays a role in grammar in at least three guises. (A) Linguists seek to account for speakers‘ knowledge of what linguistic expressions mean. This goal is typically achieved by assigning a model theoretic interpretation in a compositional fashion. For example, *No whale flies* is true if and only if the intersection of the sets of whales and fliers is empty in the model. (B) Linguists seek to account for the ability of speakers to make various inferences (...) based on semantic knowledge. For example, *No whale flies* entails *No blue whale flies* and *No whale flies high*. (C) The wellformedness of a variety of syntactic constructions depends on morpho-syntactic features with a semantic flavor. For example, *Under no circumstances would a whale fly* is grammatical, whereas *Under some circumstances would a whale fly* is not, corresponding to the downward vs. upward monotonic features of the preposed phrases. It is usually assumed that once a compositional model theoretic interpretation is assigned to all expressions, its fruits can be freely enjoyed by inferencing and syntax. What place might proof theory have in this picture? (shrink)

This dissertation provides a model-theoretic semantics for English sentences atttributing a property or action to a group of objects, either collectively or distributively. It is shown that certain adverbial expressions select for collective predicates; therefore collective and distibutive predicates must be distinguishable. This finding is problematic for recent accounts of distributive predicates which analyze such predicates as taking group-level arguments, and hence as not distinguishable from collective predicates. ;A group-level treatment of distributives is possible, however, if predicate denotations (...) are relativized to a set of events for which a part/whole relation is defined. An event in which a group performs an action distributively will have subevents in which each of the group's members perform the same action; an event in which the group performs the action collectively will not. ;This analysis also makes possible an account of the fact that adverbials expressing collective action commonly have an additional use expressing spatial proximity, both in English and cross-linguistically. . A spatial "trace" function on the set of events allows formal definitions for the spatial uses of such adverbials to exactly parallel the definitions for the collectivizing uses. ;The dissertation also provides arguments for a set-theoretic model for plurality, in which the group membership relation is distinct from the subgroup relation. ;Certain quantifiers are shown sensitive to distinction between different sorts of group-level event. To accommodate this fact, it is suggested that verbal denotations provide, for each event, both an "inclusion set" and an "exclusion set"--corresponding roughly to positive and negative denotations. If the inclusion and exclusion sets are allowed under certain circumstances not to complement each other, correct results obtain. ;The splitting of verbal denotations into inclusion and exclusion sets also allows the solution of certain problems in previous accounts of the semantics of subject-verb agreement for number. The dissertation closes with a defense of the hypothesis that agreement is conditioned primarily by the semantics. (shrink)

In this paper we analyze some aspects of the question of using methods from model theory to study structures of functional analysis.By a well known result of P. Lindström, one cannot extend the expressive power of first order logic and yet preserve its most outstanding model theoretic characteristics (e.g., compactness and the Löwenheim-Skolem theorem). However, one may consider extending the scope of first order in a different sense, specifically, by expanding the class of structures that are regarded (...) as models (e.g., including Banach algebras or other structures of functional analysis), and ask whether the resulting extensions of first order model theory preserve some of its desirable characteristics.A formal framework for the study of structures based on Banach spaces from the perspective of model theory was first introduced by C. W. Henson in [8] and [6]. Notions of syntax and semantics for these structures were defined, and it was shown that using them one obtains a model theoretic apparatus that satisfies many of the fundamental properties of first order model theory. For instance, one has compactness, Löwenheim-Skolem, and omitting types theorems. Further aspects of the theory, namely, the fundamentals of stability and forking, were first introduced in [10] and [9].The classes of mathematical structures formally encompassed by this framework are normed linear spaces, possibly expanded with additional structure,e.g., operations, real-valued relations, and constants. This notion subsumes wide classes of structures from functional analysis. However, the restriction that the universe of a structure be a normed space is not necessary. (This restriction has a historical, rather than technical origin; specifically, the development of the theory was originally motivated by questions in Banach space geometry.) Analogous techniques can be applied if the universe is a metric space. Now, when the underlying metric topology is discrete, the resulting model theory coincides with first order model theory, so this logic extends first order in the sense described above. Furthermore, without any cost in the mathematical complexity, one can also work in multi-sorted contexts, so, for instance, one sort could be an operator algebra while another is. say, a metric space. (shrink)

In this paper, I propose a solution to Fitch’s paradox that draws on ideas from Edgington (Mind 94:557–568, 1985), Rabinowicz and Segerberg (1994) and Kvanvig (Noûs 29:481–500, 1995). After examining the solution strategies of these authors, I will defend the view, initially proposed by Kvanvig, according to which the derivation of the paradox violates a crucial constraint on quantifier instantiation. The constraint states that non-rigid expressions cannot be substituted into modal positions. We will introduce a slightly modified syntax and (...) semantics that will help underline this point. Furthermore, we will prove results about the consistency of verificationism and the principle of non-omniscience by model-theoretical means. Namely, we prove there exists a model of these principles, and delineate certain constraints they pose on a structure in which they are true. (shrink)

An introduction to the model-theoretic approach in the philosophy of science is given and it is argued that this program is further enhanced by the introduction of partial structures. It is then shown that this leads to a natural and intuitive account of both "iconic" and mathematical models and of the role of the former in science itself.

We study model theoretic tree properties and their associated cardinal invariants. In particular, we obtain a quantitative refinement of Shelah’s theorem for countable theories, show that [Formula: see text] is always witnessed by a formula in a single variable and that weak [Formula: see text] is equivalent to [Formula: see text]. Besides, we give a characterization of [Formula: see text] via a version of independent amalgamation of types and apply this criterion to verify that some examples in the (...) literature are indeed [Formula: see text]. (shrink)

In this paper I investigate Putnam’s model-theoretic argument from a transcendent standpoint, in spite of Putnam’s well-known objections to such a standpoint. This transcendence, however, requires ascent to something more like a Tarskian meta-level than what Putnam regards as a “God’s eye view”. Still, it is methodologically quite powerful, leading to a significant increase in our investigative tools. The result is a shift from Putnam’s skeptical conclusion to a new understanding of realism, truth, correspondence, knowledge, and theories, or (...) certain aspects thereof, based on, among other things, a better understanding of what models are designed (and not designed) to do. (shrink)