pith. sign in

arxiv: 2405.03785 · v2 · submitted 2024-05-06 · 🧮 math.LO

On the Model Theory of Second-Order Objects

Tapani Hyttinen , Joni Puljuj\"arvi , Davide Emilio Quadrellaro This is my paper

Pith reviewed 2026-05-24 01:30 UTC · model grok-4.3

classification 🧮 math.LO
keywords abstract elementary classesteam semanticsLindström theoremcategoricity transferexistential second-order logicindependence logicaccessible categoriesmodel theory
0
0 comments X

The pith

Abstract elementary team categories generalize abstract elementary classes to study second-order objects, establish accessibility, prove a Lindström theorem for FOT, and yield categoricity transfers in existential second-order logic.

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

The paper develops a model-theoretic framework for second-order objects such as sets and relations, motivated by team semantics and existential second-order logic. It defines abstract elementary team categories that extend the standard notion of abstract elementary class and proves these new categories are accessible. The framework is applied to show that the logic FOT satisfies a version of Lindström's theorem. It further establishes both downward and upward categoricity transfer results for complete theories in existential second-order logic, equivalently treated as independence logic. A sympathetic reader would care because the approach supplies category-theoretic tools for analyzing maximality, uniqueness of models, and other properties in logics that quantify over teams or relations.

Core claim

Motivated by team semantics and existential second-order logic, the authors introduce abstract elementary team categories that generalize abstract elementary classes, show that they form an example of an accessible category, apply the framework to establish that FOT satisfies a version of Lindström's theorem, and prove both a downward and an upward categoricity transfer result for complete theories in existential second-order logic or independence logic.

What carries the argument

abstract elementary team categories, a generalization of abstract elementary classes designed to handle team semantics for second-order objects and shown to be accessible categories.

If this is right

  • The logic FOT satisfies a version of Lindström's theorem.
  • Categoricity transfers downward between different cardinalities for complete theories in existential second-order logic.
  • Categoricity transfers upward between different cardinalities for such theories.
  • The same transfer results hold when the logic is viewed as independence logic.

Where Pith is reading between the lines

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

  • The framework may extend to other team-based or dependence logics for similar maximality results.
  • Results from the theory of accessible categories could be imported to derive further model-theoretic properties for second-order objects.
  • Categoricity transfer might be tested in specific countable theories of independence logic to check boundary cases.

Load-bearing premise

The newly defined abstract elementary team categories form accessible categories and the framework applies directly to FOT without further restrictions on the team semantics.

What would settle it

An explicit construction of an abstract elementary team category that is not accessible, or a concrete theory in FOT that violates the stated Lindström property under the framework, or a complete theory in existential second-order logic that is categorical in one cardinality but not in another in a way that blocks the transfer.

read the original abstract

Motivated by team semantics and existential second-order logic, we develop a model-theoretic framework for studying second-order objects such as sets and relations. We introduce a notion of abstract elementary team categories that generalizes the standard notion of abstract elementary class, and show that it is an example of an accessible category. We apply our framework to show that the logic $\mathsf{FOT}$ introduced by Kontinen and Yang satisfies a version of Lindstr\"om's Theorem. Finally, we consider the problem of transferring categoricity between different cardinalities for complete theories in existential second-order logic (or independence logic) and prove both a downwards and an upwards categoricity transfer result.

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

0 major / 2 minor

Summary. The paper develops a model-theoretic framework for second-order objects motivated by team semantics. It defines abstract elementary team categories (AETCs) generalizing abstract elementary classes (AECs), proves that AETCs form accessible categories, applies the framework to establish a version of Lindström's theorem for the logic FOT of Kontinen and Yang, and proves downward and upward categoricity transfer theorems for complete theories in existential second-order logic (equivalently, independence logic).

Significance. If the central claims hold, the work supplies a categorical generalization of AECs tailored to team semantics and second-order objects, together with concrete applications to Lindström-type results and categoricity transfer. The accessibility theorem and the two transfer results are the main technical contributions; they could serve as a foundation for further model-theoretic study of independence logic and related systems.

minor comments (2)
  1. [Abstract] The abstract equates existential second-order logic with independence logic; a brief clarification of the precise relationship (e.g., via team semantics) would help readers unfamiliar with the equivalence.
  2. [Introduction / §2] The statement that AETCs are 'an example of an accessible category' would benefit from an explicit reference to the precise definition of accessibility used (e.g., the relevant theorem in Adámek–Rosický or a paper-specific lemma).

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript, the recognition of its contributions to abstract elementary team categories, the Lindström-type result for FOT, and the categoricity transfers, as well as the recommendation for minor revision. No specific major comments were raised in the report.

