Model Theory

The indefinability of concepts is explored through the idea of a conceptual scheme. Using the Stone duality of Boolean algebras indefinable concepts are categorized as specific types of subspaces. Additionally, indefinability is formulated as a type of algebraic independence and conceptual atomism is investigated from a mathematical perspective.

The Elementary Process Theory (EPT) is a collection of seven elementary process-physical principles that describe the individual processes by which interactions have to take place for repulsive gravity to exist. One of the two main problems of the EPT is that there is no proof that the four fundamental interactions (gravitational, electromagnetic, strong, and weak) as we know them can take place in the elementary processes described by the EPT. This paper sets forth the method by which it can be (...) proven that the EPT agrees with the knowledge that derives from the successful predictions of a modern interaction theory T. This determines a fundamentally new research program in theoretical physics. (shrink)

At its strongest, Hume's problem of induction denies the existence of any well justified assumptionless inductive inference rule. At the weakest, it challenges our ability to articulate and apply good inductive inference rules. This paper examines an analysis that is closer to the latter camp. It reviews one answer to this problem drawn from the VC theorem in statistical learning theory and argues for its inadequacy. In particular, I show that it cannot be computed, in general, whether we are in (...) a situation where the VC theorem can be applied for the purpose we want it to. (shrink)

We prove that the two-variable fragment of first-order logic has the weak Beth definability property. This makes the two-variable fragment a natural logic separating the weak and the strong Beth properties since it does not have the strong Beth definability property.

We build a new spectrum of recursive models (SRM(T)) of a strongly minimal theory. This theory is non-disintegrated, flat, model complete, and in a language with a finite structure.

We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to $\mathsf {DC}$ -preserving symmetric submodels of forcing extensions. Hence, $\mathsf {ZF}+\mathsf {DC}$ not only provides the right framework for developing classical analysis, but is also the right base theory over which to safeguard truth in analysis from the independence phenomenon in the presence of (...) large cardinals. We also investigate some basic consequences of the Proper Forcing Axiom in $\mathsf {ZF}$, and formulate a natural question about the generic absoluteness of the Proper Forcing Axiom in $\mathsf {ZF}+\mathsf {DC}$ and $\mathsf {ZFC}$. Our results confirm $\mathsf {ZF} + \mathsf {DC}$ as a natural foundation for a significant portion of “classical mathematics” and provide support to the idea of this theory being also a natural foundation for a large part of set theory. (shrink)

This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on classes given by universal and universal-existential sentences. In particular, we prove two amalgamation results using the technique of diagrams in the setting of structures valued on a finite MTL-algebra, from which analogues of the Łoś–Tarski and the Chang–Łoś–Suszko preservation theorems follow.

If two self-connected individuals are connected, it follows in classical extensional mereotopology that the sum of those individuals is self-connected too. Since mainland Europe and mainland Asia, for example, are both self-connected and connected to each other, mainland Eurasia is also self-connected. In contrast, in non-extensional mereotopologies, two individuals may have more than one sum, in which case it does not follow from their being self-connected and connected that the sum of those individuals is self-connected too. Nevertheless, one would still (...) expect it to follow that a sum of connected self-connected individuals is self-connected too. In this paper, we present some surprising countermodels which show that this conjecture is incorrect. (shrink)

This paper clarifies, revises, and extends the account of the transmission of truthmakers by core proofs that was set out in chap. 9 of Tennant. Brauer provided two kinds of example making clear the need for this. Unlike Brouwer’s counterexamples to excluded middle, the examples of Brauer that we are dealing with here establish the need for appeals to excluded middle when applying, to the problem of truthmaker-transmission, the already classical metalinguistic theory of model-relative evaluations.

We propose in this paper a family of algebraic models of ZFC based on the three-valued paraconsistent logic LPT0, a linguistic variant of da Costa and D’Ottaviano’s logic J3. The semantics is given by twist structures defined over complete Boolean agebras. The Boolean-valued models of ZFC are adapted to twist-valued models of an expansion of ZFC by adding a paraconsistent negation. This allows for inconsistent sets w satisfying ‘not (w = w)’, where ‘not’ stands for the paraconsistent negation. Finally, our (...) framework is adapted to provide a class of twist-valued models generalizing Löwe and Tarafder’s model based on logic (PS 3,∗), showing that they are paraconsistent models of ZFC. The present approach offers more options for investigating independence results in paraconsistent set theory. (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)

We set up a general context in which one can prove Sauer-Shelah type lemmas. We apply our general results to answer a question of Bhaskar [1] and give a slight improvement to a result of Malliaris and Terry [7]. We also prove a new Sauer-Shelah type lemma in the context of op-rank, a notion of Guingona and Hill [4].

We study the logic of so-called lexicographic or priority merge for multi-agent plausibility models. We start with a systematic comparison between the logical behavior of priority merge and the more standard notion of pooling through intersection, used to define, for instance, distributed knowledge. We then provide a sound and complete axiomatization of the logic of priority merge, as well as a proof theory in labeled sequents that admits cut. We finally study Moorean phenomena and define a dynamic resolution operator for (...) priority merge for which we also provide a complete set of reduction axioms. (shrink)

