§1. Introduction. After the pioneering work of Mostowski [29] and Lindström [23] it was Jon Barwise's papers [2] and [3] that brought abstract model theory and generalized quantifiers to the attention of logicians in the early seventies. These papers were greeted with enthusiasm at the prospect that model theory could be developed by introducing a multitude of extensions of first order logic, and by proving abstract results about relationships holding between properties of these logics. (...) Examples of such properties areκ-compactness.Any set of sentences of cardinality ≤ κ, every finite subset of which has a model, has itself a model.Löwenheim-Skolem Theorem down toκ.If a sentence of the logic has a model, it has a model of cardinality at most κ.Interpolation Property.If ϕ and ψ are sentences such that ⊨ ϕ → Ψ, then there is θ such that ⊨ ϕ → θ, ⊨ θ → Ψ and the vocabulary of θ is the intersection of the vocabularies of ϕ and Ψ.Lindstrom's famous theorem characterized first order logic as the maximal ℵ0-compact logic with Downward Löwenheim-Skolem Theorem down to ℵ0. With his new concept of absolute logics Barwise was able to get similar characterizations of infinitary languagesLκω. But hopes were quickly frustrated by difficulties arising left and right, and other areas of model theory came into focus, mainly stability theory. No new characterizations of logics comparable to the early characterization of first order logic given by Lindström and of infinitary logic by Barwise emerged. What was first called soft model theory turned out to be as hard as hard model theory. (shrink)

§1. Introduction. After the pioneering work of Mostowski [29] and Lindström [23] it was Jon Barwise's papers [2] and [3] that brought abstract model theory and generalized quantifiers to the attention of logicians in the early seventies. These papers were greeted with enthusiasm at the prospect that model theory could be developed by introducing a multitude of extensions of first order logic, and by proving abstract results about relationships holding between properties of these logics. (...) Examples of such properties areκ-compactness.Any set of sentences of cardinality ≤ κ, every finite subset of which has a model, has itself a model.Löwenheim-Skolem Theorem down toκ.If a sentence of the logic has a model, it has a model of cardinality at most κ.Interpolation Property.If ϕ and ψ are sentences such that ⊨ ϕ → Ψ, then there is θ such that ⊨ ϕ → θ, ⊨ θ → Ψ and the vocabulary of θ is the intersection of the vocabularies of ϕ and Ψ.Lindstrom's famous theorem characterized first order logic as the maximal ℵ0-compact logic with Downward Löwenheim-Skolem Theorem down to ℵ0. With his new concept of absolute logics Barwise was able to get similar characterizations of infinitary languagesLκω. But hopes were quickly frustrated by difficulties arising left and right, and other areas of model theory came into focus, mainly stability theory. No new characterizations of logics comparable to the early characterization of first order logic given by Lindström and of infinitary logic by Barwise emerged. What was first called soft model theory turned out to be as hard as hard model theory. (shrink)

We prove that compactness is equivalent to the amalgamation property, provided the occurrence number of the logic is smaller than the first uncountable measurable cardinal. We also relate compactness to the existence of certain regular ultrafilters related to the logic and develop a general theory of compactness and its consequences. We also prove some combinatorial results of independent interest.

We develop positive model theory, which is a non first order analogue of classical model theory where compactness is kept at the expense of negation. The analogue of a first order theory in this framework is a compact abstract theory: several equivalent yet conceptually different presentations of this notion are given. We prove in particular that Banach and Hilbert spaces are compact abstract theories, and in fact very well-behaved as such.

