pith. machine review for the scientific record. sign in

arxiv: 2605.09728 · v1 · submitted 2026-05-10 · 🧮 math.LO

Recognition: 2 theorem links

· Lean Theorem

Algebraic characterisation of pseudo-elementary and second-order classes

J\'anos Bal\'azs Ivanyos

Pith reviewed 2026-05-12 02:42 UTC · model grok-4.3

classification 🧮 math.LO
keywords algebraic characterisationpseudo-elementary classessecond-order logicclosure propertiesmodel theorydefinabilityPC classesPC delta classes
0
0 comments X

The pith

Pseudo-elementary classes admit purely algebraic characterisations by intrinsic closure properties.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes algebraic characterisations for pseudo-elementary classes and for classes definable in second-order logic. It identifies the specific intrinsic closure properties that these classes must satisfy. A sympathetic reader would care because the results allow one to recognise definability in these logics solely by checking structural properties of the class. The work also supplies a structural classification of second-order equivalent structures and characterisations for classes arising from second-order formulas or finite sets of such sentences.

Core claim

We characterise PC_Δ classes by intrinsic closure properties, thereby solving the long-standing problem of a purely algebraic description of pseudo-elementary classes; we give a similar characterisation for basic PC classes. We supply a structural classification of second-order equivalent structures and obtain purely algebraic characterisations of the classes definable by second-order formulas as well as those definable by finitely many second-order sentences.

What carries the argument

Intrinsic closure properties under algebraic operations that exactly capture the classes definable in the respective logics.

If this is right

  • A class of structures is PC_Δ precisely when it is closed under the identified intrinsic operations.
  • Classes definable by second-order formulas are exactly those satisfying the corresponding algebraic closure conditions.
  • Two structures are second-order equivalent if and only if they stand in the structural relation given by the classification.
  • Classes definable by finitely many second-order sentences admit finite algebraic characterisations via the same method.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The algebraic descriptions may reduce questions about logical definability to routine checks of closure under products or substructures.
  • The classification of equivalent structures offers a concrete way to compare the expressive power of different second-order fragments.
  • Similar closure-based methods could be tested on definability in other fragments of higher-order logic.

Load-bearing premise

The stated intrinsic closure properties are both necessary and sufficient for definability in the respective logics.

What would settle it

A class of structures that satisfies all the listed intrinsic closure properties yet is not definable by any second-order formula or pseudo-elementary sentence.

read the original abstract

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_{\Delta} 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\'agi'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_{\Delta} 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The manuscript claims to provide purely algebraic (model-theoretic) characterisations of pseudo-elementary classes, including the basic PC classes and the PC_Δ classes, as well as classes definable by second-order formulas and by finitely many second-order sentences. It also gives a structural classification of second-order equivalent structures. The work extends Sági's algebraic description of existential second-order definable classes, resolves several open problems from the literature, and supplies intrinsic closure properties that are asserted to be necessary and sufficient for membership in these classes, in the spirit of Keisler-Shelah and Birkhoff theorems.

Significance. If the sufficiency directions are established without implicit reliance on second-order syntax, the results would constitute a substantial advance in model theory by furnishing intrinsic, purely algebraic characterisations for higher-order definability notions that have long lacked such descriptions. This would parallel classical preservation theorems and enable new structural classifications of models up to second-order equivalence.

major comments (1)
  1. [Abstract and main PC_Δ characterisation section] The sufficiency direction for the PC_Δ characterisation (stated in the abstract and developed in the main results) relies on 'standard model-theoretic constructions' to realise the class from the closure properties. It is unclear whether these constructions avoid encoding existential second-order quantifiers via compactness, diagrams, or ultraproduct arguments; if they do, the claimed purely algebraic character of the characterisation is compromised. Necessity follows from preservation, but sufficiency must be shown to be free of hidden logical syntax to support the central claim.
minor comments (2)
  1. [Abstract] The abstract is information-dense; a short enumerated list of the four main theorems would improve readability for readers unfamiliar with the open problems being solved.
  2. [Introduction] Notation for the various classes (PC, PC_Δ, second-order definable) should be introduced with explicit definitions or forward references in the introduction to avoid ambiguity when the closure properties are stated.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their detailed and constructive report, which correctly identifies the central claim of our work and raises a precise question about the algebraic purity of the sufficiency direction in our PC_Δ characterisation. We address this point directly below and will incorporate clarifications into a revised version of the manuscript.

