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

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)

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.

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

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)

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)

The current paper studies the formal properties of the Global Reflection Principle, to wit the assertion “All theorems of$\mathrm {Th}$are true,” where$\mathrm {Th}$is a theory in the language of arithmetic and the truth predicate satisfies the usual Tarskian inductive conditions for formulae in the language of arithmetic. We fix the gap in Kotlarski’s proof from [15], showing that the Global Reflection Principle for Peano Arithmetic is provable in the theory of compositional truth with bounded induction only ($\mathrm {CT}_0$). (...) Furthermore, we extend the above result showing that$\Sigma _1$-uniform reflection over a theory of uniform Tarski biconditionals ($\mathrm {UTB}^-$) is provable in$\mathrm {CT}_0$, thus answering the question of Beklemishev and Pakhomov [2]. Finally, we introduce the notion of a prolongable satisfaction class and use it to study the structure of models of$\mathrm {CT}_0$. In particular, we provide a new model-theoretical characterization of theories of finite iterations of uniform reflection and present a new proof characterizing the arithmetical consequences of$\mathrm {CT}_0$. (shrink)

This paper critiques a number of standard ways of understanding the role of the metalanguage in a semantic theory for natural language, including the idea that disquotation plays a nontrivial role in any explanatory natural language semantics. It then proposes that the best way to understand the role of a semantic metalanguage involves recognizing that semantics is a model-based science. The metalanguage of semantics is language for articulating features of the theorist's model. Models are understood as mediating (...) instruments---idealized structures used to represent select aspects of the world, aspects the theorist is seeking some theoretical understanding of. The aspect of reality we are seeking some understanding of in semantics is a dimension of human linguistic competence---informally, knowledge of meaning. (shrink)

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)

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.

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)

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)

Provability, Computability and Reflection.

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.

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.

In this paper we set out the basic model theory of differential fields of characteristic 0, which have finitely many commuting derivations. We give axioms for the theory of differentially closed differential fields with m derivations and show that this theory is ω-stable, model complete, and quantifier-eliminable, and that it admits elimination of imaginaries. We give a characterization of forking and compute the rank of this theory to be ω m + 1.

In his Ph.D. thesis [7], L. van den Dries studied the model theory of fields with finitely many orderings and valuations where all open sets according to the topology defined by an order or a valuation is globally dense according with all other orderings and valuations. Van den Dries proved that the theory of these fields is companionable and that the theory of the companion is decidable .In this paper we study the case where the fields (...) are expanded with finitely many orderings and an independent derivation. We show that the theory of these fields still admits a model companion in the language Lequation image = {+, –, ·, D, <1, …, model companion by CODFm and give a geometric axiomatization of this theory which uses basic notions of algebraic geometry and some generalized open subsets which appear naturally in this context. This axiomatization allows to recover the one given in [4] for the theory CODF of closed ordered differential fields. Most of the technics we use here are already present in [2] and [4].Finally, we prove that it is possible to describe the completions of CODFm and to obtain quantifier elimination in a slightly enriched language. This generalizes van den Dries' results in the “derivation free” case. (shrink)

This paper establishes model-theoretic properties of \, a variation of monadic first-order logic that features the generalised quantifier \. We will also prove analogous versions of these results in the simpler setting of monadic first-order logic with and without equality and \, respectively). For each logic \ we will show the following. We provide syntactically defined fragments of \ characterising four different semantic properties of \-sentences: being monotone and continuous in a given set of monadic predicates; having truth preserved (...) under taking submodels or being truth invariant under taking quotients. In each case, we produce an effectively defined map that translates an arbitrary sentence \ to a sentence \ belonging to the corresponding syntactic fragment, with the property that \ is equivalent to \ precisely when it has the associated semantic property. As a corollary of our developments, we obtain that the four semantic properties above are decidable for \-sentences. (shrink)

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)

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)

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.

We present recent results on the model companions of set theory, placing them in the context of a current debate in the philosophy of mathematics. We start by describing the dependence of the notion of model companionship on the signature, and then we analyze this dependence in the specific case of set theory. We argue that the most natural model companions of set theory describe (as the signature in which we axiomatize set theory (...) varies) theories of $H_{\kappa ^+}$, as $\kappa $ ranges among the infinite cardinals. We also single out $2^{\aleph _0}=\aleph _2$ as the unique solution of the continuum problem which can (and does) belong to some model companion of set theory (enriched with large cardinal axioms). While doing so we bring to light that set theory enriched by large cardinal axioms in the range of supercompactness has as its model companion (with respect to its first order axiomatization in certain natural signatures) the theory of $H_{\aleph _2}$ as given by a strong form of Woodin’s axiom $(*)$ (which holds assuming $\mathsf {MM}^{++}$ ). Finally this model-theoretic approach to set-theoretic validities is explained and justified in terms of a form of maximality inspired by Hilbert’s axiom of completeness. (shrink)

