This book contains the material for a first course in pure model theory with applications to differentially closed fields.

About 25 years ago, it came to light that a single combinatorial property determines both an important dividing line in model theory and machine learning. The following years saw a fruitful exchange of ideas between PAC-learning and the model theory of NIP structures. In this article, we point out a new and similar connection between model theory and machine learning, this time developing a correspondence between stability and learnability in various settings of online learning. (...) In particular, this gives many new examples of mathematically interesting classes which are learnable in the online setting. (shrink)

We continue the analysis of foundations of positive model theory as introduced by Ben Yaacov and Poizat. The objects of this analysis are $h$-inductive theories and their models, especially the “positively” existentially closed ones. We analyze topological properties of spaces of types, introduce forms of quantifier elimination, and characterize minimal completions of arbitrary $h$-inductive theories. The main technical tools consist of various forms of amalgamations in special classes of structures.

Philosophy and model theory frequently meet one another. Philosophy and Model Theory aims to understand their interactions -/- Model theory is used in every ‘theoretical’ branch of analytic philosophy: in philosophy of mathematics, in philosophy of science, in philosophy of language, in philosophical logic, and in metaphysics. But these wide-ranging appeals to model theory have created a highly fragmented literature. On the one hand, many philosophically significant mathematical results are found only in (...) mathematics textbooks: these are aimed squarely at mathematicians; they typically presuppose that the reader has a significant background in mathematics; and little clue is given as to their philosophical significance. On the other hand, the philosophical applications of these results are then scattered across disconnected pockets of papers, separated by decades or more. -/- The first aim of Philosophy and Model Theory, then, is to consider the philosophical uses of model theory. On a technical level, we try to show how philosophically significant results connect to one another, and also to state the best version of a result for philosophical purposes. On a philosophical level, we show how similar dialectical situations arise repeatedly, across fragmented debates in varied philosophical areas. -/- The second aim of Philosophy and Model Theory, though, is to consider the philosophy of model theory. Model theory itself is rarely taken as the subject matter of philosophising (contrast this, say, with the philosophy of biology, or the philosophy of set theory). But model theory is a beautiful part of pure mathematics, and worthy of philosophical study in its own right. (shrink)

Provability, Computability and Reflection.

Major shifts in the field of model theory in the twentieth century have seen the development of new tools, methods, and motivations for mathematicians and philosophers. In this book, John T. Baldwin places the revolution in its historical context from the ancient Greeks to the last century, argues for local rather than global foundations for mathematics, and provides philosophical viewpoints on the importance of modern model theory for both understanding and undertaking mathematical practice. The volume also (...) addresses the impact of model theory on contemporary algebraic geometry, number theory, combinatorics, and differential equations. This comprehensive and detailed book will interest logicians and mathematicians as well as those working on the history and philosophy of mathematics. (shrink)

We shift attention from the development of model theory for demarcated languages to the development of this theory for fragments of a language. Although it is often assumed that model theory for demarcated languages is not compatible with a universalist conception of logic, no one has denied that model theory for fragments of a language can be compatible with that conception. It thus seems unwarranted to ignore the universalist tradition in the search for (...) the origins and development of model theory. This point is illustrated by Carnap’s early semantics and model theory, which he developed within a type theoretical framework and which stand out both for their universalistic treatment and for certain idiosyncratic technicalities by which the construction is supported. One special property is that individuals are context relative in Carnap’s system. This leads to a model theory in which the model domains are more flexible than has been suggested in the literature. (shrink)

We initiate the study of model theory in the absence of the Axiom of Choice, using the Axiom of Determinateness as a powerful substitute. We first show that, in this context, L ω 1 ω is no more powerful than first-order logic. The emphasis then turns to upward Lowenhein-Skolem theorems; ℵ 1 is the Hanf number of first-order logic, of L ω 1 ω , and of a strong fragment of L ω 1 ω . The main technical (...) innovation is the development of iterated ultrapowers using infinite supports; this requires an application of infinite-exponent partition relations. All our theorems can be proven from hypotheses weaker than AD. (shrink)

The question “Are ‘biorobots' good models of biological behaviour?” can be seen as a specific instance of a more general question about the relation between computer programs and models, between models and theories, and between theories and reality. This commentary develops a personal view of these relations, from an antirealism perspective. Programs, models, theories and reality are separate and distinct entities which may converge in particular cases but should never be confused.

CONTINUOUS MODEL THEORY CHAPTER I TOPOLOGICAL PRELIMINARIES. Notation Throughout the monograph our mathematical notation does not differ drastically from ...

