Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1401.6682

On logics extended with embedding-closed quantifiers

Jevgeni Haigora·Kerkko Luosto
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study first-order as well as infinitary logics extended with quantifiers closed upwards under embeddings. In particular, we show that if a chain of quasi-homogeneous structures is sufficiently long then a given formula of such a logic is eventually equivalent to a quantifier-free formula in that chain. We use this fact to produce a number of undefinability results for logics with embedding-closed quantifiers. In the final section we introduce an Ehrenfeucht-Fraïssé game that characterizes the $L$-equivalence between structures, where $L$ is the infinitary logic $L_{\infty ω}$ extended with all embedding-closed quantifiers. In conclusion, we provide an application of this game illustrating its use.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jevgeni Haigora, Kerkko Luosto. 2014-07-03. On logics extended with embedding-closed quantifiers. https://arxiv.org/abs/1401.6682

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Forcing with Symmetric Systems of Models of Two Types

The purpose of this paper is to present a general method for forcing on $ω_2$ and $ω_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing with finite symmetric systems of elementary submodels, and improves earlier versions of this forcing by including models of two types. We will present several applications of the pure side condition forcing and variants thereof, by adding a Kurepa tree on $ω_2$, a club subset of $ω_2$ that avoids infinite sets from the ground model, a function bounding every canonical function below $ω_3$ on a club, and a simplified $(ω_2,1)$-morass.

math.LO↗
arXiv2026

Compactness beyond choice and HOD

We characterise exacting, rank-Berkeley, Berkeley, and club Berkeley cardinals by compactness properties of logics and, equivalently, by compactness properties of certain topological spaces. This raises the strength known to be obtainable by statements about compactness into the realm of choiceless large cardinal axioms, the strongest known statements in terms of consistency strength. Moreover, it shows that compactness assumptions can directly violate the axiom of choice and the axiom $V=\text{HOD}$.

math.LO↗
arXiv2026

Two applications of the point-free coderivative

We present two new applications of Simmons' point-free Cantor-Bendixson coderivative operator in intuitionistic logic. First, we use it to give a simplified proof of the recent result of Xu and Ye that the free Heyting algebra on two generators does not occur as the Heyting algebra of subterminal objects in any elementary topos. Then we use it to prove that complete Heyting algebra semantics is not strongly complete for intuitionistic second-order propositional logic: semantic consequence from an arbitrary set of assumptions does not coincide with ordinary syntactic consequence.

math.LO↗