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

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

Provability, Computability and Reflection.

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.

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.

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)

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

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)

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)

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 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 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 study the model theory of fields k carrying a henselian valuation with real closed residue field. We give a criteria for elementary equivalence and elementary inclusion of such fields involving the value group of a not necessarily definable valuation. This allows us to translate theories of such fields to theories of ordered abelian groups, and we study the properties of this translation. We also characterize the first-order definable convex subgroups of a given ordered abelian group and prove (...) that the definable real valuation rings of k are in correspondence with the definable convex subgroups of the value group of a certain real valuation of k. (shrink)

This paper develops the model theory of ordered structures that satisfy Keisler’s regularity scheme and its strengthening REF ${(\mathcal{L})}$ (the reflection scheme) which is an analogue of the reflection principle of Zermelo-Fraenkel set theory. Here ${\mathcal{L}}$ is a language with a distinguished linear order <, and REF ${(\mathcal {L})}$ consists of formulas of the form $$\exists x \forall y_{1} < x \ldots \forall y_{n} < x \varphi (y_{1},\ldots ,y_{n})\leftrightarrow \varphi^{ < x}(y_1, \ldots ,y_n),$$ where φ is an (...) ${\mathcal{L}}$ -formula, φ theory T in a countable language ${\mathcal{L}}$ with a distinguished linear order:Some model of T has an elementary end extension with a first new element.T ⊢ REF ${(\mathcal{L})}$ .T has an ω 1-like model that continuously embeds ω 1.For some regular uncountable cardinal κ, T has a κ-like model that continuously embeds a stationary subset of κ.For some regular uncountable cardinal κ, T has a κ-like model ${\mathfrak{M}}$ that has an elementary extension in which the supremum of M exists.Moreover, if κ is a regular cardinal satisfying κ = κ <κ , then each of the above conditions is equivalent to: T has a κ + -like model that continuously embeds a stationary subset of κ. (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.

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.

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)

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)

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)

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...

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.

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)

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.

I study definability and types in the linear fragment of continuous logic. Linear variants of several definability theorems such as Beth, Svenonus and Herbrand are proved. At the end, a partial study of the theories of probability algebras, probability algebras with an aperiodic automorphism and AL-spaces is given.

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)

Generalizing and unifying the known theorems for difference and differential fields, it is shown that for every finite free algebra scheme.

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)

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 give a survey of results obtained in the model theory of finite and pseudo-finite fields.

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)

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)

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)

Drawing on the analogy between any unary first-order quantifier and a "face operator," this paper establishes several connections between model theory and homotopy theory. The concept of simplicial set is brought into play to describe the formulae of any first-order language L, the definable subsets of any L-structure, as well as the type spaces of any theory expressed in L. An adjunction result is then proved between the category of o-minimal structures and a subcategory of the (...) category of linearly ordered simplicial sets with distinguished vertices. (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)

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)

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)

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.

Take a formula of first-order logic which is a logical consequence of some other formulae according to model theory, and in all those formulae replace schematic letters with English expressions. Is the argument resulting from the replacement valid in the sense that the premisses could not have been true without the conclusion also being true? Can we reason from the model-theoretic concept of logical consequence to the modal concept of validity? Yes, if the model theory (...) is the standard one for sentential logic; no, if it is the standard one for the predicate calculus; and yes, if it is a certain model theory for free logic. These conclusions rely inter alia on some assumptions about possible worlds, which are mapped into the models of model theory. Plural quantification is used in the last section, while part of the reasoning is relegated to an appendix that includes a proof of completeness for a version of free logic. (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.

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)

We explore some topics in the model theory of sheaves of modules. First we describe the formal language that we use. Then we present some examples of sheaves obtained from quivers. These, and other examples, will serve as illustrations and as counterexamples. Then we investigate the notion of strong minimality from model theory to see what it means in this context. We also look briefly at the relation between global, local and pointwise versions of properties related (...) to acyclicity. (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.

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)