In this paper we develop an abstract theory of adequacy. In the same way as the theory of consequence operations is a general theory of logic, this theory of adequacy is a general theory of the interactions and connections between consequence operations and its sound and complete semantics. Addition of axioms for the connectives of propositional logic to the basic axioms of consequence operations yields a unifying framework for different systems of classical propositional logic. (...) We present an abstract model-theoretical semantics based on model mappings and theory mappings. Between the classes of models and theories, i.e., the set of sentences verified by a model, it obtains a connection that is well-known within algebra as Galois correspondence. Many basic semantical properties can be derived from this observation. A sentence A is a semantical consequence of T if every model of T is also a model of A. A model mapping is adequate for a consequence operation if its semantical inference operation is identical with the consequence operation. We study how properties of an adequate model mapping reflect the properties of the consequence operation and vice versa. In particular, we show how every concept of the theory of consequence operations can be formulated semantically. (shrink)

The Craig Interpolation Theorem is intimately connected with the emergence of abstract logic and continues to be the driving force of the field. I will argue in this paper that the interpolation property is an important litmus test in abstract model theory for identifying “natural,” robust extensions of first order logic. My argument is supported by the observation that logics which satisfy the interpolation property usually also satisfy a Lindström type maximality theorem. Admittedly, the range of (...) such logics is small. (shrink)

Given an abstract logic L = L(Q i ) i ∈ I generated by a set of quantifiers Q i , one can construct for each type τ a topological space S τ exactly as one constructs the Stone space for τ in first-order logic. Letting T be an arbitrary directed set of types, the set $S_T = \{(S_\tau, \pi^\tau_\sigma)\mid\sigma, \tau \in T, \sigma \subset \tau\}$ is an inverse topological system whose bonding mappings π τ σ are naturally determined (...) by the reduct operation on structures. We relate the compactness of L to the topological properties of S T . For example, if I is countable then L is compact iff for every τ each clopen subset of S τ is of finite type and S τ is homeomorphic to $\underset{lim}S_T$ , where T is the set of finite subtypes of τ. We finally apply our results to concrete logics. (shrink)

We investigate two different broad traditions in the abstract valuational model theory for nontransitive and nonreflexive logics. The first of these traditions makes heavy use of the natural Galois connection between sets of valuations and sets of arguments. The other, originating with work by Grzegorz Malinowski on nonreflexive logics, and best systematized in Blasio et al. : 233–262, 2017), lets sets of arguments determine a more restricted set of valuations. After giving a systematic discussion of these two (...) different traditions in the valuational model theory for substructural logics, we turn to looking at the ways in which we might try to compare two sets of valuations determining the same set of arguments. (shrink)

We examine a variety of dialogue protocols, taking inspiration from two fields: natural language dialogue modelling and multiagent systems. In communicative interaction, one can identify different features that may increase the complexity of the dialogue structure. This motivates a hierarchy of abstract models for protocols that takes as a starting point protocols based on deterministic finite automata. From there, we proceed by looking at particular examples that justify either an enrichment or a restriction of the initial model.

It is regrettably common for theorists to attempt to characterize the Humean dictum that one can’t get an ‘ought’ from an ‘is’ just in broadly logical terms. We here address an important new class of such approaches which appeal to model-theoretic machinery. Our complaint about these recent attempts is that they interfere with substantive debates about the nature of the ethical. This problem, developed in detail for Daniel Singer’s and Gillian Russell and Greg Restall’s accounts of Hume’s dictum, is (...) of a general type arising for the use of model-theoretic structures in cashing out substantive philosophical claims: the question of whether an abstract model-theoretic structure successfully interprets something often involves taking a stand on non-trivial issues surrounding the thing. In the particular case of Hume’s dictum, given reasonable conceptual or metaphysical claims about the ethical, Singer’s and Russell and Restall’s accounts treat obviously ethical claims as descriptive and vice versa. Consequently, their model-theoretic characterizations of Hume’s dictum are not metaethically neutral. This encourages skepticism about whether model-theoretic machinery suffices to provide an illuminating distinction between the ethical and the descriptive. (shrink)

