An introduction to the model-theoretic approach in the philosophy of science is given and it is argued that this program is further enhanced by the introduction of partial structures. It is then shown that this leads to a natural and intuitive account of both "iconic" and mathematical models and of the role of the former in science itself.

An introduction to the model-theoretic approach in the philosophy of science is given and it is argued that this program is further enhanced by the introduction of partial structures. It is then shown that this leads to a natural and intuitive account of both "iconic" and mathematical models and of the role of the former in science itself.

My model-theoretic realist account of science places linguistic systems and the corresponding non-linguistic structures at different stages of the scientific process. It is shown that science and its progress cannot be analysed in terms of only one of these strata. Philosophy of science literature offers mainly two approaches; to the structure of scientific knowledge analysed in terms of theories and their models, the "statement" and the "non-statement" approaches. In opposition to the statement approach's belief that scientific knowledge is embodied in (...) theories symbolic language) with direct interpretative links---via so-called "bridge principles"---to reality, the defenders of the non-statement approach believe in an analysis where the language in which the theory is formulated plays a much smaller role than the structures which satisfy that theory. ;The model-theoretic realism expounded here retains the notion of a scientific theory as a set of sentences, while simultaneously emphasising the interpretative role of the conceptual models of these theories. My criticism against the non-statement approach is based on the fact that merely "giving" the theory "in terms of" its mathematical structures leaves out any real interpretation of the nature and role of general terms in science. Against the statement approach's "direct" linking of general theoretical terms to reality, my approach interpolates models between theories and reality in the interpretative chain. ;The links between the general terms of scientific theories and their interpretations in the various models of the theory regulate the whole referential process. The terms of a theory are "general" in the sense that they are the result of certain abstractive conceptualisations of the object of scientific investigation and subsequent linguistic formulations of these conceptualisations. Their meanings can be "given back" only by interpreting them in the limited context, of the various conceptual models of their theory and, finally, by finding an isomorphic relation between some substructure of the conceptual model in question and some empirical conceptualisation of relevant experimental data. In this sense the notion of scientific "truth" becomes inextricably linked with that of articulated reference, as it---given its model-dependent nature---should be. (shrink)

This book brings together several directions of work in model theory between the late 1950s and early 1980s.

This paper studies some model-theoretic properties of special groups of finite type. Special groups are a first-order axiomatization of the algebraic theory of quadratic forms, introduced by Dickmann and Miraglia, which is essentially equivalent to abstract Witt rings. More precisely, we consider elementary equivalence, saturation, elementary embeddings, quantifier elimination, stability and Morley rank.

In this paper I investigate Putnam’s model-theoretic argument from a transcendent standpoint, in spite of Putnam’s well-known objections to such a standpoint. This transcendence, however, requires ascent to something more like a Tarskian meta-level than what Putnam regards as a “God’s eye view”. Still, it is methodologically quite powerful, leading to a significant increase in our investigative tools. The result is a shift from Putnam’s skeptical conclusion to a new understanding of realism, truth, correspondence, knowledge, and theories, or certain aspects (...) thereof, based on, among other things, a better understanding of what models are designed (and not designed) to do. (shrink)

We use model-theoretic methods described in [3] to obtain ordinal analyses of a number of theories of first- and second-order arithmetic, whose proof-theoretic ordinals are less than or equal to Γ0.

We introduce and study the model-theoretic notions of absolute connectedness and type-absolute connectedness for groups. We prove that groups of rational points of split semisimple linear groups (that is, Chevalley groups) over arbitrary infinite fields are absolutely connected and characterize connected Lie groups which are type-absolutely connected. We prove that the class of type-absolutely connected group is exactly the class of discretely topologized groups with the trivial Bohr compactification, that is, the class of minimally almost periodic groups.

This contribution is concerned with a particular model theoretic semantics of the object language of quantum physics. The object language considered here comprises logically connected propositions, sequentially connected propositions and modal propositions. The model theoretic semantics arises from the already established dialogic semantics, if the pragmatic concept of the dialog-game is replaced by a "metaphysical" concept of the game. The game is determined by a game tree, the branches of which constitute a set, the set of "possible worlds" of an (...) individual quantum physical system. The semantic concepts like truth, falsity and valuation are defined with respect to this set. (shrink)

