逻辑
The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic…
We exhibit Pontryagin duality as a special case of Stone duality in a continuous logic setting. More specifically, given an abelian topological group $A$, and $\mathcal F$ the family (group) of continuous homomorphisms from $A$ to the…
This paper deals with the class of existentially closed models of fields with a distinguished submodule (over a fixed subring). In the positive characteristic case, this class is elementary and was investigated by the first-named author.…
The standard treatment of sets and definable classes in first-order Zermelo-Fraenkel set theory accords in many respects with the Fregean foundational framework, such as the distinction between objects and concepts. Nevertheless, in set…
The parameter-free part $\text{PA}_2^\ast$ of $\text{PA}_2$, the 2nd order Peano arithmetic, is considered. We make use of a product/iterated Sacks forcing to define an $\omega$-model of $\text{PA}_2^\ast + \text{CA}(\Sigma^1_2)$, in which…
I present a dialetheic solution to the Antinomy of the Liar and I evaluate the objection that, if the argument in Curry's paradox is valid, accepting this solution forces us to accept an analogous solution to Curry's, which I show to be…
We prove that for a countable, commutative ring $R$, the class of countable $R$-modules either has only countably many isomorphism types, or else it is Borel complete. The machinery gives a succinct proof of the Borel completeness of TFAB,…
We present a streamlined and (hopefully) accessible proof of the model-completeness of the weak monadic second order version of a dense linear order with left-endpoint but no right-endpoint in a particular finite signature. We also show how…
H. L. Skala (1992) gave the first elegant first-order axiom system for hyperbolic geometry by replacing Menger's axiom involving projectivities with the theorems of Pappus and Desargues for the hyperbolic plane. In so doing, Skala showed…
We prove various results connected together by the common thread of computability theory. First, we investigate a new notion of algorithmic dimension, the inescapable dimension, which lies between the effective Hausdorff and packing…
We show that if a countable structure $M$ in a finite relational language is not cellular, then there is an age-preserving $N \supseteq M$ such that $2^{\aleph_0}$ many structures are bi-embeddable with $N$. The proof proceeds by a case…
We study scattered piecewise interpretable Hilbert spaces from a model theoretic point of view. We establish strong connections between the Hilbert space structure theorems of [Chevalier Hrushovski 2021] and the model theoretic notions of…
The Halpern-L\"auchli theorem, a combinatorial result about trees, admits an elegant proof due to Harrington using ideas from forcing. In an attempt to distill the combinatorial essence of this proof, we isolate various partition principles…
We isolate \emph{the approximating diamond principles}, which are consequences of the diamond principle at an inaccessible cardinal. We use these principles to find new methods for negating the diamond principle at large cardinals. Most…
By studying the variety of J\'{o}nsson-Tarski algebras, we demonstrate two obstacles to the existence of large J\'{o}nsson algebras in certain varieties. First, if an algebra $J$ in a language $L$ has cardinality greater than $|L|^+$ and a…
We study Hilbert spaces $H$ interpreted, in an appropriate sense, in a first-order theory. Under a new finiteness hypothesis that we call {\em scatteredness} we prove that $H$ is a direct sum of {\em asymptotically free} components, where…
In contexts in which the principle of dependent choice may not be available, as toposes or Constructive Set Theory, standard locale theoretic results related to complete regularity may fail to hold. To resolve this difficulty, B.…
Hamkins and Kikuchi (2016 and 2017) show that in both set theory and class theory the definable subset ordering of the universe interprets a complete and decidable theory. If $\mathcal{M}$ is a model of set theory, then $\langle M,…
Gromov asked what a typical (finitely presented) group looks like, and he suggested a way to make the question precise in terms of limiting density. The typical finitely generated group is known to share some important properties with the…
In this work we study the uncountable Borel chromatic numbers, defined by Geschke (2011) as cardinal characteristics of the continuum, of low complexity graphs. We show that a strong form of locally countable graphs with compact totally…