Related papers: Full satisfaction classes, definability, and autom…
We investigate the theory PAI (Peano Arithmetic with Indiscernibles). Models of PAI are of the form (M, I), where M is a model of PA, I is an unbounded set of order indiscernibles over M, and (M, I) satisfies the extended induction scheme…
We present two new constructions of satisfaction/truth classes over models of PA (Peano Arithmetic) that provide a foil to the fact that the existence of a disjunctively correct full truth class over a model M of PA implies that Con(PA)…
A satisfaction class is a set of nonstandard sentences respecting Tarski's truth definition. We are mainly interested in full satisfaction classes, i.e., satisfaction classes which decides all nonstandard sentences. Kotlarski, Krajewski and…
If M,N are countable, arithmetically saturated models of Peano Arithmetic and Aut(M) is isomorphic to Aut(N), then the Turing-jumps of Th(M) and Th(N) are recursively equivalent.
We hope to see how much for a model M of some completion T of PA (Peano Arithmetic) does M restriction {<} determine M, say up to isomorphism. We advance in characterizing for non-standard models M of PA the "minimal" set {(a,b):n < a < b…
In this paper, we extend the concept of a Lascar generic automorphism in the setting of models of Peano arithmetic ($\mathrm{PA}$) to the subgroup of the automorphism group of a countable recursively saturated model $\mathcal{M}$ of…
It is shown that in various categories, including many consisting of maps or hypermaps, oriented or unoriented, of a given hyperbolic type, every countable group $A$ is isomorphic to the automorphism group of uncountably many non-isomorphic…
Recent results show that a constraint satisfaction problem (CSP) defined over rational numbers with their natural ordering has a solution if and only if it has a definable solution. The proof uses advanced results from topology and modern…
This is a survey of results on definability and undefinability in models of arithmetic. The goal is to present a stark difference between undefinability results in the standard model and much stronger versions about expansions of…
In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
Simpson showed that every countable model $\mathcal{M} \models \mathsf{PA}$ has an expansion $(\mathcal{M}, X) \models \mathsf{PA}^*$ that is pointwise definable. A natural question is whether, in general, one can obtain expansions of a…
We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
We adapt the notion of a (relatively) definable subset of Aut(M) when M is a saturated model to the case Aut(M/A) when M is atomic and strongly omega-homogeneous over A. We discuss the existence and uniqueness of invariant measures on the…
Recursive saturation and resplendence are two important notions in models of arithmetic. Kaye, Kossak, and Kotlarski introduced the notion of arithmetic saturation and argued that recursive saturation might not be as rigid as first assumed.…
Let $\mathbf{K}$ be the class of countable structures $M$ with the strong small index property and locally finite algebraicity, and $\mathbf{K}_*$ the class of $M \in \mathbf{K}$ such that $acl_M(\{ a \}) = \{ a \}$ for every $a \in M$. For…
The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…
We completely classify the orientable infinite-type surfaces $S$ such that $\operatorname{PMap}(S)$, the pure mapping class group, has automatic continuity. This classification includes surfaces with noncompact boundary. In the case of…
A relational structure is a core, if all its endomorphisms are embeddings. This notion is important for computational complexity classification of constraint satisfaction problems. It is a fundamental fact that every finite structure has a…