Circularity Check

0 steps flagged

No circularity; derivation relies on new definitions and internal proofs

full rationale

The paper defines abstract elementary team categories as a generalization of abstract elementary classes, proves accessibility, applies the framework to FOT for a Lindström-type result, and establishes categoricity transfers for existential second-order logic. These steps are constructed from the new definitions and supplied arguments rather than reducing by construction to inputs, fitted parameters, or self-citation chains. The derivation is self-contained against external benchmarks with no quoted reductions matching the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only; no specific free parameters, axioms, or invented entities can be identified from the provided text.

pith-pipeline@v0.9.0 · 5638 in / 1140 out tokens · 23878 ms · 2026-05-24T01:30:46.579933+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.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

33 extracted references · 33 canonical work pages

  1. [1]

    Ad´ amek and J

    J. Ad´ amek and J. Rosick´ y.Locally presentable and accessible categories. Cam- bridge University Press, 1994

    work page 1994

  2. [2]

    J. T. Baldwin. Fundamentals of stability theory. Vol. 12. Cambridge University Press, 2017

    work page 2017

  3. [3]

    Abstract elementary classes and acc essible cate- gories

    T. Beke and J. Rosick´ y. “Abstract elementary classes and acc essible cate- gories”. In: Annals of Pure and Applied Logic 163.12 (2012), pp. 2008–2017

    work page 2012

  4. [4]

    Higher-order logic

    J. van Benthem and K. Doets. “Higher-order logic”. In: Handbook of philo- sophical logic. Vol. 1. Springer, Dordrecht, 2001, pp. 189–243

    work page 2001

  5. [5]

    The geometry of 1-based minimal types

    T. De Piro and B. Kim. “The geometry of 1-based minimal types”. I n: Trans- actions of The American Mathematical Society 355.10 (2003), pp. 4241–4263

    work page 2003

  6. [6]

    H. B. Enderton. A mathematical introduction to logic. Academic Press, Burling- ton (MA), 2001

    work page 2001

  7. [7]

    Reduced direct produ cts

    T. Frayne, A. C. Morel, and D. S. Scott. “Reduced direct produ cts”. In: Fundamenta Mathematicae 51 (1962), pp. 195–228

    work page 1962

  8. [8]

    General models and entailment semantics for independ ence logic

    P. Galliani. “General models and entailment semantics for independ ence logic”. In: Notre Dame Journal of Formal Logic 54.2 (2013), pp. 253–275

    work page 2013

  9. [9]

    Inclusion and exclusion dependencies in team semantics —on some logics of imperfect information

    P. Galliani. “Inclusion and exclusion dependencies in team semantics —on some logics of imperfect information”. In: Annals of Pure and Applied Logic 163.1 (2012), pp. 68–84

    work page 2012

  10. [10]

    Dependence and independence

    E. Gr¨ adel and J. V¨ a¨ an¨ anen. “Dependence and independence”. In: Studia Log- ica 101.2 (2013), pp. 399–410

    work page 2013

  11. [11]

    Compositional Semantics for a Language of Imper fect Informa- tion

    W. Hodges. “Compositional Semantics for a Language of Imper fect Informa- tion”. In: Logic Journal of the IGPL 5.4 (1997), pp. 539–563

    work page 1997

  12. [12]

    T. Jech. Set Theory. Berlin: Springer, 2014

    work page 2014

  13. [13]

    The Kim–Pillay theorem for abstract elementary ca tegories

    M. Kamsma. “The Kim–Pillay theorem for abstract elementary ca tegories”. In: The Journal of Symbolic Logic 85.4 (2020), pp. 1717–1741

    work page 2020

  14. [14]

    Ultraproducts and elementary classes

    H. J. Keisler. “Ultraproducts and elementary classes”. PhD th esis. University of California, Berkeley, 1961

    work page 1961

  15. [15]

    Limit ultrapowers

    H. J. Keisler. “Limit ultrapowers”. In: Transactions of the American Mathe- matical Society 107 (1963), pp. 382–408

    work page 1963

  16. [16]

    J. Kirby. Abstract Elementary Categories . Unpublished. Aug. 2008

    work page 2008

  17. [17]

    Complete logics for elementary team p roperties

    J. Kontinen and F. Yang. “Complete logics for elementary team p roperties”. In: The Journal of Symbolic Logic 88.2 (2023), pp. 579–619

    work page 2023

  18. [18]

    Classification theory for acces sible categories

    M. Lieberman and J. Rosick´ y. “Classification theory for acces sible categories”. In: The Journal of Symbolic Logic 81.1 (2016), pp. 151–165

    work page 2016

  19. [19]

    On characterizing elementary logic

    P. Lindstr¨ om. “On characterizing elementary logic”. In: Logical Theory and Semantic Analysis: Essays Dedicated to Stig Kanger on His Fi ftieth Birthday. Springer, 1974, pp. 129–146

    work page 1974

  20. [20]

    On extensions of elementary logic

    P. Lindstr¨ om. “On extensions of elementary logic”. In: Theoria 35.1 (1969), pp. 1–11

    work page 1969

  21. [21]

    Team logic: axioms, expressiveness, complexity

    M. L¨ uck. “Team logic: axioms, expressiveness, complexity”. P hD thesis. Han- nover: Institutionelles Repositorium der Leibniz Universit¨ at Hannover, 2020

    work page 2020

  22. [22]

    On the role of supercompact and extendible cardin als in logic

    M. Magidor. “On the role of supercompact and extendible cardin als in logic”. In: Israel Journal of Mathematics 10 (1971), pp. 147–157

    work page 1971

  23. [23]

    B. Poizat. A course in model theory: an introduction to contemporary ma th- ematical logic. Springer, 2012

    work page 2012

  24. [24]

    Puljuj¨ arvi and D

    J. Puljuj¨ arvi and D. E. Quadrellaro. Compactness in Team Semantics . 2022. arXiv: 2212.03677 [math.LO]

    work page arXiv 2022

  25. [25]

    Accessible categories, saturation and categor icity

    J. Rosick´ y. “Accessible categories, saturation and categor icity”. In: The Jour- nal of Symbolic Logic 62.3 (1997), pp. 891–901. REFERENCES 55

    work page 1997

  26. [26]

    Maximal logics

    J. Sgro. “Maximal logics”. In: Proceedings of the American Mathematical So- ciety 63.2 (1977), pp. 291–298

    work page 1977

  27. [27]

    Classification of non elementary classes II. Abstra ct elementary classes

    S. Shelah. “Classification of non elementary classes II. Abstra ct elementary classes”. In: Classification Theory: Proceedings of the US-Israel Worksh op on Model Theory in Mathematical Logic held in Chicago, Dec. 1 5–19, 1985 . Springer. 2006, pp. 419–497

    work page 1985

  28. [28]

    S. Shelah. Classification theory: and the number of non-isomorphic mod els. Elsevier, 1990

    work page 1990

  29. [29]

    Every two elementarily equivalent models have isomor phic ultra- powers

    S. Shelah. “Every two elementarily equivalent models have isomor phic ultra- powers”. In: Israel Journal of Mathematics 10 (1971), pp. 224–233

    work page 1971

  30. [30]

    Tent and M

    K. Tent and M. Ziegler. A Course in Model Theory . Cambridge University Press, 2009

    work page 2009

  31. [31]

    V¨ a¨ an¨ anen.Dependence Logic: A New Approach to Independence Friendly Logic

    J. V¨ a¨ an¨ anen.Dependence Logic: A New Approach to Independence Friendly Logic. Cambridge University Press, 2007

    work page 2007

  32. [32]

    Second-order and Higher-order Logic

    J. V¨ a¨ an¨ anen. “Second-order and Higher-order Logic”. In: The Stanford Ency- clopedia of Philosophy . Ed. by E. N. Zalta. Fall 2021. Metaphysics Research Lab, Stanford University, 2021

    work page 2021

  33. [33]

    Dependence of variables con strued as an atomic formula

    J. V¨ a¨ an¨ anen and W. Hodges. “Dependence of variables con strued as an atomic formula”. In: Annals of Pure and Applied Logic 161.6 (2010). The proceedings of the IPM 2007 Logic Conference, pp. 817–828. (Tapani Hyttinen) Department of Mathematics and Statistics, University of Helsinki, P.O. Box 68 (Pietari Kalmin katu 5), 00014 Helsinki, Finland. Email...

    work page 2010