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)

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)

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)

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)

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)

Dynamic Syntax 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)

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)

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)

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)

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)

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.1. (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?

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)

Kaneko-Suzuki developed epistemic logics of shallow depths with multiple players for investigations of game theoretical problems. By shallow depth, we mean that nested occurrences of belief operators of players in formulae are restricted, typically to be of finite depths, by a given epistemic structure. In this paper, we develop various methods of surgical operations (cut and paste) of epistemic world models. An example is a bouquet-making, i.e., tying several models into a bouquet. Another example is to engraft a model (...) to some branches of another model. By these methods, we obtain various meta-theorems on semantics and syntax on epistemic logics. To illustrate possible uses of our meta-theorems, we present one game theoretical theorem, which is also a meta-theorem in the sense of logic. (shrink)

We introduce and study the model-theoretic notions of absolute connectedness and type-absolute connectedness for groups. We prove that groups of rational points of split semisimple linear groups (that is, Chevalley groups) over arbitrary infinite fields are absolutely connected and characterize connected Lie groups which are type-absolutely connected. We prove that the class of type-absolutely connected group is exactly the class of discretely topologized groups with the trivial Bohr compactification, that is, the class of minimally almost periodic groups.

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)

In the early 20th century, scepticism was common among philosophers about the very meaningfulness of the notion of truth – and of the related notions of denotation, definition etc. (i.e., what Tarski called semantical concepts). Awareness was growing of the various logical paradoxes and anomalies arising from these concepts. In addition, more philosophical reasons were being given for this aversion.1 The atmosphere changed dramatically with Alfred Tarski’s path-breaking contribution. What Tarski did was to show that, assuming that the syntax (...) of the object language is specified exactly enough, and that the metatheory has a certain amount of set theoretic power,2 one can explicitly define truth in the object language. And what can be explicitly defined can be eliminated. It follows that the defined concept cannot give rise to any inconsistencies (that is, paradoxes). This gave new respectability to the concept of truth and related notions. Nevertheless, philosophers’ judgements on the nature and philosophical relevance of Tarski’s work have varied. It is my aim here to review and evaluate some threads in this debate. (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)

In order to account for the actual function of analogue models in extending theories to new domains, we argue that it is necessary to analyze the inference involved into a complex two dimensional form. This form must go horizontally from descriptions of entities used as a model to redescriptions of entities in the new domain, and it must go vertically from an observation language to a theoretical language having a different and exclusive logical syntax. This complex inference can (...) only be intelligible if we interpret theoretical terms in a platonic manner, a la Körner. (shrink)

The paper discusses the notion of finite model truth definitions (or FM-truth definitions), introduced by M. Mostowski as a finite model analogue of Tarski's classical notion of truth definition. We compare FM-truth definitions with Vardi's concept of the combined complexity of logics, noting an important difference: the difficulty of defining FM-truth for a logic ᵍ does not depend on the syntax of L, as long as it is decidable. It follows that for a natural ᵍ there exist (...) FM-truth definitions whose evaluation is much easier than the combined complexiy of ᵍ would suggest. We apply the general theory to give a complexity-theoretical characterization of the logics for which the $\Sigma_{m}^{d}$ classes (prenex classes of higher order logics) define FM-truth. For any $d \geq 2.m \geq 1$ we construct a family $\{[\Sigma_{m}^{d}]^{\leg\kappa}\}\kappa\in\omega$ of syntactically defined fragments of $\Sigma_{m}^{d}$ which satisfy this characterization. We also use the $[\Sigma_{m}^{d}]\leg\kappa$ classes to give a refinement of known results on the complexity classes captured by $\Sigma_{m}^{d}$ . We close with a few simple corollaries, one of which gives a sufficient condition for the existence, given a vocabulary $\sigma$ , of a fixed number $\kappa$ such that model checking for all first order sentences over $\sigma$ can be done in deterministic time $n^{\kappa}$. (shrink)

This book brings together several directions of work in model theory between the late 1950s and early 1980s.

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)

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.

