Related papers: The finite cohesiveness principle
The rigid relation principle, introduced in this article, asserts that every set admits a rigid binary relation. This follows from the axiom of choice, because well-orders are rigid, but we prove that it is neither equivalent to the axiom…
We show that Shelah cardinals are preserved under the canonical $GCH$ forcing notion. We also show that if $GCH$ holds and $F:REG\rightarrow CARD$ is an Easton function which satisfies some weak properties, then there exists a cofinality…
We show that a strong form of the so called Lindstrom's Theorem fails to generalize to extensions of L_{kappa,omega} and L_{kappa,kappa}: For weakly compact kappa there is no strongest extension of L_{kappa,omega} with the…
We study the strength of axioms needed to prove various results related to automata on infinite words and B\"uchi's theorem on the decidability of the MSO theory of $(N, {\le})$. We prove that the following are equivalent over the weak…
We consider several formalizations in the language of second-order arithmetic of "The formula $\phi$ is a theorem of $\omega$-logic", including some which have been studied in the literature and a new variant defined via a least fixed…
A set of integers $A$ is computably encodable if every infinite set of integers has an infinite subset computing $A$. By a result of Solovay, the computably encodable sets are exactly the hyperarithmetic ones. In this paper, we extend this…
An $\omega_1$-compact space is a space in which every closed discrete subspace is countable. We give various general conditions under which a locally compact, $\omega_1$-compact space is $\sigma$-countably compact, i.e., the union of…
We introduce and study a combinatorially defined notion of root basis of a (real) root system of a possibly infinite Coxeter group. Known results on conjugacy up to sign of root bases of certain irreducible finite rank real root systems are…
Let $\mathcal{C}:=\mathcal{C}(G,\omega,H,\psi)$ be a finite group scheme-theoretical category over an algebraically closed field of characteristic $p\ge 0$ as defined by the first author. For any indecomposable exact module category over…
By a theorem due to Kato and Ohtake, any (not necessarily strict) Morita context induces an equivalence between appropriate subcategories of the module categories of the two rings in the Morita context. These are in fact categories of firm…
This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…
Continuing [Fuchino, Ottenbreit and Sakai[9, 10]] and [Fuchino and Ottenbreit[11]], we further study reflection principles in connection with the L\"owenheim-Skolem Theorems of stationary logics. In this paper, we mainly analyze the…
We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…
Jun-Muk Hwang and Ngaiming Mok have proved the rigidity of irreducible Hermitian symmetric spaces of compact type under Kaehler degeneration. I adapt their argument to the algebraic setting in positive characteristic, where cominuscule…
We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the…
The main goal of this paper is proving the fixed point theorem for finite groups acting on weakly systolic complexes. As corollaries we obtain results concerning classifying spaces for the family of finite subgroups of weakly systolic…
We prove several rigidity results for corona $C^*$-algebras and \v{C}ech-Stone remainders under the assumption of Forcing Axioms. In particular, we prove that a strong version of Todor\v{c}evi\'c's $\OCA$ and Martin's Axiom at level…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…
In this paper, we establish the rationality conjecture raised in \cite{FKS} for any $(r-1)$-connected ($r\geq 2$) $kr$-dimensional CW-complex $X$ ($k\geq 2$) having a unique spherical cohomology class $u\in \tilde{H}^r(X, \mathbb{Z})$ such…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…