We analyze model-theoretic connected components in extensions of a given group by abelian groups which are defined by means of 2-cocycles with finite image. We characterize, in terms of these 2-cocycles, when the smallest type-definable subgroup of the corresponding extension differs from the smallest invariant subgroup. In some situations, we also describe the quotient of these two connected components. Using our general results about extensions of groups together with Matsumoto–Moore theory or various quasi-characters considered in bounded cohomology, we obtain new (...) classes of examples of groups whose smallest type-definable subgroup of bounded index differs from the smallest invariant subgroup of bounded index. This includes the first known example of a group with this property found by Conversano and Pillay, namely the universal cover of [Formula: see text], as well as various examples of different nature, e.g. some central extensions of free groups or of fundamental groups of closed orientable surfaces. As a corollary, we get that both non-abelian free groups and fundamental groups of closed orientable surfaces of genus [Formula: see text], expanded by predicates for all subsets, have this property, too. We also obtain a variant of the example of Conversano and Pillay for [Formula: see text] instead of [Formula: see text], which was not accessible by the previously known methods. (shrink)

This book presents a detailed treatment of ordinal combinatorics of large sets tailored for independence results. It uses model theoretic and combinatorial methods to obtain results in proof theory, such as incompleteness theorems or a description of the provably total functions of a theory. In the first chapter, the authors first discusses ordinal combinatorics of finite sets in the style of Ketonen and Solovay. This provides a background for an analysis of subsystems of Peano Arithmetic as well as for combinatorial (...) independence results. Next, the volume examines a variety of proofs of Gödel's incompleteness theorems. The presented proofs differ strongly in nature. They show various aspects of incompleteness phenomena. In additon, coverage introduces some classical methods like the arithmetized completeness theorem, satisfaction predicates or partial satisfaction classes. It also applies them in many contexts. The fourth chapter defines the method of indicators for obtaining independence results. It shows what amount of transfinite induction we have in fragments of Peano arithmetic. Then, it uses combinatorics of large sets of the first chapter to show independence results. The last chapter considers nonstandard satisfaction classes. It presents some of the classical theorems related to them. In particular, it covers the results by S. Smith on definability in the language with a satisfaction class and on models without a satisfaction class. Overall, the book's content lies on the border between combinatorics, proof theory, and model theory of arithmetic. It offers readers a distinctive approach towards independence results by model-theoretic methods. (shrink)

The first section of the paper gives a very condensed history of the evolution of the author’s views on realism and anti-realism. It emphasizes that his previously accepted form of anti-realism was abandoned not because of the alleged fallacies in the model-theoretic argument against metaphysical realism, but due to his rejection of some of the assumptions on which it rests - assumptions which have been almost universal in philosophy after Descartes. The second section discusses and defends the part of the (...) model-theoretic argument that many critics have almost universally found fallacious, namely the „just more theory” move. In the appendix to the paper the author elaborates what does his return to common sense realism mean. He points out that his position involves a negative element, the rejection of the idea that truth cannot outrun verifiability, and two positive elements: returning (as close as possible) to „naive realism” with respect to perception, and a disquotational account of truth similar to one endorsed by Wittgenstein. (shrink)

We present a framework for model theoretic forcing in a non first order context, and present some applications of this framework to Banach space theory.

We describe a model-theoretic approach to ordinal analysis via the finite combinatorial notion of an α-large set of natural numbers. In contrast to syntactic approaches that use cut elimination, this approach involves constructing finite sets of numbers with combinatorial properties that, in nonstandard instances, give rise to models of the theory being analyzed. This method is applied to obtain ordinal analyses of a number of interesting subsystems of first- and second-order arithmetic.

We give a model-theoretic proof of the fact that for all infinite Abelian groups P ≠ NP in the sense of binary nondeterminism. This result has been announced 1994 by Christine Gabner.

Revenge arguments purport to show that any proposed solution to the semantic paradoxes generates new paradoxes that prove that solution to be inadequate. In this paper, I focus on revenge arguments that employ the model-theoretic semantics of a target theory and I argue, contra the current revenge-theoretic wisdom, that they can constitute genuine expressive limitations. I consider the anti-revenge strategy elaborated by Field and argue that it does not offer a way out of the revenge problem. More generally, I argue (...) that the difference between ‘standard’ and ‘revenge’ paradoxes is ill-conceived and should be abandoned. This will contribute to show that the theories that provide a uniform account of truth and other semantic notions are the ones best equipped to avoid the paradoxes altogether—‘standard’ and ‘revenge’ alike. (shrink)

We study model theoretic tree properties and their associated cardinal invariants. In particular, we obtain a quantitative refinement of Shelah’s theorem for countable theories, show that [Formula: see text] is always witnessed by a formula in a single variable and that weak [Formula: see text] is equivalent to [Formula: see text]. Besides, we give a characterization of [Formula: see text] via a version of independent amalgamation of types and apply this criterion to verify that some examples in the literature are (...) indeed [Formula: see text]. (shrink)