Recent discussions of the nature of representation in science have tended to import pre-established decompositions from analyses of representation in the arts, language, cognition and so forth. Which of these analyses one favours will depend on how one conceives of theories in the first place. If one thinks of them in terms of an axiomatised set of logico-linguistic statements, then one might be naturally drawn to accounts of linguistic representation in which notions of denotation, for example, feature prominently. If, on (...) the other hand, one conceives of theories in non-linguistic terms, as in the model-theoretic approach, then one might look to analyses of representation in the arts where notions of resemblance tend to be brought to the fore. Thus van Fraassen, for example, has imported such an analysis into his discussion of representation in science and argued that an appropriate account of resemblance can be given in terms of the set-theoretic relation of isomorphism. This has been strongly criticised by Suarez, who argues that just as isomorphism cannot capture representation in art, so it is inappropriate in the scientific context as well. Similarly Hughes draws on Goodman`s rejection of resemblance in art in favour of denotation and, rather confusingly perhaps, favours the latter whilst also maintaining the model-theoretic view of theories. In this paper, I shall examine the debate in terms of four claims: 1. Isomorphism is not sufficient for representation; 2. Isomorphism is not necessary for representation; 3. Models represent but theories do not; 4. Models denote and do not resemble. Each of these claims will be questioned and I will conclude by suggesting that, through appropriate modifications, a form of isomorphism can serve to underpin representation in both the arts and science. (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)

My model-theoretic realist account of science places linguistic systems and the corresponding non-linguistic structures at different stages of the scientific process. It is shown that science and its progress cannot be analysed in terms of only one of these strata. Philosophy of science literature offers mainly two approaches; to the structure of scientific knowledge analysed in terms of theories and their models, the "statement" and the "non-statement" approaches. In opposition to the statement approach's belief that scientific knowledge is (...) embodied in theories symbolic language) with direct interpretative links---via so-called "bridge principles"---to reality, the defenders of the non-statement approach believe in an analysis where the language in which the theory is formulated plays a much smaller role than the structures which satisfy that theory. ;The model-theoretic realism expounded here retains the notion of a scientific theory as a set of sentences, while simultaneously emphasising the interpretative role of the conceptual models of these theories. My criticism against the non-statement approach is based on the fact that merely "giving" the theory "in terms of" its mathematical structures leaves out any real interpretation of the nature and role of general terms in science. Against the statement approach's "direct" linking of general theoretical terms to reality, my approach interpolates models between theories and reality in the interpretative chain. ;The links between the general terms of scientific theories and their interpretations in the various models of the theory regulate the whole referential process. The terms of a theory are "general" in the sense that they are the result of certain abstractive conceptualisations of the object of scientific investigation and subsequent linguistic formulations of these conceptualisations. Their meanings can be "given back" only by interpreting them in the limited context, of the various conceptual models of their theory and, finally, by finding an isomorphic relation between some substructure of the conceptual model in question and some empirical conceptualisation of relevant experimental data. In this sense the notion of scientific "truth" becomes inextricably linked with that of articulated reference, as it---given its model-dependent nature---should be. (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)

In "Realism and Reason" Hilary Putnam has offered an apparently strong argument that the position of metaphysical realism provides an incoherent model of the relation of a correct scientific theory to the world. However, although Putnam's attack upon the notion of the "intended" interpretation of a scientific theory is sound, it is shown here that realism may be formulated in such a way that the realist need make no appeal to any "intended" interpretation of such a theory. Consequently, it (...) can be shown that realism is immune to Putnam's criticism and that attempts at reformulating this criticism are not likely to meet with success. (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 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)

We present a framework for model theoretic forcing in a non first order context, and present some applications of this framework to Banach space theory.

We describe a model-theoretic approach to ordinal analysis via the finite combinatorial notion of an α-large set of natural numbers. In contrast to syntactic approaches that use cut elimination, this approach involves constructing finite sets of numbers with combinatorial properties that, in nonstandard instances, give rise to models of the theory being analyzed. This method is applied to obtain ordinal analyses of a number of interesting subsystems of first- and second-order arithmetic.

Discussions of representation in science tend to draw on examples from art. However, such examples need to be handled with care given a) the differences between works of art and scientific theories and b) the accommodation of these examples within certain philosophies of art. I shall examine the claim that isomorphism is neither necessary nor sufficient for representation and I shall argue that there exist accounts of representation in both art and science involving isomorphism which accommodate the apparent counterexamples and, (...) moreover, allow us to understand how “impossible” artistic objects and inconsistent scientific theories can be said to represent. (shrink)

We give a model-theoretic proof of the fact that for all infinite Abelian groups P ≠ NP in the sense of binary nondeterminism. This result has been announced 1994 by Christine Gabner.

We prove that for a finitely generated infinite nilpotent group $G$ with structure $(G,\cdot,\dots)$, the connected component ${G^*}^0$ of a sufficiently saturated extension $G^*$ of $G$ exists and equals \[ \bigcap_{n\in\N} \{g^n\colon g\in G^*\}. \] We construct an expansion of ${\mathbb Z}$ by a predicate $({\mathbb Z},+,P)$ such that the type-connected component ${{\mathbb Z}^*}^{00}_{\emptyset}$ is strictly smaller than ${{\mathbb Z}^*}^0$. We generalize this to finitely generated virtually solvable groups. As a corollary of our construction we obtain an optimality result for (...) the van der Waerden theorem for finite partitions of groups. (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 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)

We analyze model-theoretic connected components in extensions of a given group by abelian groups which are defined by means of 2-cocycles with finite image. We characterize, in terms of these 2-cocycles, when the smallest type-definable subgroup of the corresponding extension differs from the smallest invariant subgroup. In some situations, we also describe the quotient of these two connected components. Using our general results about extensions of groups together with Matsumoto–Moore theory or various quasi-characters considered in bounded cohomology, we (...) obtain new classes of examples of groups whose smallest type-definable subgroup of bounded index differs from the smallest invariant subgroup of bounded index. This includes the first known example of a group with this property found by Conversano and Pillay, namely the universal cover of [Formula: see text], as well as various examples of different nature, e.g. some central extensions of free groups or of fundamental groups of closed orientable surfaces. As a corollary, we get that both non-abelian free groups and fundamental groups of closed orientable surfaces of genus [Formula: see text], expanded by predicates for all subsets, have this property, too. We also obtain a variant of the example of Conversano and Pillay for [Formula: see text] instead of [Formula: see text], which was not accessible by the previously known methods. (shrink)

Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation, respectively. It is proved that a first-order formula is equivalent to a standard translation of an intuitionistic propositional formula iff it is invariant with respect to k-asimulations for some k, and then that a first-order formula is equivalent to a standard translation of an intuitionistic propositional formula iff it is invariant with respect to asimulations. Finally, it is proved that a first-order formula is equivalent to a (...) standard translation of an intuitionistic propositional formula over the class of intuitionistic Kripke models iff it is invariant with respect to asimulations between intuitionistic models. (shrink)

We use model-theoretic methods described in [3] to obtain ordinal analyses of a number of theories of first- and second-order arithmetic, whose proof-theoretic ordinals are less than or equal to Γ0.