Stemming from the works of Petr Hájek on mathematical fuzzy logic, graded model theory has been developed by several authors in the last two decades as an extension of classical model theory that studies the semantics of many-valued predicate logics. In this paper we take the first steps towards an abstract formulation of this model theory. We give a general notion of abstract logic based on many-valued models and prove six Lindström-style characterizations (...) of maximality of first-order logics in terms of metalogical properties such as compactness, abstract completeness, the Löwenheim–Skolem property, the Tarski union property, and the Robinson property, among others. As necessary technical restrictions, we assume that the models are valued on finite MTL-chains and the language has a constant for each truth-value. (shrink)

Abstract Theories of induction in psychology and artificial intelligence assume that the process leads from observation and knowledge to the formulation of linguistic conjectures. This paper proposes instead that the process yields mental models of phenomena. It uses this hypothesis to distinguish between deduction, induction, and creative forms of thought. It shows how models could underlie inductions about specific matters. In the domain of linguistic conjectures, there are many possible inductive generalizations of a conjecture. In the domain of models, (...) however, generalization calls for only a single operation: the addition of information to a model. If the information to be added is inconsistent with the model, then it eliminates the model as false: this operation suffices for all generalizations in a Boolean domain. Otherwise, the information that is added may have effects equivalent (a) to the replacement of an existential quantifier by a universal quantifier, or (b) to the promotion of an existential quantifier from inside to outside the scope of a universal quantifier. The latter operation is novel, and does not seem to have been used in any linguistic theory of induction. Finally, the paper describes a set of constraints on human induction, and outlines the evidence in favor of a model theory of induction. (shrink)

It is illegitimate to read any ontology about "race" off of biological theory or data. Indeed, the technical meaning of "genetic variation" is fluid, and there is no single theoretical agreed-upon criterion for defining and distinguishing populations (or groups or clusters) given a particular set of genetic variation data. Thus, by analyzing three formal senses of "genetic variation"—diversity, differentiation, and heterozygosity—we argue that the use of biological theory for making epistemic claims about "race" can only seem plausible when (...) it relies on the user’s own assumptions about race; the move from biological measures to claims about “race” inevitably amounts to a pernicious reification. We also excavate assumptions in the history of the technical discourse over the concept of "race" (e.g., Livingstone's and Dobzhansky's 1962 exchange, Edwards' 2003 response to Lewontin 1972, as well as contemporary discussions of cladistic "race", and "races" as clusters). We show that claims about the existence (or non-existence) of "race" are underdetermined by biological facts, methods, and theories. Biological theory does not force the concept of "race" upon us; our social discourse, social ontology, and social expectations do. We become prisoners of our abstractions at our own hands, and at our own expense. (shrink)

Abstract‘Skolem arithmetic’ is the complete theory T of the multiplicative monoid. We give a full characterization of the ‐definable stably embedded sets of T, showing in particular that, up to the relation of having the same definable closure, there is only one non‐trivial one: the set of squarefree elements. We then prove that T has weak elimination of imaginaries but not elimination of finite imaginaries.

This paper is a historical companion to a previous one, in which it was studied the so-called abstract Galois theory as formulated by the Portuguese mathematician José Sebastião e Silva ). Our purpose is to present some applications of abstract Galois theory to higher-order model theory, to discuss Silva's notion of expressibility and to outline a classical Galois theory that can be obtained inside the two versions of the abstract theory, those (...) of Mark Krasner and of Silva. Some comments are made on the universal theory of structures. (shrink)

This paper is a historical companion to a previous one, in which it was studied the so-called abstract Galois theory as formulated by the Portuguese mathematician José Sebastião e Silva ). Our purpose is to present some applications of abstract Galois theory to higher-order model theory, to discuss Silva’s notion of expressibility and to outline a classical Galois theory that can be obtained inside the two versions of the abstract theory, those (...) of Mark Krasner and of Silva. Some comments are made on the universal theory of structures. (shrink)