The model-theoretic argument, which Putnam employs to argue againstmetaphysical realism, has faced serious objections of many realist opponents.Igor Douven in his recent paper offers a new interpretation of the model-theoreticargument, which avoids the previous objections. The purpose of this paper is toshow that Douven's reconstruction of Putnam's argument is not successful, andhence that the realist objections still stand.

In the early days of natural language semantics, Donald Davidson issued a challenge to those, like Richard Montague, who would do semantics in a model-theoretic framework that gives a central role to a model-relative notion of truth. Davidson argued that no theory of this kind can claim to be an account of real truth conditions unless it first makes clear how the relativized notion relates to our ordinary non-relativized notion of truth. In the 1990s, Davidson’s challenge was developed by Etchemendy (...) into an argument against the model-theoretic account of logical consequence, one that also threatens the attempt to capture natural language entailment relations in modeltheoretic terms—one of the central desiderata of semantics. Nevertheless, the modeltheoretic framework has flourished within natural language semantics. But it has flourished without any consensus among semanticists as to how to answer Davidson’s challenge. The aim of this essay is to develop an answer. I argue that model-theoretic semantics is best understood as model-based science: a semantics for a natural language is a scientific model of truth conditions. This makes good sense of the way model-theoretic tools are used in natural language semantics. And it allows us to answer Davidson’s challenge by showing how a theory that employs a relativized notion of truth manages to tell us about ordinary truth conditions. Moreover, I argue that it helps us see how semantics can provide genuine explanations for natural language entailment and other truth-conditional phenomena. (shrink)

Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation, respectively. It is proved that a first-order formula is equivalent to a standard translation of an intuitionistic propositional formula iff it is invariant with respect to k-asimulations for some k, and then that a first-order formula is equivalent to a standard translation of an intuitionistic propositional formula iff it is invariant with respect to asimulations. Finally, it is proved that a first-order formula is equivalent to a (...) standard translation of an intuitionistic propositional formula over the class of intuitionistic Kripke models iff it is invariant with respect to asimulations between intuitionistic models. (shrink)

The present paper studies the general implications of theprinciple of compositionality for the organization of grammar.It will be argued that Janssen''s (1986) requirement that syntax andsemantics be similar algebras is too strong, and that the moreliberal requirement that syntax be interpretable into semanticsleads to a formalization that can be motivated and applied more easily,while it avoids the complications that encumber Janssen''s formalization.Moreover, it will be shown that this alternative formalization evenallows one to further complete the formal theory of compositionality, inthat (...) it is capable of clarifying the role played by translation,model-theoretic interpretation and meaning postulates,of which the latter two aspects received little or no attention inMontague (1970) and Janssen (1986). (shrink)

We prove that for a finitely generated infinite nilpotent group $G$ with structure $(G,\cdot,\dots)$, the connected component ${G^*}^0$ of a sufficiently saturated extension $G^*$ of $G$ exists and equals \[ \bigcap_{n\in\N} \{g^n\colon g\in G^*\}. \] We construct an expansion of ${\mathbb Z}$ by a predicate $({\mathbb Z},+,P)$ such that the type-connected component ${{\mathbb Z}^*}^{00}_{\emptyset}$ is strictly smaller than ${{\mathbb Z}^*}^0$. We generalize this to finitely generated virtually solvable groups. As a corollary of our construction we obtain an optimality result for (...) the van der Waerden theorem for finite partitions of groups. (shrink)

My aim has been to adapt Quine's criterion of the ontological commitment of theories couched in standard quantificational idiom to a much broader class of theories by focusing on the set-theoretic structure of the models of those theories. For standard first-order theories, the two criteria coincide on simple entities. Divergences appear as they are applied to higher-order theories and as composite entities are taken into account. In support of the extended criterion, I appeal to its fruits in treating the various (...) examples considered above and to the healthy intuitions of the non-noneists among us. Don't O(m) and E(m) comprise just the things we should have though existed according to a particular interpretation m of a language or a theory? Whatever the answer (and it will hardly be unanimous), I hope to have pointed the way towards a recognition of ontology as a worthwhile branch of modern theory. (shrink)

We point out how the "Fundamental Theorem of Stability Theory", namely the equivalence between the "non order property" and definability of types, proved by Shelah in the 1970s, is in fact an immediate consequence of Grothendieck's "Criteres de compacite" from 1952. The familiar forms for the defining formulae then follow using Mazur's Lemma regarding weak convergence in Banach spaces.