Lipsey and Lancaster's "general theory of second best" is widely thought to have significant implications for applied theorizing about the institutions and policies that most effectively implement abstract normative principles. It is also widely thought to have little significance for theorizing about which abstract normative principles we ought to implement. Contrary to this conventional wisdom, I show how the second-best theorem can be extended to myriad domains beyond applied normative theorizing, and in particular to more abstract theorizing about the (...) normative principles we should aim to implement. I start by separating the mathematical model used to prove the second-best theorem from its familiar economic interpretation. I then develop an alternative normative-theoretic interpretation of the model, which yields a novel second best theorem for idealistic normative theory. My method for developing this interpretation provides a template for developing additional interpretations that can extend the reach of the second-best theorem beyond normative theoretical domains. I also show how, within any domain, the implications of the second-best theorem are more specific than is typically thought. I conclude with some brief remarks on the value of mathematical models for conceptual exploration. (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)

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)

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)

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)

Let G be a finite group. We explore the model-theoretic properties of the class of differential fields of characteristic zero in m commuting derivations equipped with a G-action by differential fie...

Husserl’s philosophy of mathematics, his metatheory, and his transcendental phenomenology have a sophisticated and systematic interrelation that remains relevant for questions of ontology today. It is well established that Husserl anticipated many aspects of model theory. I focus on this aspect of Husserl’s philosophy in order to argue that Thomasson’s recent pleonastic reconstruction of Husserl’s approach to essences is incompatible with Husserl’s philosophy as a whole. According to the pleonastic approach, Husserl can appeal to essences in the absence (...) of a positive metaphysical account of their nature. I show, using central results from recent model theory, that the pleonastic approach undermines Husserl’s approach to formalization and categoricity, an effect that will ripple out from Husserl’s philosophy of mathematics into Husserl’s metatheory and transcendental phenomenology. The result is that Husserl cannot appeal to formal essences without metaphysical commitments. However, the very observations Thomasson makes about the nature of eidetic intuition in Husserl lead to a general strategy for responding to the problem. The article thus illustrates that the pleonastic and the model-theoretic routes for making Husserl relevant to present-day ontology are competing approaches, but I conclude that Husserl scholars seeking to set Husserl’s present-day relevance into sharp relief could do worse than to emphasize the model-theoretic nature of Husserl’s enterprise. (shrink)

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)

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)

This book is the first modern introduction to the logic of infinitary languages in forty years, and is aimed at graduate students and researchers in all areas of mathematical logic. Connections between infinitary model theory and other branches of mathematical logic, and applications to algebra and algebraic geometry are both comprehensively explored.

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)

This article outlines a theory of naive probability. According to the theory, individuals who are unfamiliar with the probability calculus can infer the probabilities of events in an extensional way: They construct mental models of what is true in the various possibilities. Each model represents an equiprobable alternative unless individuals have beliefs to the contrary, in which case some models will have higher probabilities than others. The probability of an event depends on the proportion of models in (...) which it occurs. The theory predicts several phenomena of reasoning about absolute probabilities, including typical biases. It correctly predicts certain cognitive illusions in inferences about relative probabilities. It accommodates reasoning based on numerical premises, and it explains how naive reasoners can infer posterior probabilities without relying on Bayes's theorem. Finally, it dispels some common misconceptions of probabilistic reasoning. (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 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)

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)

he model theory of groups of unitriangular matrices over rings is studied. An important tool in these studies is a new notion of a quasiunitriangular group. The models of the theory of all unitriangular groups are algebraically characterized; it turns out that all they are quasiunitriangular groups. It is proved that if R and S are domains or commutative associative rings then two quasiunitriangular groups over R and S are isomorphic only if R and S are isomorphic (...) or antiisomorphic. This algebraic result is new even for ordinary unitriangular groups. The groups elementarily equivalent to a single unitriangular group UTn are studied. If R is a skew field, they are of the form UTn, for some S ≡ R. In general, the situation is not so nice. Examples are constructed demonstrating that such a group need not be a unitriangular group over some ring; moreover, there are rings P and R such that UTn ≡ UTn, but UTn cannot be represented in the form UTn for S ≡ R. We also study the number of models in a power of the theory of a unitriangular group. In particular, we prove that, for any communicative associative ring R and any infinite power λ, I = I). We construct an associative ring such that I = 3 and I) = 2. We also study models of the theory of UTn in the case of categorical R. (shrink)

Model theorists have been studying analytic functions since the late 1970s. Highlights include the seminal work of Denef and van den Dries on the theory of the p-adics with restricted analytic functions, Wilkie's proof of o-minimality of the theory of the reals with the exponential function, and the formulation of Zilber's conjecture for the complex exponential. My goal in this talk is to survey these main developments and to reflect on today's open problems, in particular for theories (...) of valued fields. (shrink)

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.

Researchers currently working on relational reasoning typically argue that mental model theory (MMT) is a better account than the inference rule approach (IRA). They predict and observe that determinate (or one-model) problems are easier than indeterminate (or two-model) problems, whereas according to them, IRA should lead to the opposite prediction. However, the predictions attributed to IRA are based on a mistaken argument. The IRA is generally presented in such a way that inference rules only deal with (...) determinate relations and not with indeterminate ones. However, (a) there is no reason to presuppose that a rule-based procedure could not deal with indeterminate relations, and (b) applying a rule-based procedure to indeterminate relations should result in greater difficulty. Hence, none of the recent articles devoted to relational reasoning currently presents a conclusive case for discarding IRA by using the well-known determinate vs indeterminate problems comparison. (shrink)