Mancosu, P., Generalizing classical and effective model theory in theories of operations and classes, Annas of Pure and Applied Logic 52 249-308 . In this paper I propose a family of theories of operations and classes with the aim of developing abstract versions of model-theoretic results. The systems are closely related to those introduced and already used by Feferman for developing his program of ‘explicit mathematics’. The theories in question are two-sorted, with one kind of variable (...) for individuals and the other for classes. The individual variables range over a domain closed under pairing and containing, among other things, natural numbers and operations.All the theories used assume a common group of axioms that insure that the individuals in the domain satisfy the conditions for a partial combinatory algebra with pairing. We also assume a class of natural numbers and a class induction axiom on . Finally there are various class existence axioms. I work mainly with three theories, FMT0, FMT and FMTΩ, which differ from each other both in their class existence axioms as well as in some further applicative axioms.These theories have various interpretations in which every object is explicitly presented by some means of definition as well as classical, or ‘standard’, set-theoretical interpretation. The systems are formulated in a flexible general language which can be used to prove abstract theorems of mathematics , thereby generalizing recursive, hyperarithmetic and admissible versions of classical mathematics.The aim of my work is to give an abstract development of portions of model theory in the afore-mentioned theories, in a way to look as much as possible like classical mathematics. Thus, FMT0 generalizes portions of countable and recursive model theory; FMT further generalizes portions of countable and hyperarithmetical model theory and finally FMTΩ provides a generalization of the classical L-completeness theorem and of an admissible version of L-completeness due to Bruce and Keisler. This continues the development of the program mentioned above, originating with Feferman. (shrink)

The process of abstraction and concretisation is a label used for an explicative theory of scientific model-construction. In scientific theorising this process enters at various levels. We could identify two principal levels of abstraction that are useful to our understanding of theory-application. The first level is that of selecting a small number of variables and parameters abstracted from the universe of discourse and used to characterise the general laws of a theory. In classical mechanics, for example, (...) we select position and momentum and establish a relation amongst the two variables, which we call Newton’s 2nd law. The specification of the unspecified elements of scientific laws, e.g. the force function in Newton’s 2nd law, is what would establish the link between the assertions of the theory and physical systems. In order to unravel how and with what conceptual resources scientific models are constructed, how they function and how they relate to theory, we need a view of theory-application that can accommodate our constructions of representation models. For this we need to expand our understanding of the process of abstraction to also explicate the process of specifying force functions etc. This is the second principal level at which abstraction enters in our theorising and in which I focus. In this paper, I attempt to elaborate a general analysis of the process of abstraction and concretisation involved in scientific- model construction, and argue why it provides an explication of the construction of models of the nuclear structure. (shrink)

In recent decades, research in the square of opposition has increased. New interpretations, extensions, and generalizations have been suggested, both Aristotelian and non-Aristotelian ones. The paper attempts to compare different versions of the square of opposition. For this reason, we appeal to the wider categorical model-theoretic framework of the theory of institutions.

Given classical (2 valued) structures and and a homomorphism h of onto , it is shown how to construct a (non-degenerate) 3-valued counterpart of . Classical sentences that are true in are non-false in . Applications to number theory and type theory (with axiom of infinity) produce finite 3-valued models in which all classically true sentences of these theories are non-false. Connections to relevant logic give absolute consistency proofs for versions of these theories formulated in relevant logic (the (...) proof for number theory was obtained earlier by R. K. Meyer and suggested the present abstract development). (shrink)

By utilizing the topological concept of pseudocompactness, we simplify and improve a proof of Caicedo, Dueñez, and Iovino concerning Terence Tao's metastability. We also pinpoint the exact relationship between the Omitting Types Theorem and the Baire Category Theorem by developing a machine that turns topological spaces into abstract logics.

Kripke’s notion of groundedness plays a central role in many responses to the semantic paradoxes. Can the notion of groundedness be brought to bear on the paradoxes that arise in connection with abstraction principles? We explore a version of grounded abstraction whereby term models are built up in a ‘grounded’ manner. The results are mixed. Our method solves a problem concerning circularity and yields a ‘grounded’ model for the predicative theory based on Frege’s Basic Law V. However, the (...) method is poorly behaved unless the background second-order logic is predicative. (shrink)