Adding certain cardinality quantifiers into first-order language will give substantially more expressive languages. Thus, many mathematical concepts beyond first-order logic can be handled. Since basic modal logic can be seen as the bisimular invariant fragment of first-order logic on the level of models, it has no ability to handle modally these mathematical concepts beyond first-order logic. By adding modalities regarding the cardinalities of successor states, we can, in principle, investigate modal logics of all cardinalities. Thus ways of exploring model-theoretic logics (...) can be transferred to modal logics. (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)

The semantic view of theoriesis one according to which theoriesare construed as models of their linguisticformulations. The implications of thisview for scientific realism have been little discussed. Contraryto the suggestion of various champions of the semantic view,it is argued that this approach does not makesupport for a plausible scientific realism anyless problematic than it might otherwise be.Though a degree of independence of theory fromlanguage may ensure safety frompitfalls associated with logical empiricism, realism cannot be entertained unless models or (abstractedand/or idealized) (...) aspects thereof are spelled out in terms of linguistic formulations (such as mathematical equations),which can be interpreted in terms of correspondencewith the world. The putative advantage of thesemantic approach – its linguistic independence – isthus of no help to the realist. I consider recent treatmentsof the model-theoretic view (Suppe, Giere, Smith), and find that although some of these accounts harbour the promiseof realism, this promise is deceptive. (shrink)

This chapter contains sections titled: Abstract The Model ‐ Theoretic Argument Difficulties and Differences Putnam's Progress Implications Objections and Replies References.

Adding certain cardinality quantifiers into first-order language will give substantially more expressive languages. Thus, many mathematical concepts beyond first-order logic can be handled. Since basic modal logic can be seen as the bisimular invariant fragment of first-order logic on the level of models, it has no ability to handle modally these mathematical concepts beyond first-order logic. By adding modalities regarding the cardinalities of successor states, we can, in principle, investigate modal logics of all cardinalities. Thus ways of exploring model-theoretic logics (...) can be transferred to modal logics. (shrink)

Weakly Aggregative Modal Logic ) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. \ has interesting applications on epistemic logic, deontic logic, and the logic of belief. In this paper, we study some basic model theoretical aspects of \. Specifically, we first give a van Benthem–Rosen characterization theorem of \ based on an intuitive notion of bisimulation. Then, in contrast to many well known normal or non-normal modal logics, we show (...) that each basic \ system \ lacks Craig interpolation. Finally, by model theoretical techniques, we show that an extension of \ does have Craig interpolation, as an example of amending the interpolation problem of \. (shrink)

One of the most signi cant drawbacks of classical logic is its being useless in the presence of an inconsistency. Nevertheless, the classical calculus is a very convenient framework to work with. In this work we propose means for drawing conclusions from systems that are based on classical logic, although the informationmightbe inconsistent. The idea is to detect those parts of the knowledge-base that \cause" the inconsistency, and isolate the parts that are \recoverable". We do this by temporarily switching into (...) Ginsberg/Fitting multi-valued framework of bilattices (which is a common framework for logic programmingand nonmonotonic reasoning). Our method is conservative in the sense that it considers the contradictory data as useless and regards all the remaining information una ected. The resulting logic is nonmonotonic, paraconsistent, and a plausibility logic in the sense of Lehmann. (shrink)

Infinitary languages are used to prove that any strong isomorphism of substructures of isomorphic structures can be extended to an isomorphism of the structures. If the structures are models of a theory that has quantifier elimination, any isomorphism of substructures is strong. This theorem is a partial generalization of Steinitz’s theorem for algebraically closed fields and has as special case the analogous theorem for differentially closed fields. In this note, we announce results which will be proved elsewhere. DOI: 10.5007/1808-1711.2011v15n1p107.

We examine topological dynamical systems on the Cantor set from the point of view of the continuous model theory of commutative C*-algebras. After some general remarks, we focus our attention on the generic homeomorphism of the Cantor set, as constructed by Akin, Glasner, and Weiss. We show that this homeomorphism is the prime model of its theory. We also show that the notion of “generic” used by Akin, Glasner, and Weiss is distinct from the notion of “generic” encountered in Fraïssé (...) theory. (shrink)

This work presents a model-theoretic approach to the study of first-order theories of classes of BL-chains. Among other facts, we present several classes of BL-algebras, generating the whole variety of BL-algebras, whose first-order theory has quantifier elimination. Model-completeness and decision problems are also investigated. Then we investigate classes of BL-algebras having (or not having) the amalgamation property or the joint embedding property and we relate the above properties to the existence of ultrahomogeneous models.

