In recent papers Hans Halvorson has offered a critique of the semantic view of theories, showing that theories may be the same although the corresponding sets of models are different and, conversely, that theories may be different although the corresponding sets of models are the same. This critique will be assessed, first, as it pertains to issues concerning scientific models in the empirical sciences and, second, independent of any concern with empirical science.

Frege’s project has been characterized as an attempt to formulate a complete system of logic adequate to characterize mathematical theories such as arithmetic and set theory. As such, it was seen to fail by Gödel’s incompleteness theorem of 1931. It is argued, however, that this is to impose a later interpretation on the word ‘complete’ it is clear from Dedekind’s writings that at least as good as interpretation of completeness is categoricity. Whereas few interesting first-order mathematical theories are categorical or (...) complete, there are logical extensions of these theories into second-order and by the addition of generalized quantifiers which are categorical. Frege’s project really found success through Gödel’s completeness theorem of 1930 and the subsequent development of first- and higher-order model theory. (shrink)

The class of all Artinian local rings of length at most l is ∀ 2 -elementary, axiomatised by a finite set of axioms Art l . We show that its existentially closed models are Gorenstein, of length exactly l and their residue fields are algebraically closed, and, conversely, every existentially closed model is of this form. The theory Got l of all Artinian local Gorenstein rings of length l with algebraically closed residue field is model complete and the theory Art (...) l is companionable, with model-companion Got l. (shrink)

Model theory is concerned mainly, although not exclusively, with infinite structures. In recent years, finite structures have risen to greater prominence, both within the context of mainstream model theory, e.g., in work of Lachlan, Cherlin, Hrushovski, and others, and with the advent of finite model theory, which incorporates elements of classical model theory, combinatorics, and complexity theory. The purpose of this survey is to provide an overview of what might be called the model theory of finite structures. Some topics in (...) finite model theory have strong connections to theoretical computer science, especially descriptive complexity theory. In fact, it has been suggested that finite model theory really is, or should be, logic for computer science. These connections with computer science will, however, not be treated here.It is well-known that many classical results of ‘infinite model theory’ fail over the class of finite structures, including the compactness and completeness theorems, as well as many preservation and interpolation theorems. The failure of compactness in the finite, in particular, means that the standard proofs of many theorems are no longer valid in this context. At present, there is no known example of a classical theorem that remains true over finite structures, yet must be proved by substantially different methods. It is generally concluded that first-order logic is ‘badly behaved’ over finite structures.From the perspective of expressive power, first-order logic also behaves badly: it is both too weak and too strong. Too weak because many natural properties, such as the size of a structure being even or a graph being connected, cannot be defined by a single sentence. Too strong, because every class of finite structures with a finite signature can be defined by an infinite set of sentences. Even worse, every finite structure is defined up to isomorphism by a single sentence. In fact, it is perhaps because of this last point more than anything else that model theorists have not been very interested in finite structures. Modern model theory is concerned largely with complete first-order theories, which are completely trivial here. (shrink)

A Boolean product construction is used to give examples of existentially closed algebras in the universal Horn class ISP generated by a universal classKof finitely subdirectly irreducible algebras such that Γa has the Fraser-Horn property. If ⟦a≠b⟧ ∩ ⟦c≠d⟧ = ∅ is definable inKandKhas a model companion ofK-simple algebras, then it is shown that ISP has a model companion. Conversely, a sufficient condition is given for ISP to have no model companion.

This paper is a critical response to Andreas Bartels’ sophisticated defense of a structural account of scientific representation. We show that, contrary to Bartels’ claim, homomorphism fails to account for the phenomenon of misrepresentation. Bartels claims that homomorphism is adequate in two respects. First, it is conceptually adequate, in the sense that it shows how representation differs from misrepresentation and non-representation. Second, if properly weakened, homomorphism is formally adequate to accommodate misrepresentation. We question both claims. First, we show that homomorphism (...) is not the right condition to distinguish representation from misrepresentation and non-representation: a “representational mechanism” actually does all the work, and it is independent of homomorphism – as of any structural condition. Second, we test the claim of formal adequacy against three typical kinds of inaccurate representation in science which, by reference to a discussion of the notorious billiard ball model, we define as abstraction, pretence, and simulation. We first point out that Bartels equivocates between homomorphism and the stronger condition of epimorphism, and that the weakened form of homomorphism that Bartels puts forward is not a morphism at all. After providing a formal setting for abstraction, pretence and simulation, we show that for each morphism there is at least one form of inaccurate representation which is not accommodated. We conclude that Bartels’ theory – while logically laying down the weakest structural requirements – is nonetheless formally inadequate in its own terms. This should shed serious doubts on the plausibility of any structural account of representation more generally. (shrink)