An important part of the theory of algebraizable sentential logics consists of studying the algebraic semantics of these logics. As developed by Czelakowski, Blok, and Pigozzi and Font and Jansana, among others, it includes studying the properties of logical matrices serving as models of deductive systems and the properties of abstract logics serving as models of sentential logics. The present paper contributes to the development of the categorical theory by abstracting some of these model theoretic aspects (...) and results from the level of sentential logics to the level of π-institutions. (shrink)

A natural way to think of models is as abstract entities. If theories employ models to represent the world, theories traffic in abstract entities much more widely than is often assumed. This kind of thought seems to create a problem for a scientific realist approach to theories. Scientific realists claim theories should be understood literally. Do they then imply the reality of abstract entities? Or are theories simply—and incurably—false? Or has the very idea of literal understanding to (...) be abandoned? Is then fictionalism towards scientific theories inevitable? This paper argues that scientific realism can happily co-exist with models qua abstracta. (shrink)

Mauricio Suárez and Agnes Bolinska apply the tools of communication theory to scientific modeling in order to characterize the informational content of a scientific model. They argue that when represented as a communication channel, a model source conveys information about its target, and that such representations are therefore appropriate whenever modeling is employed for informational gain. They then extract two consequences. First, the introduction of idealizations is akin in informational terms to the introduction of noise in a (...) signal; for in an idealization we introduce ‘extraneous’ elements into the model that have no correlate in the target. Second, abstraction in a model is informationally equivalent to equivocation in the signal; for in an abstraction we “neglect” in the model certain features that obtain in the target. They conclude that it becomes possible in principle to quantify idealization and abstraction in informative models, although precise absolute quantification will be difficult to achieve in practice. (shrink)

Many cognitive and evolutionary theories of religion argue that supernatural explanations are byproducts of our cognitive adaptations. An influential argument states that our supernatural explanations result from a tendency to generate anthropomorphic explanations, and that this tendency is a byproduct of an error management strategy because agents tend to be associated with especially high fitness costs. We propose instead that anthropomorphic and other supernatural explanations result as features of a broader toolkit of well-designed cognitive adaptations, which are designed for explaining (...) the abstract and causal structure of complex, unobservable, and uncertain phenomena that have substantial impacts on fitness. Specifically, we argue that (1) mental representations about the abstract vs. the supernatural are largely overlapping, if not identical, and (2) when the data-generating processes for scarce and ambiguous observations are complex and opaque, a naive observer can improve a bias-variance trade-off by starting with a simple, underspecified explanation that Western observers readily interpret as “supernatural.” We then argue that (3) in many cases, knowledge specialists across cultures offer pragmatic services that involve apparently supernatural explanations, and their clients are frequently willing to pay them in a market for useful and effective services. We propose that at least some ethnographic descriptions of religion might actually reflect ordinary and adaptive responses to novel problems such as illnesses and natural disasters, where knowledge specialists possess and apply the best available explanations about phenomena that would otherwise be completely mysterious and unpredictable. (shrink)

Scientists use models to know the world. It i susually assumed that mathematicians doing pure mathematics do not. Mathematicians doing pure mathematics prove theorems about mathematical entities like sets, numbers, geometric figures, spaces, etc., they compute various functions and solve equations. In this paper, I want to exhibit models build by mathematicians to study the fundamental components of spaces and, more generally, of mathematical forms. I focus on one area of mathematics where models occupy a central role, namely homotopy (...) class='Hi'>theory. I argue that mathematicians introduce genuine models and I offer a rough classification of these models. (shrink)

