Algebraic characterisation of pseudo-elementary and second-order classes
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909030917603328 |
|---|---|
| author | Ivanyos, János Balázs |
| author_facet | Ivanyos, János Balázs |
| contents | In this paper we provide purely model-theoretic (algebraic) characterisations for classes definable in second-order logic and for pseudo-elementary classes (including PC and PC_Δ classes). Classical results of this flavour include Keisler-Shelah type theorems (characterising first-order definability by closure under ultraproducts and ultraroots) and Birkhoff's HSP theorem; a key starting point for this paper is Sági's work, which provides an algebraic description of classes definable by existential second-order sentences. Here we resolve several open problems from the literature. Our main results are the following. We solve the long-standing problem of giving a purely algebraic characterisation of pseudo-elementary classes: we characterise PC_Δ classes by intrinsic closure properties. We also give a characterisation for the basic pseudo-elementary classes (PC). We provide a structural classification of second-order equivalent structures, and we obtain purely algebraic characterisations of the classes definable by second-order formulas as well as those definable by finitely many second-order sentences. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_09728 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Algebraic characterisation of pseudo-elementary and second-order classes Ivanyos, János Balázs Logic In this paper we provide purely model-theoretic (algebraic) characterisations for classes definable in second-order logic and for pseudo-elementary classes (including PC and PC_Δ classes). Classical results of this flavour include Keisler-Shelah type theorems (characterising first-order definability by closure under ultraproducts and ultraroots) and Birkhoff's HSP theorem; a key starting point for this paper is Sági's work, which provides an algebraic description of classes definable by existential second-order sentences. Here we resolve several open problems from the literature. Our main results are the following. We solve the long-standing problem of giving a purely algebraic characterisation of pseudo-elementary classes: we characterise PC_Δ classes by intrinsic closure properties. We also give a characterisation for the basic pseudo-elementary classes (PC). We provide a structural classification of second-order equivalent structures, and we obtain purely algebraic characterisations of the classes definable by second-order formulas as well as those definable by finitely many second-order sentences. |
| title | Algebraic characterisation of pseudo-elementary and second-order classes |
| topic | Logic |
| url | https://arxiv.org/abs/2605.09728 |