Inquisitive first-order logic, InqBQ, is a system which extends classical first-order logic with formulas expressing questions. From a mathematical point of view, formulas in this logic express properties of sets of relational structures. This paper makes two contributions to the study of this logic. First, we describe an Ehrenfeucht–Fraïssé game for InqBQ and show that it characterizes the distinguishing power of the logic. Second, we use the game to study cardinality quantifiers in the inquisitive setting. That is, we study what (...) statements and questions can be expressed in InqBQ about the number of individuals satisfying a given predicate. As special cases, we show that several variants of the question how many individuals satisfy α(x) are not expressible in InqBQ, both in the general case and in restriction to finite models. (shrink)

In this paper we study the relativized Lascar Galois group of a strong type. The group is a quasi-compact connected topological group, and if in addition the underlying theory T is G-compact, then the group is compact. We apply compact group theory to obtain model theoretic results in this note. -/- For example, we use the divisibility of the Lascar group of a strong type to show that, in a simple theory, such types have a certain model theoretic property that (...) we call divisible amalgamation. -/- The main result of this paper is that if c is a finite tuple algebraic over a tuple a, the Lascar group of stp(ac) is abelian, and the underlying theory is G-compact, then the Lascar groups of stp(ac) and of stp(a) are isomorphic. To show this, we prove a purely compact group-theoretic result that any compact connected abelian group is isomorphic to its quotient by every finite subgroup. -/- Several (counter)examples arising in connection with the theoretical development of this note are presented as well. For example, we show that, in the main result above, neither the assumption that the Lascar group of stp(ac) is abelian, nor the assumption of c being finite can be removed. (shrink)

As a new type of epistemic logics, the logics of knowing how capture the high-level epistemic reasoning about the knowledge of various plans to achieve certain goals. Existing work on these logics focuses on axiomatizations; this paper makes the first study of their model theoretical properties. It does so by introducing suitable notions of bisimulation for a family of five knowing how logics based on different notions of plans. As an application, we study and compare the expressive power of these (...) logics. (shrink)

We introduce a relational semantics based on poset products, and provide sufficient conditions guaranteeing its soundness and completeness for various substructural logics. We also demonstrate that our relational semantics unifies and generalizes two semantics already appearing in the literature: Aguzzoli, Bianchi, and Marra’s temporal flow semantics for Hájek’s basic logic, and Lewis-Smith, Oliva, and Robinson’s semantics for intuitionistic Łukasiewicz logic. As a consequence of our general theory, we recover the soundness and completeness results of these prior studies in a uniform (...) fashion, and extend them to infinitely-many other substructural logics. (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)

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

A complete list of one dimensional groups definable in the p-adic numbers is given, up to a finite index subgroup and a quotient by a finite subgroup.

We study closure properties of measurable ultrapowers with respect to Hamkin's notion of freshness and show that the extent of these properties highly depends on the combinatorial properties of the underlying model of set theory. In one direction, a result of Sakai shows that, by collapsing a strongly compact cardinal to become the double successor of a measurable cardinal, it is possible to obtain a model of set theory in which such ultrapowers possess the strongest possible closure properties. In the (...) other direction, we use various square principles to show that measurable ultrapowers of canonical inner models only possess the minimal amount of closure properties. In addition, the techniques developed in the proofs of these results also allow us to derive statements about the consistency strength of the existence of measurable ultrapowers with non-minimal closure properties. (shrink)

In 1978, Yu. F. Borisov presented an axiom system using a few basic assumptions and four explicit axioms, the fourth being a formulation of the relativity principle; and he demonstrated that this axiom system had (up to choice of units) only two models: a relativistic one in which worldview transformations are Poincaré transformations and a classical one in which they are Galilean. In this paper, we reformulate Borisov’s original four axioms within an intuitively simple, but strictly formal, first-order logic framework, (...) and convert his basic background assumptions into explicit axioms. Instead of assuming that the structure of physical quantities is the field of real numbers, we assume only that they form an ordered field. This allows us to investigate how Borisov’s theorem depends on the structure of quantities. We demonstrate (as our main contribution) how to construct Euclidean, Galilean, and Poincaré models of Borisov’s axiom system over every non-Archimedean field. We also demonstrate the existence of an infinite descending chain of models and transformation groups in each of these three cases, something that is not possible over Archimedean fields. As an application, we note that there is a model of Borisov’s axioms that satisfies the relativity principle, and in which the worldview transformations are Euclidean isometries. Over the field of reals it is easy to eliminate this model using natural axioms concerning time’s arrow and the absence of instantaneous motion. In the case of non-Archimedean fields, however, the Euclidean isometries appear intrinsically as worldview transformations in models of Borisov’s axioms and neither the assumption of time’s arrow, nor the rejection of instantaneous motion, can eliminate them. (shrink)

This a special issue of the Journal of Logic Language and Information that I edited.