We initiate a systematic investigation of the abstract elementary classes that have amalgamation, satisfy tameness, and are stable in some cardinal. Assuming the singular cardinal hypothesis, we prove a full characterization of the stability cardinals, and connect the stability spectrum with the behavior of saturated models.We deduce that if a class is stable on a tail of cardinals, then it has no long splitting chains. This indicates that there is a clear notion of superstability in this framework.We also present (...) an application to homogeneous model theory: for [Formula: see text] a homogeneous diagram in a first-order theory [Formula: see text], if [Formula: see text] is both stable in [Formula: see text] and categorical in [Formula: see text] then [Formula: see text] is stable in all [Formula: see text]. (shrink)

Abstract ?Theory of Mind? (ToM) is widely held to be ubiquitous in our navigation of the social world. Recently this standard view has been contested by phenomenologists and enactivists. Proponents of the ubiquity of ToM, however, accept and effectively neutralize the intuitions behind their arguments by arguing that ToM is mostly sub-personal. This paper proposes a similar move on behalf of the phenomenologists and enactivists: it offers a novel explanation of the intuition that ToM is ubiquitous that is (...) compatible with the rejection of this ubiquity. According to this explanation, we use ToM-talk primarily to model and thereby reconstruct non-mentalizing social-cognitive processes in order to explain our assessment of the behaviour of others. The intuition that ToM is ubiquitous is the result of mistaking the model for the real thing. This explanation is argued to be more complete than the ?ToM-ist? explanation of the intuition that ToM is not ubiquitous. (shrink)

This volume explores the roles and uses of abstraction in scientific and artistic practice. Conceived as an interdisciplinary dialogue between experts across histories and philosophies of art and science, this collection of essays draws on the shared premise that abstraction is a rich and generative process, not reducible to the mere omission of details in a representation. When scientists attempt to make sense of complex natural phenomena, they often produce highly abstract models of them. In the history and philosophy (...) of art, there is a long tradition of debate on the function of abstraction, and - more recently - its relation with theories of depiction. Adopting a process-oriented perspective, the chapters in this volume explore the epistemic potential of a diversity of practices of abstracting. The systematic analysis of a wide range of historical cases, from early twentieth-century abstractionist painting to contemporary abstract photography, and from nineteenth-century physics to recent research in biology and neurosciences, invites the reader to reflect on the material lives of abstraction through concrete artefacts, experimental practices and theoretical and aesthetic achievements. Abstraction in Science and Art: Philosophical Perspectives will be of interest to scholars and advanced students working in aesthetics, philosophy of science, and epistemology, as well as to historians of science and art, and to practicing artists and scientists interested in exploring foundational questions at the heart of the creative practice of abstracting. (shrink)

Since its formal definition over sixty years ago, category theory has been increasingly recognized as having a foundational role in mathematics. It provides the conceptual lens to isolate and characterize the structures with importance and universality in mathematics. The notion of an adjunction (a pair of adjoint functors) has moved to center-stage as the principal lens. The central feature of an adjunction is what might be called "internalization through a universal" based on universal mapping properties. A recently developed "heteromorphic" (...) theory of adjoint functors allows the concepts to be more easily applied empirically. This suggests a conceptual structure, albeit abstract, to model a range of selectionist mechanisms (e.g., in evolution and in the immune system). Closely related to adjoints is the notion of a "brain functor" which abstractly models structures of cognition and action (e.g., the generative grammar view of language). (shrink)

http://dx.doi.org/10.5007/1808-1711.2008v12n1p73 This paper aims at discussing from the point of view of a pragmatic stance the concept of model as an abstract replica. According to this view, scientific models are abstract structures different from set-theoretic models. The view of models argued for here stems from the conceptions of some important philosophers of science who elaborated on the notion of model, such as Suppe, Cartwright, Hempel, and Nagel. Differently from all those authors, however, the conception of (...) class='Hi'>model argued for here is typically pragmatic, not semantic, i.e. it has not to do with the interpretation of scientific theories, but with the explanation and construction of given circumstances (both abstract and concrete), from the point of view of the theory. (shrink)