We study the theory of a Hilbert space H as a module for a unital C*-algebra ${\mathcal{A}}$ from the point of view of continuous logic. We give an explicit axiomatization for this theory and describe the structure of all the representations which are elementary equivalent to it. Also, we show that this theory has quantifier elimination and we characterize the model companion of the incomplete theory of all non-degenerate representations of ${\mathcal{A}}$ . Finally, we show (...) that there is an homeomorphism between the space of types of norm less than 1 in this model companion, and the space of quasistates of the C*-algebra ${\mathcal{A}}$. (shrink)

Specially selected articles from the Journal of Advanced Nursing have been updated where appropriate by the original author. Models, Theories and Concepts brings together international authorities in their specialist fields to consider the gaps occurring between theory and practice, as well as the evaluation of a selection of models and emerging theories.

We introduce the subject of modal model theory, where one studies a mathematical structure within a class of similar structures under an extension concept that gives rise to mathematically natural notions of possibility and necessity. A statement φ is possible in a structure (written φ) if φ is true in some extension of that structure, and φ is necessary (written φ) if it is true in all extensions of the structure. A principal case for us will be the (...) class Mod(T) of all models of a given theory T—all graphs, all groups, all fields, or what have you—considered under the substructure relation. In this article, we aim to develop the resulting modal model theory. The class of all graphs is a particularly insightful case illustrating the remarkable power of the modal vocabulary, for the modal language of graph theory can express connectedness, k-colorability, finiteness, countability, size continuum, size ℵ1, ℵ2, ℵω, ℶω, first ℶ-fixed point, first ℶ-hyper-fixed point, and much more. A graph obeys the maximality principle φ(a)→φ(a) with parameters if and only if it satisfies the theory of the countable random graph, and it satisfies the maximality principle for sentences if and only if it is universal for finite graphs. (shrink)

We give a survey of results obtained in the model theory of finite and pseudo-finite fields.

The purpose of this paper is to outline some recent progress in descriptive inner model theory, a branch of set theory which studies descriptive set theoretic and inner model theoretic objects using tools from both areas. There are several interlaced problems that lie on the border of these two areas of set theory, but one that has been rather central for almost two decades is the conjecture known as the Mouse Set Conjecture. One particular motivation (...) for resolving MSC is that it provides grounds for solving the inner model problem which dates back to 1960s. There have been some new partial results on MSC and the methods used to prove the new instances suggest a general program for solving the full conjecture. It is then our goal to communicate the ideas of this program to the community at large. (shrink)

We prove Łos conjecture = Morley theorem in ZF, with the same characterization, i.e., of first order countable theories categorical in $N_\alpha $ for some (equivalently for every ordinal) α > 0. Another central result here in this context is: the number of models of a countable first order T of cardinality $N_\alpha $ is either ≥ |α| for every α or it has a small upper bound (independent of α close to Ð₂).

One of the most debated questions in psychology and cognitive science is the nature and the functioning of the mental processes involved in deductive reasoning. However, all existing theories refer to a specific deductive domain, like syllogistic, propositional or relational reasoning.Our goal is to unify the main types of deductive reasoning into a single set of basic procedures. In particular, we bring together the microtheories developed from a mental models perspective in a single theory, for which we provide a (...) formal foundation. We validate the theory through a computational model (UNICORE) which allows fine‐grained predictions of subjects' performance in different reasoning domains.The performance of the model is tested against the performance of experimental subjects—as reported in the relevant literature—in the three areas of syllogistic, relational and propositional reasoning. The computational model proves to be a satisfactory artificial subject, reproducing both correct and erroneous performance of the human subjects. Moreover, we introduce a developmental trend in the program, in order to simulate the performance of subjects of different ages, ranging from children (3–6) to adolescents (8–12) to adults (>21). The simulation model performs similarly to the subjects of different ages.Our conclusion is that the validity of the mental model approach is confirmed for the deductive reasoning domain, and that it is possible to devise a unique mechanism able to deal with the specific subareas. The proposed computational model (UNICORE) represents such a unifying structure. (shrink)

This paper presents a new theory of modal reasoning, i.e. reasoning about what may or may not be the case, and what must or must not be the case. It postulates that individuals construct models of the premises in which they make explicit only what is true. A conclusion is possible if it holds in at least one model, whereas it is necessary if it holds in all the models. The theory makes three predictions, which are corroborated (...) experimentally. First, conclusions correspond to the true, but not the false, components of possibilities. Second, there is a key interaction: it is easier to infer that a situation is possible as opposed to impossible, whereas it is easier to infer that a situation is not necessary as opposed to necessary. Third, individuals make systematic errors of omission and of commission. We contrast the theory with theories based on formal rules. (shrink)

We study the model-theoretic aspects of a probability logic suited for talking about measure spaces. This nonclassical logic has a model theory rather different from that of classical predicate logic. In general, not every satisfiable set of sentences has a countable model, but we show that one can always build a model on the unit interval. Also, the probability logic under consideration is not compact. However, using ultraproducts we can prove a compactness theorem for a (...) certain class of weak models. (shrink)

The Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all positive existential formulas, can express the first-order translations of basic modal logic and of many description logics, along with many sentences that arise in databases. It has been shown that the syntax of GNFO is restrictive enough so that computational problems such as validity and satisfiability are still decidable. This suggests that, in spite of its expressive power, GNFO formulas are amenable to novel optimizations. In this (...) article we study the model theory of GNFO formulas. Our results include effective preservation theorems for GNFO, effective Craig Interpolation and Beth Definability results, and the ability to express the certain answers of queries with respect to a large class of GNFO sentences within very restricted logics. (shrink)

A Steiner triple system (STS) is a set S together with a collection B of subsets of S of size 3 such that any two elements of S belong to exactly one element of B. It is well known that the class of finite STS has a Fraïssé limit M_F. Here, we show that the theory T of M_F is the model completion of the theory of STSs. We also prove that T is not small and it (...) has quantifier elimination, TP2, NSOP1, elimination of hyperimaginaries and weak elimination of imaginaries. (shrink)

SummaryThe paper is a critical survey of the semantics and pragmatics of Indexicals. Both the coordinate‐approach due to Lewis and the semantization of pragmatics attempted by Lakoff are shown to be inadequate. Cresswell's more dynamic approach is shown to withstand the objections raised against it. Sophisticated accounts such as a two dimensional tense logic, or a semantics involving pragmatic models and multiple reference models are shown to be necessary to cope with the intricacies of the use of tense in natural (...) language. Benveniste's division of time into physical, chronic and linguistic time is assessed and criticised for missing the phenomenon of tense anaphora. Finally, the problem of the interaction between the utterance's time and the indexicals is analysed. (shrink)

We use the Drozd-Warfield structure theorem for finitely presented modules over a serial ring to investigate the model theory of modules over a serial ring, in particular, to give a simple description of pp-formulas and to classify the pure-injective indecomposable modules. We also study the question of whether every pure-injective indecomposable module over a valuation ring is the hull of a uniserial module.

Human reasoning involving quantified statements is one area in which findings from cognitive psychology and linguistic pragmatics complement each other. I will show how mental models theory provides a promising account of the mechanisms underlying peoples’ performance in three types of reasoning tasks involving quantified premises and conclusions. I will further suggest that relevance theory can help to explain the way in which mental models are employed in the reasoning processes. Conversely, mental models theory suggests that human (...) reasoning typically does not involve deductive rules, which in turn entails a modification to the nature of the deductive processes proposed by relevance theory. The mechanism proposed by mental models theory also helps to clarify the nature of the relevance theory distinction between conceptual and procedural information. (shrink)

We prove some results about the model theory of fields with a derivation of the Frobenius map, especially that the model companion of this theory is axiomatizable by axioms used by Wood in the case of the theory $\operatorname {DCF}_p$ and that it eliminates quantifiers after adding the inverse of the Frobenius map to the language. This strengthens the results from [4]. As a by-product, we get a new geometric axiomatization of this model companion. (...) Along the way we also prove a quantifier elimination result, which holds in a much more general context and we suggest a way of giving “one-dimensional” axiomatizations for model companions of some theories of fields with operators. (shrink)

We study model theory of fields with actions of a fixed finite group scheme. We prove the existence and simplicity of a model companion of the theory of such actions, which generalizes our previous results about truncated iterative Hasse–Schmidt derivations [13] and about Galois actions [14]. As an application of our methods, we obtain a new model complete theory of actions of a finite group on fields of finite imperfection degree.

In this paper, the (possible) role of model theory forstructuralism and structuralist definitions of ``reduction'' arediscussed. Whereas it is somewhat undecisive with respect tothe first point – discussing some pro's and con's ofthe model theoretic approach when compared with a syntacticand a structuralist one – it emphasizes that severalstructuralist definitions of ``reducibility'' do not providegenerally acceptable explications of ``reducibility''. This claimrests on some mathematical results proved in this paper.

Model theory is the branch of mathematical logic looking at the relationship between mathematical structures and logic languages. These formal languages are free from the ambiguities of natural languages, and are becoming increasingly important in areas such as computing, philosophy and linguistics. This book provides a clear introduction to the subject for both mathematicians and the non-specialists now needing to learn some model theory.

Vector spaces over unspecified fields can be axiomatized as one-sorted structures, namely, abelian groups with the relation of parallelism. Parallelism is binary linear dependence. When equipped with the n-ary relation of linear dependence for some positive integer n, a vector-space is existentially closed if and only if it is n-dimensional over an algebraically closed field. In the signature with an n-ary predicate for linear dependence for each positive integer n, the theory of infinite-dimensional vector spaces over algebraically closed fields (...) is the model-completion of the theory of vector spaces. (shrink)