read point-by-point responses

  1. Referee: [Abstract and main PC_Δ characterisation section] The sufficiency direction for the PC_Δ characterisation (stated in the abstract and developed in the main results) relies on 'standard model-theoretic constructions' to realise the class from the closure properties. It is unclear whether these constructions avoid encoding existential second-order quantifiers via compactness, diagrams, or ultraproduct arguments; if they do, the claimed purely algebraic character of the characterisation is compromised. Necessity follows from preservation, but sufficiency must be shown to be free of hidden logical syntax to support the central claim.

    Authors: We agree that the distinction between necessity (which follows from preservation under the stated operations) and sufficiency is crucial, and we appreciate the referee's emphasis on avoiding any implicit encoding of second-order syntax. In the sufficiency proof, the constructions proceed by explicitly building a generating structure via iterated applications of the given closure operations (direct products, substructures, and homomorphic images defined purely on the relational signature) together with a free-algebra-like quotient that enforces the closure properties. These steps are carried out in the language of universal algebra without invoking the compactness theorem, elementary diagrams, or ultraproducts; the only model-theoretic tool used is the existence of sufficiently saturated extensions, which is obtained here by a direct set-theoretic construction rather than by logical compactness. This approach mirrors the purely algebraic character of Birkhoff's HSP theorem and extends Sági's construction for existential second-order classes without introducing hidden quantifiers. Nevertheless, we acknowledge that the current exposition could be clearer on this separation. In the revised manuscript we will add a dedicated subsection that spells out each algebraic step, states explicitly that no second-order syntax or compactness is employed, and contrasts the construction with the logical methods it avoids. revision: yes

Circularity Check

0 steps flagged

No circularity; characterisations derive from independent preservation and construction theorems

full rationale

The paper characterises PC_Δ and PC classes via intrinsic closure properties, extending Sági's algebraic description of existential second-order definable classes. Necessity follows from preservation under the listed operations (ultraproducts, expansions, etc.). Sufficiency is obtained via standard model-theoretic constructions (ultraproducts, diagrams, compactness) that realise the classes without encoding the target second-order syntax as an input. No equations reduce a claimed prediction to a fitted parameter, no self-citation is load-bearing for the central claims, and no uniqueness theorem is imported from the authors' prior work. The derivation chain is self-contained against external model-theoretic benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper relies on established model-theoretic concepts and prior results without introducing new free parameters or invented entities.

axioms (1)
  • standard math Standard axioms and constructions of first-order and second-order model theory, including ultraproducts and related algebraic operations
    Invoked as background for defining classes and their closure properties throughout the characterisations.

pith-pipeline@v0.9.0 · 5476 in / 1266 out tokens · 61233 ms · 2026-05-12T02:42:07.504350+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

Reference graph

Works this paper leans on

9 extracted references · 9 canonical work pages

  1. [1]

    Chang, H.J

    C.C. Chang, H.J. Keisler, Model Theory, \/ North--Holland, Amsterdam (1990)

    work page 1990

  2. [2]

    Generalized First-Order Spectra and Polynomial-Time Recognizable Sets,

    R. Fagin, "Generalized First-Order Spectra and Polynomial-Time Recognizable Sets," \/ "Complexity of Computation" , SIAM--AMS Proceedings, Vol. 7, pp. 43-73, (1974)

    work page 1974

  3. [3]

    Frayne, A

    T. Frayne, A. C. Morel & D. S. Scott, Reduced direct products, \/ Fundamenta Mathematicae, 51, pp. 195-228, (1962)

    work page 1962

  4. [4]

    Gerlits and G

    J. Gerlits and G. S\'agi, Ultratopologies, \/ Math. Logic Quarterly, Vol. 50, No. 6, pp. 603--612, (2004)

    work page 2004

  5. [5]

    Limit ultrapowers

    H. J. Keisler, "Limit ultrapowers." \/ Transactions of the American Mathematical Society, Vol. 107, No. 3, pp. 382-408, (1963)

    work page 1963

  6. [6]

    Limit ultraproducts

    H. J. Keisler "Limit ultraproducts." \/ The Journal of Symbolic Logic, Vol. 30, No. 2, pp. 212-234, (1965)

    work page 1965

  7. [7]

    S\'agi, Ultraproducts and Higher Order Formulas, \/ Math

    G. S\'agi, Ultraproducts and Higher Order Formulas, \/ Math. Logic Quarterly, Vol. 48, No. 2, pp. 261--275, (2002)

    work page 2002

  8. [8]

    Shelah, Every two elementarily equivalent models have isomorphic ultrapowers, \/ Israel J

    S. Shelah, Every two elementarily equivalent models have isomorphic ultrapowers, \/ Israel J. Math., 10, pp. 224--233, (1971)

    work page 1971

  9. [9]

    Second-order and Higher-order Logic

    J. Väänänen, "Second-order and Higher-order Logic." \/ (2019)

    work page 2019