The concept ofsemantic interpretation is a source of chronic confusion: the introduction of a notion ofinterpretation can be the result of several quite different kinds of considerations.Interpretation can be understood in at least three ways: as a process of dis-abstraction of formulas, as technical tool for the sake of characterizing truth, or as a reconstruction of meaning-assignment. However essentially different these motifs are and however properly they must be kept apart, these can all be brought to one and the same (...) notion of interpretation: to the notion of a compositional evaluation of expressions inducing a possible distribution of truth values among statements. (shrink)

Axiomatizations of measurement systems usually require an axiom--called an Archimedean axiom--that allows quantities to be compared. This type of axiom has a different form from the other measurement axioms, and cannot--except in the most trivial cases--be empirically verified. In this paper, representation theorems for extensive measurement structures without Archimedean axioms are given. Such structures are represented in measurement spaces that are generalizations of the real number system. Furthermore, a precise description of "Archimedean axioms" is given and it is shown that (...) in all interesting cases "Archimedean axioms" are independent of other measurement axioms. (shrink)

Cet essai cherche à faire de la complémentarité entre énergie-idée, structure et fonction, et autres couples de concepts, la base d'une nouvelle ontologie qui puisse résoudre les conflits entre les pôles de description « mental » et « physique », entre la vérité mathématique et la vérité empirique et entre la mécanique quantique et la théorie de la relativité comme formes rivales d'explication scientifique. L'auteur y plaide en faveur de la fermeture déductive de l'univers à la lumière de la relation (...) logique entre le nombre et l'alphabet . Il y présente la réalité et l'autonomie conceptuelle des idées comme une alternative au platonisme et à d'autres idéologies. Il dispose de fausses interprétations, malentendus, et objections au moyen du dialogue.Conjugacy between energy-idea, structure and function, and other concept pairs is made the basis for a new ontology which resolves the conflicts between "mental" and "physical" poles of description, between mathematical and empirical truth, and between quantum mechanics and relativity theory as rival forms of scientific explanation. The deductive closure of the universe is argued for, in light of the logical connection between number and the alphabet . The reality and the conceptual autonomy of ideas are presented as an alternative to Platonism and other ideologies. Mistaken interpretations, misunderstandings and objections are handled through the medium of dialogue. (shrink)

Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary predicate symbols.Monadic second order logic over infinite words can alternatively be described as a first-order logic interpreted in${\cal P}\left$, the power set Boolean algebra of the natural numbers, equipped with modal operators for ‘initial’, ‘next’, and ‘future’ states. We prove that the first-order theory (...) of this structure is the model companion of a class of algebras corresponding to a version of linear temporal logic without until.The proof makes crucial use of two classical, nontrivial results from the literature, namely the completeness of LTL with respect to the natural numbers, and the correspondence between S1S-formulas and Büchi automata. (shrink)

Pour le philosophe intéressé aux structures et aux fondements du savoir théorétique, à la constitution d'une « méta-théorétique «, θεωρíα., qui, mieux que les « Wissenschaftslehre » fichtéenne ou husserlienne et par-delà les débris de la métaphysique, veut dans une intention nouvelle faire la synthèse du « théorétique », la logique mathématique se révèle un objet privilégié.

Though deceptively simple and plausible on the face of it, Craig's interpolation theorem (published 50 years ago) has proved to be a central logical property that has been used to reveal a deep harmony between the syntax and semantics of first order logic. Craig's theorem was generalized soon after by Lyndon, with application to the characterization of first order properties preserved under homomorphism. After retracing the early history, this article is mainly devoted to a survey of subsequent generalizations and applications, (...) especially of many-sorted interpolation theorems. Attention is also paid to methodological considerations, since the Craig theorem and its generalizations were initially obtained by proof-theoretic arguments while most of the applications are model-theoretic in nature. The article concludes with the role of the interpolation property in the quest for "reasonable" logics extending first-order logic within the framework of abstract model theory. (shrink)

Any two models of arithmetic can be jointly embedded in a third with any prescribed isomorphic submodels as intersection and any prescribed relative ordering of the skies above the intersection. Corollaries include some known and some new theorems about ultrafilters on the natural numbers, for example that every ultrafilter with the "4 to 3" weak Ramsey partition property is a P-point. We also give examples showing that ultrafilters with the "5 to 4" partition property need not be P-points and that (...) the main theorem cannot be improved to allow a prescribed ordering of lower skies. (shrink)

The model companion of the theory of fields with valuation and automorphism exists. A counterexample shows that the theory of models of ACFA equipped with valuation is not this model companion.