Related papers: On first-order expressibility of satisfiability in…

We prove the following two results. Theorem A: Let alpha be a limit ordinal. Suppose that 2^{|alpha|}<aleph_alpha and 2^{|alpha|^+}<aleph_{|alpha|^+}, whereas aleph_alpha^{|alpha|}>aleph_{|alpha|^+}. Then for all n< omega and for all…

We prove that every abstract elementary class (a.e.c.) with LST number $\kappa$ and vocabulary $\tau$ of cardinality $\leq \kappa$ can be axiomatized in the logic ${\mathbb L}_{\beth_2(\kappa)^{+++},\kappa^+}(\tau)$. In this logic an a.e.c.…

We study two extensions of FO2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variable atomic formulas that say, "the letter $a$ appears between…

Let $\kappa$ be a regular cardinal, $\lambda<\kappa$ be a smaller infinite cardinal, and $\mathsf K$ be a $\kappa$-accessible category where colimits of $\lambda$-indexed chains exist. We show that various category-theoretic constructions…

Diekert, Matiyasevich and Muscholl proved that the existential first-order theory of a trace monoid over a finite alphabet is decidable. We extend this result to a natural class of trace monoids with infinitely many generators. As an…

We demonstrate that the technology of Radin forcing can be used to transfer compactness properties at a weakly inaccessible but not strong limit cardinal to a strongly inaccessible cardinal. As an application, relative to the existence of…

We prove preservation theorems for $\mathcal{L}_{\omega_1, G}$, the countable fragment of Vaught's closed game logic. These are direct generalizations of the theorems of \L{}o\'s-Tarski (resp. Lyndon) on sentences of $\mathcal{L}_{\omega_1,…

The problem if a given configuration of a pushdown automaton (PDA) is bisimilar with some (unspecified) finite-state process is shown to be decidable. The decidability is proven in the framework of first-order grammars, which are given by…

We give a combinatorial consistency-inconsistency configuration that is equivalent to the failure of the following form of Kim's lemma for a given $k$: $(\star)$ For any set of parameters $A$, formula $\varphi(x,b)$, and $A$-bi-invariant…

Let $K$ be a locally compact hypergroup with a left Haar measure $\mu$ and $\Omega$ be a Banach ideal of $\mu$-measurable complex-valued functions on $K$. For Young functions $\{\varphi_i\}_{i=1,2,3}$, let $\Omega_{\varphi_i}(K)$ be the…

Kunen's proof of the non-existence of Reinhardt cardinals opened up the research on very large cardinals, i.e., hypotheses at the limit of inconsistency. One of these large cardinals, I0, proved to have descriptive-set-theoretical…

We prove that the positive fragment of first-order intuitionistic logic in the language with two variables and a single monadic predicate letter, without constants and equality, is undecidable. This holds true regardless of whether we…

We determine the large cardinal consistency strength of the existence of a $\lambda$-supercompact cardinal $\kappa$ such that GCH fails at $\lambda$. Indeed, we show that the existence of a $\lambda$-supercompact cardinal $\kappa$ such that…

A structure ${\mathbb Y}$ of a relational language $L$ is called almost chainable iff there are a finite set $F \subset Y$ and a linear order $<$ on the set $Y\setminus F$ such that for each partial automorphism $\varphi$ (i.e., local…

We show that a linearly ordered topological space is initially \lambda-compact if and only if it is \lambda-bounded, that is, every set of cardinality $\leq \lambda$ has compact closure. As a consequence, every product of initially…

Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |T_1| there are 2^lambda models of T_1 such that for any two…

We study whether, in the pi-calculus, the match prefix---a conditional operator testing two names for (syntactic) equality---is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible…

Given a regular cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$ (e.g., if the Generalized Continuum Hypothesis holds), we develop a proof system for classical infinitary logic that includes heterogeneous quantification (i.e., infinite…

Assuming the consistency of ZFC with appropriate large cardinal axioms we produce a model of ZFC where $\aleph_\omega$ is a strong limit cardinal and the inner model $L(\mathcal{P}(\aleph_\omega))$ satisfies the following properties: (1)…

Let 2<n\leq l<m< \omega. Let L_n denote first order logic restricted to the first n variables. We show that the omitting types theorem fails dramatically for the n--variable fragments of first order logic with respect to clique guarded…