Related papers: On first-order expressibility of satisfiability in…
We provided in \cite{BaldwinBrincusI} extensions of first order logic by modified inferential definitions of the classical $\omega$-rule in $1$ or $2$ sorts. These logics are categorical in the inferential sense. Arithmetic has a unique…
The implicit signature k consists of the multiplication and the ({\omega}-1)-power. We describe a procedure to transform each {\kappa}-term over a finite alphabet A into a certain canonical form and show that different canonical forms have…
A subset $S$ of a cardinal $\kappa$ is Ramsey if for every function $f:[S]^{<\omega}\to \kappa$ with $f(a)<\min a$ for all $a\in[S]^{<\omega}$, there is a set $H\subseteq S$ of cardinality $\kappa$ which is \emph{homogeneous} for $f$,…
Let $\mathcal{L}\subseteq \mathcal{L}^{\prime }$ be first order languages, let $R\in \mathcal{L}^{\prime }-\mathcal{L}$ be a relation symbol, and let $% \mathcal{K}$ be a class of $\mathcal{L}^{\prime }$-structures. In this paper we present…
The paper is the second of two and shows that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
Recently, the separated fragment (SF) of first-order logic has been introduced. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. SF properly generalizes both the…
We prove the following version of the first incompleteness theorem that simultaneously strengthens Mostowski's theorem and Vaught's theorem: For any c.e. family $\{ T_i \}_{i \in \omega}$ of consistent extensions of Tarski, Mostowski and…
If $\Gamma$ is an irreducible non-uniform higher-rank characteristic zero arithmetic lattice (for example, $SL_n(\mathbb{Z})$, $n \geq 3$) and $\Lambda$ is a finitely generated group that is elementarily equivalent to $\Gamma$, then…
We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…
The Hanf number for a set $S$ of sentences in $L_{\omega_1,\omega}$ (or some other logic) is the least infinite cardinal $\kappa$ such that for all $\varphi\in S$, if $\varphi$ has models in all infinite cardinalities less than $\kappa$,…
First-order linear real arithmetic enriched with uninterpreted predicate symbols yields an interesting modeling language. However, satisfiability of such formulas is undecidable, even if we restrict the uninterpreted predicate symbols to…
Let $\mathcal{C}$ be a finitely bicomplete category and $\mathcal{W}$ a subcategory. We prove that the existence of a model structure on $\mathcal{C}$ with $\mathcal{W}$ as subcategory of weak equivalence is not first order expressible.…
In [5], Hjorth proved that for every countable ordinal $\alpha$, there exists a complete $\mathcal{L}_{\omega_1,\omega}$-sentence $\phi_\alpha$ that has models of all cardinalities less than or equal to $\aleph_\alpha$, but no models of…
Many computational problems can be modelled as the class of all finite structures $\mathbb A$ that satisfy a fixed first-order sentence $\phi$ hereditarily, i.e., we require that every (induced) substructure of $\mathbb A$ satisfies $\phi$.…
For a cardinal of the form $\kappa=\beth_\kappa$, Shelah's logic $L^1_\kappa$ has a characterisation as the maximal logic above $\bigcup_{\lambda<\kappa} L_{\lambda, \omega}$ satisfying Strong Undefinability of Well Order (SUDWO). SUDWO is…
We present a device for specifying and reasoning about syntax for datatypes, programming languages, and logic calculi. More precisely, we study a notion of "signature" for specifying syntactic constructions. In the spirit of Initial…
We study several cardinal, and ordinal--valued functions that are relatives of Hanf numbers. Let kappa be an infinite cardinal, and let T subseteq L_{kappa^+, omega} be a theory of cardinality <= kappa, and let gamma be an ordinal >=…
We show that if the existence of a supercompact cardinal $\kappa$ with a weakly compact cardinal $\lambda$ above $\kappa$ is consistent, then the following are consistent as well (where $\mathfrak{t}(\kappa)$ and $\mathfrak{u}(\kappa)$ are…
Given a cardinal $\kappa$ that is $\lambda$-supercompact for some regular cardinal $\lambda\geq\kappa$ and assuming $\GCH$, we show that one can force the continuum function to agree with any function $F:[\kappa,\lambda]\cap\REG\to\CARD$…
We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…