I see model theory as becoming increasingly detached from set theory, and the Tarskian notion of set-theoretic model being no longer central to model theory. In much of modern mathematics, the set-theoretic component is of minor interest, and basic notions are geometric or category-theoretic. In algebraic geometry, schemes or algebraic spaces are the basic notions, with the older “sets of points in affine or projective space” no more than restrictive special cases. The basic notions (...) may be given sheaf-theoretically, or functorially. To understand in depth the historically important affine cases, one does best to work with more general schemes. The resulting relativization and “transfer of structure” is incomparably more flexible and powerful than anything yet known in “set-theoretic model theory”.It seems to me now uncontroversial to see the fine structure of definitions as becoming the central concern of model theory, to the extent that one can easily imagine the subject being called “Definability Theory” in the near future.Tarski's set-theoretic foundational formulations are still favoured by the majority of model-theorists, and evolution towards a more suggestive language has been perplexingly slow. None of the main texts uses in any nontrivial way the language of category theory, far less sheaf theory or topos theory. Given that the most notable interactions of model theory with geometry are in areas of geometry where the language of sheaves is almost indispensable, this is a curious situation, and I find it hard to imagine that it will not change soon, and rapidly. (shrink)

In order to understand many of the proofs in this text the reader should have a one-semester background in set theory, including discussions of ordinal numbers, general a Cartesian products, cardinal arithmetic, and several forms of the axiom choice.

I show that the partial truth of a sentence in a partial structure is equivalent to the truth of that sentence in an expansion of a structure that corresponds naturally to the partial structure. Further, a mapping is a partial homomorphism/partial isomorphism between two partial structures if and only if it is a homomorphism/isomorphism between their corresponding structures. It is a corollary that the partial truth of a sentence in a partial structure is equivalent to the truth of a specific (...) Ramsey sentence in a corresponding structure. Hence the partial structures approach can be expressed in standard first or second-order model theory, and it can be captured in the received view on scientific theories as developed by Carnap and Hempel. (shrink)

This book gives a comprehensive overview of central themes of finite model theory – expressive power, descriptive complexity, and zero-one laws – together with selected applications relating to database theory and artificial intelligence, especially constraint databases and constraint satisfaction problems. The final chapter provides a concise modern introduction to modal logic, emphasizing the continuity in spirit and technique with finite model theory. This underlying spirit involves the use of various fragments of and hierarchies within first-order, (...) second-order, fixed-point, and infinitary logics to gain insight into phenomena in complexity theory and combinatorics. The book emphasizes the use of combinatorial games, such as extensions and refinements of the Ehrenfeucht-Fraissé pebble game, as a powerful way to analyze the expressive power of such logics, and illustrates how deep notions from model theory and combinatorics, such as o-minimality and treewidth, arise naturally in the application of finite model theory to database theory and AI. Students of logic and computer science will find here the tools necessary to embark on research into finite model theory, and all readers will experience the excitement of a vibrant area of the application of logic to computer science. (shrink)

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.

his paper is an excerpt from a larger project that aims to open a new pathway into Spinoza's Ethics by formally reconstructing an initial fragment of this text. The semantic backbone of the project is a custom-made Spinozian model theory that lays out some of the formal prerequisites for more ne-grained investigations into Spinoza's fundamental ontology and modal metaphysics. We implement Spinoza's theory of attributes using many-sorted models with a rich system of identity that allows us to (...) clarify the puzzling status of such logical principles as the Substitution of Identicals and Transitivity of Identity in Spinoza's thought. The intensional structure of our Spinozian models also captures his proposal that states of a airs can be necessitated or excluded by the essences of particular things, an essence-relative modality that should be of interest to philosophers who have sought to rehabilitate the concept of essence in contemporary analytic metaphysics. (shrink)

Thirty years after the conference that gave rise to The Structure of Scientific Theories, there is renewed interest in the nature of theories and models. However, certain crucial issues from thirty years ago are reprised in current discussions; specifically: whether the diversity of models in the science can be captured by some unitary account; and whether the temporal dimension of scientific practice can be represented by such an account. After reviewing recent developments we suggest that these issues can be accommodated (...) within the partial structures formulation of the semantic or model-theoretic approach. (shrink)

In this paper, I present a version of theory theory, so-called model theory, according to which theories are families of models, which represent real-world phenomena when combined with relevant hypotheses, best interpreted in terms of know-how. This form of theory theory has a number of advantages over traditional forms, and is not subject to some recent charges coming from narrativity theory. Most importantly, practice is central to model theory. Practice matters because (...) folk psychological knowledge is knowledge of the world only if it is combined with knowledge of how to apply it. By combining the general and the particular in this way, model theory gives a deep and explanatorily satisfactory account of the centrality of practice. Model theory accounts not just as well as, but better than, narrativity theory for the fact that our folk psychological explanations appear to contain, or form part of, narratives. (shrink)