•  30
    The compactness theorem, Theorem 11.2, is one of the most frequently used basic tools of model theory. It implies that for every structure with an infinite domain there is another structure that is very similar but not isomorphic to the given one. We will see a toy example that shows how such structure could be used to study number-theoretic problems. A more advanced application is given in Appendix A.5.
  •  11
    Before we get into details regarding number structures, we will examine definability in cases that are easier to analyze. We define two important classes of structures: minimal, in Definition 9.1, and order-minimal, in Definition 9.4. The important concepts of type and symmetry were already introduced in Chap. 10.1007/978-3-319-97298-5_2; here we define them in general model-theoretic terms and use them to analyze the orderings of the sets of natural numbers, integers, and rationals.
  •  36
    In this chapter we will see how one can learn something about a structure by using symmetries of its elementary extensions. We will examine the specific example of the ordering of the natural numbers, and we will prove that the structure (ℕ,
  •  24
    This book is about a formal approach to mathematical structures. Formal methods are by their very nature formal. When studying mathematical logic, initially one often has to grit ones teeth and absorb certain preliminary definitions on faith. Concepts are given precise definitions, and their meaning is revealed later after one has a chance to see their utility. We will try to follow a different route. Before all formalities are introduced, in this chapter, we will take a detour to see examples o…Read more
  •  19
    In previous chapters we introduced mathematical structures, and we followed with a detailed description of basic number structures. Now it is time to look at structures in general. The classical number structures fit very well the definition: a set with a set of relations on it. But what about other structures? Are they all sets? Can a set of relations always be associated with them? Clearly not. Not everything in this world is a set. I am a structured living organism, but I am definitely not a …Read more
  •  18
    This chapter serves as an interlude. Our goal in the following chapters is to present a formalized approach to numbers, and then we will look at the number systems again to see how tools of logic are used to uncover their essential features. We will be inspecting the structure of the number systems with our logic glasses on, but we need to get used to wearing those glasses. In this chapter we will take a look at some simple finite structures—finite graphs—and we will examine them from the logica…Read more
  •  16
    My aim in this book was to explain the concept of mathematical structure, and to show examples of techniques that are used to study them. It would be hard to do it honestly without introducing some elements of logic and set theory. In a textbook, the line of thought may sometimes get lost in technical details. Now, when all necessary material has been covered, I can give a summary and a brief description of what this book is about.
  •  21
    In mathematics, or at least in the mathematics inspired by logical methods, to know a structure means to know all sets that are definable in it. In this chapter we will take a look at the smallest nonempty sets—those that have only one element. This a specialized topic, and it is technical, but it will give us an opportunity to see in detail what domains of mathematical structures are made of and in what sense they are “given to us.”
  •  14
    In the previous chapter, we introduced and named an actually infinite set. The set of natural numbers ℕ={0,1,2,…}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $${\mathbb {N}}=\{0,1,2,\dots \}$$ \end{document}. What is the structure of this set? We will give a simple answer to this question, and then we will proceed …Read more
  •  20
    In the previous chapter we saw examples of mathematical structures that are simple enough to allow a complete analysis of the parametrically definable subsets of their domains. Those structures are of some interest, but the real objects of study in mathematics are richer structures such as (ℚ,+,⋅)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargi…Read more
  •  25
    In this chapter we will compare two classical structures: the field of complex numbers (ℂ,+,⋅)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$({\mathbb {C}},+,\cdot )$$ \end{document} and the standard model of arithmetic (ℕ,+,⋅)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfo…Read more
  •  14
    Needles to say, there is a vast literature on model theory of first-order logic and its applications. Some references have already been given throughout the text. I will repeat some of them and will add other recommendations.
  •  46
    THE LATTICE PROBLEM FOR MODELS OF PA $\mathsf {PA}$ sans serif upper P upper A
    with Athar Abdul-Quader
    Bulletin of Symbolic Logic 32 (2): 259-286. 2026.
    The lattice problem for models of Peano Arithmetic (PA $\mathsf {PA}$ sans serif upper P upper A) is to determine which lattices can be represented as lattices of elementary submodels of a model of PA $\mathsf {PA}$ sans serif upper P upper A, or, in greater generality, for a given model M $\mathcal {M}$ script upper M, which lattices can be represented as interstructure lattices of elementary submodels K $\mathcal {K}$ script upper K of an elementary extension N $\mathcal {N}$ script upper N su…Read more
  •  128
    Machine generated contents note: 1. Introduction Juliette Kennedy and Roman Kossak; 2. Historical remarks on Suslin's problem Akihiro Kanamori; 3. The continuum hypothesis, the generic-multiverse of sets, and the [OMEGA] conjecture W. Hugh Woodin; 4. [omega]-Models of finite set theory Ali Enayat, James H. Schmerl and Albert Visser; 5. Tennenbaum's theorem for models of arithmetic Richard Kaye; 6. Hierarchies of subsystems of weak arithmetic Shahram Mohsenipour; 7. Diophantine correct open induc…Read more
  •  42
    Every infinite mathematical structure M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \mathcal{M} $$\end{document} has an extension M∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \set…Read more
  •  106
    This textbook is a second edition of the successful, Mathematical Logic: On Numbers, Sets, Structures, and Symmetry. It retains the original two parts found in the first edition, while presenting new material in the form of an added third part to the textbook. The textbook offers a slow introduction to mathematical logic, and several basic concepts of model theory, such as first-order definability, types, symmetries, and elementary extensions. Part I, Logic Sets, and Numbers, shows how mathemati…Read more
  •  16
    From the editors
    with Andrés Villaveces, Juha Kontinen, and Åsa Hirvonen
    In Åsa Hirvonen, Juha Kontinen, Roman Kossak & Andrés Villaveces (eds.), Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics, De Gruyter. 2015.
  •  80
    Disjunctions with Stopping Conditions
    with Bartosz Wcisło
    Bulletin of Symbolic Logic 27 (3): 231-253. 2021.
    We introduce a tool for analysing models of$\text {CT}^-$, the compositional truth theory over Peano Arithmetic. We present a new proof of Lachlan’s theorem that the arithmetical part of models of$\text {CT}^-$are recursively saturated. We also use this tool to provide a new proof of theorem from [8] that all models of$\text {CT}^-$carry a partial inductive truth predicate. Finally, we construct a partial truth predicate defined for a set of formulae whose syntactic depth forms a nonstandard cut…Read more
  •  28
    Preface
    Studia Semiotyczne 34 (1): 5-8. 2020.
    The articles in this issue can be divided into three groups. Krajewski’s article, Yong Cheng’s contribution, and a short note by Rudy Rucker, provide detailed mathematical analysis of Lucas-Penrose type arguments. In the second group, with articles by Arnon Avron, Stepan Holub, Panu Raaikiainen, and Albert Visser, the authors discuss the status and various methodological and technical problems of the anti-mechanist arguments. In essence: what does the problem of “minds vs. machines” really mean,…Read more
  •  96
    Logic & Structure: An Art Project
    with Wanda Siedlecka
    Theoria 87 (4): 959-970. 2021.
    The Logic & Structure project is about the language of mathematical logic and how it can be of use in the visual arts. It involves a conversation between a mathematical logician and a group of artists. The project is ongoing, and this is a report on its first two phases. This text has two parts. The first, “Logic”, is a short introduction to certain aspects of logic, as it was presented to the participants. The second part, “Structures”, describes some of the outcomes.The inspiration for the pro…Read more
  •  42
    Simplicity: Ideals of Practice in Mathematics and the Arts (edited book)
    with Philip Ording
    Springer. 2017.
    To find "criteria of simplicity" was the goal of David Hilbert's recently discovered twenty-fourth problem on his renowned list of open problems given at the 1900 International Congress of Mathematicians in Paris. At the same time, simplicity and economy of means are powerful impulses in the creation of artworks. This was an inspiration for a conference, titled the same as this volume, that took place at the Graduate Center of the City University of New York in April of 2013. This volume include…Read more
  •  53
    Neutrally expandable models of arithmetic
    with Athar Abdul-Quader
    Mathematical Logic Quarterly 65 (2): 212-217. 2019.
    A subset of a model of PA is called neutral if it does not change the dcl relation. A model with undefinable neutral classes is called neutrally expandable. We study the existence and non‐existence of neutral sets in various models of PA. We show that cofinal extensions of prime models are neutrally expandable, and ω1‐like neutrally expandable models exist, while no recursively saturated model is neutrally expandable. We also show that neutrality is not a first‐order property. In the last sectio…Read more
  •  236
    The complexity of classification problems for models of arithmetic
    with Samuel Coskey
    Bulletin of Symbolic Logic 16 (3): 345-358. 2010.
    We observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic are Borel; we investigate the precise complexity of each of these. Finally, we show that the classification problem for pairs of recursively saturated models and for automorphisms of a fixed recursively saturated model are Borel complete.
  •  66
    Contents
    with Andrés Villaveces, Juha Kontinen, and Åsa Hirvonen
    In Åsa Hirvonen, Juha Kontinen, Roman Kossak & Andrés Villaveces (eds.), Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics, De Gruyter. 2015.
  •  103
    Undefinability of truth and nonstandard models
    Annals of Pure and Applied Logic 126 (1-3): 115-123. 2004.
    We discuss Robinson's model theoretic proof of Tarski's theorem on undefinability of truth. We present two other “diagonal-free” proofs of Tarski's theorem, and we compare undefinability of truth to other forms of undefinability in nonstandard models of arithmetic
  •  161
  •  84
    Minimal satisfaction classes with an application to rigid models of Peano arithmetic
    with James H. Schmerl
    Notre Dame Journal of Formal Logic 32 (3): 392-398. 1991.