An exponential $\exp $ on an ordered field $$. The structure $$ is then called an ordered exponential field. A linearly ordered structure $$ is called o-minimal if every parametrically definable subset of M is a finite union of points and open intervals of M.The main subject of this thesis is the algebraic and model theoretic examination of o-minimal exponential fields $$ whose exponential satisfies the differential equation $\exp ' = \exp $ with initial condition $\exp = 1$. This study (...) is mainly motivated by the Transfer Conjecture, which states as follows:Any o-minimal exponential field $$ whose exponential satisfies the differential equation $\exp ' = \exp $ with initial condition $\exp =1$ is elementarily equivalent to $\mathbb {R}_{\exp }$.Here, $\mathbb {R}_{\exp }$ denotes the real exponential field $$, where $\exp $ denotes the standard exponential $x \mapsto \mathrm {e}^x$ on $\mathbb {R}$. Moreover, elementary equivalence means that any first-order sentence in the language $\mathcal {L}_{\exp } = \{+,-,\cdot,0,1, <,\exp \}$ holds for $$ if and only if it holds for $\mathbb {R}_{\exp }$.The Transfer Conjecture, and thus the study of o-minimal exponential fields, is of particular interest in the light of the decidability of $\mathbb {R}_{\exp }$. To the date, it is not known if $\mathbb {R}_{\exp }$ is decidable, i.e., whether there exists a procedure determining for a given first-order $\mathcal {L}_{\exp }$ -sentence whether it is true or false in $\mathbb {R}_{\exp }$. However, under the assumption of Schanuel’s Conjecture—a famous open conjecture from Transcendental Number Theory—a decision procedure for $\mathbb {R}_{\exp }$ exists. Also a positive answer to the Transfer Conjecture would result in the decidability of $\mathbb {R}_{\exp }$. Thus, we study o-minimal exponential fields with regard to the Transfer Conjecture, Schanuel’s Conjecture, and the decidability question of $\mathbb {R}_{\exp }$.Overall, we shed light on the valuation theoretic invariants of o-minimal exponential fields—the residue field and the value group—with additional induced structure. Moreover, we explore elementary substructures and extensions of o-minimal exponential fields to the maximal ends—the smallest elementary substructures being prime models and the maximal elementary extensions being contained in the surreal numbers. Further, we draw connections to models of Peano Arithmetic, integer parts, density in real closure, definable Henselian valuations, and strongly NIP ordered fields.Parts of this thesis were published in [2–5].Abstract prepared by Lothar Sebastian KrappE-mail: [email protected]: https://d-nb.info/1202012558/34. (shrink)

We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model- theoretic probabilistic reasoning and to default reasoning in System . In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of default reasoning in System (...) . That is, we provide a new probabilistic semantics for System , which neither uses infinitesimal probabilities nor atomic bound (or big-stepped) probabilities. These results also provide new algorithms for probabilistic reasoning under coherence and for default reasoning in System , and they give new insight into default reasoning with conditional objects. (shrink)

Ordinarily, in mathematical and scientific practice, the notion of a “theory” is understood as follows: (SCT) Standard Conception of Theories : A theory T is a collection of statements, propositions, conjectures, etc. A theory claims that things are thus and so. The theory may be true, and may be false. A theory T is true if things are as T says they are, and T is false if things are not as T says they are. One can make this Aristotelian (...) explanation more precise, as Tarski showed, in the cases where we understand how to give precise logical analyses of theories, by identifying an interpreted language L, Á) in which T may be formulated. Here L is some formalized language and Á is an L-interpretation. One can define the satisfaction relation ⊨, holding between L-sentences j and L-interpretations, and then define the notion L-sentence j is true in L, Á)” as Á ⊨ j”. What is essential about this is that theories are truth bearers . They are bearers of semantic properties. (shrink)

The major argument against Ramsey-style epistemic structural realism is the model-theoretic refinement of Newman’s objection against Russell, presented in Ketland : 409–424, 2004), where a technical result is interpreted as showing that the Ramsey-sentence approach collapses into instrumentalism. This paper addresses some questions raised by the application of model theory to the scientific realism debate. Firstly, I will suggest three different formal semantics for the positions in the debate. Then, some technicalities of Ketland’s result will be scrutinized in light of (...) comments by Zahar and Demopoulos. Finally, I will formalize Ketland’s argument by means of an intensional operator and focus on one problematic premise. The conclusion is that, with some adjustments, the Ramsey-sentence approach can represent an intermediate position between realism and instrumentalism, but the term “structuralism” does not suit it well. (shrink)