Fractional Helly property and combinatorics of forking in NTP₂ theories
Pith reviewed 2026-05-20 00:14 UTC · model grok-4.3
The pith
FHP theories generalize NIP as a new subclass of low NTP2 theories with controlled forking.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
FHP theories are structures in which all definable families of sets satisfy the Fractional Helly Property and its variants. They generalize NIP and form a new subclass of low NTP2 theories. Many new examples are given, including ultraproducts of finite fields and of the p-adics. Some results are established about forking and f-generics for amenable groups definable in FHP theories. Several conjectures are made about finitary combinatorial properties of forking in NTP2 theories, with some partial results, and related two-cardinal type counting functions are investigated to address a question of Adler.
What carries the argument
The Fractional Helly Property for definable families of sets, which requires that if a positive fraction of sets in the family have nonempty common intersection, then some small subfamily has a controlled common intersection.
If this is right
- Amenable groups definable in FHP theories admit well-behaved forking and f-generics.
- Finitary combinatorial properties of forking hold in at least some NTP2 theories.
- Two-cardinal type counting functions can be used to study questions about type counting in these theories.
- New examples like ultraproducts of fields fit into the low NTP2 hierarchy via the fractional Helly property.
Where Pith is reading between the lines
- Checking the fractional Helly property on definable families could serve as a practical test for low NTP2 behavior in additional algebraic structures.
- The conjectures on finitary combinatorics of forking might connect to questions about dividing lines in NTP2 theories beyond the FHP case.
- Results on f-generics in amenable groups could extend to questions about generic types in other groups definable in NTP2 theories.
Load-bearing premise
The fractional Helly property holds for every definable family of sets in the structures under study, including the cited ultraproducts, and interacts with forking and f-genericity as expected.
What would settle it
An explicit definable family of sets in the ultraproduct of finite fields or the p-adics that violates the fractional Helly property, or a definable amenable group in an FHP theory where forking fails to behave as predicted.
read the original abstract
We investigate the class of FHP theories, i.e. theories of structures in which all definable families of sets satisfy the Fractional Helly Property (and its variants) from combinatorics. FHP theories generalize NIP and form a new subclass of low NTP$_2$ theories. We give many new examples (including ultraproducts of finite fields and of the $p$-adics) and establish some results about forking and $f$-generics for amenable groups definable in FHP theories. We make several conjectures about finitary combinatorial properties of forking in NTP$_2$ theories and establish some partial results, as well as investigate related two-cardinal type counting functions addressing a question of Adler.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript defines FHP theories as those in which every definable family of sets satisfies the Fractional Helly Property and its variants. It claims that FHP theories generalize NIP and constitute a new subclass of low NTP₂ theories. New examples are supplied, including ultraproducts of finite fields and of the p-adics. Results are proved on forking and f-generics for amenable groups definable in FHP theories. Conjectures are stated on finitary combinatorial properties of forking in NTP₂ theories together with some partial results, and two-cardinal type counting functions are studied in connection with a question of Adler.
Significance. If the FHP verification for the ultraproduct examples holds with uniform bounds and the forking results are correct, the work would introduce a new combinatorial dividing line strictly between NIP and low NTP₂, supplying concrete structures and group-theoretic applications that could organize further study of forking combinatorics.
major comments (2)
- [§3] §3 (examples): the claim that ultraproducts of finite fields and of the p-adics are FHP theories requires an explicit transfer argument. While the finite structures satisfy combinatorial bounds in their own languages, the paper must show via Łoś's theorem that every definable family in the ultraproduct (indexed by formulas with parameters from the ultraproduct) obeys a fractional Helly constant bounded independently of the ultrafilter. This verification is load-bearing for the separation of FHP from NIP inside low NTP₂.
- [§4] §4 (forking and f-generics): the statements about forking and f-generics for amenable groups in FHP theories presuppose that the structures satisfy FHP uniformly; without the transfer argument above, applicability of these results to the cited ultraproducts remains unestablished.
minor comments (1)
- [Abstract] The abstract refers to 'many new examples' and 'variants' of FHP; the main text should contain an explicit list of all examples together with the precise variants of the Fractional Helly Property employed.
Simulated Author's Rebuttal
We thank the referee for the careful reading of our manuscript and for the constructive comments. We address each major comment below.
read point-by-point responses
-
Referee: [§3] §3 (examples): the claim that ultraproducts of finite fields and of the p-adics are FHP theories requires an explicit transfer argument. While the finite structures satisfy combinatorial bounds in their own languages, the paper must show via Łoś's theorem that every definable family in the ultraproduct (indexed by formulas with parameters from the ultraproduct) obeys a fractional Helly constant bounded independently of the ultrafilter. This verification is load-bearing for the separation of FHP from NIP inside low NTP₂.
Authors: We agree that an explicit transfer argument via Łoś's theorem is required to confirm that the fractional Helly constant remains uniform and independent of the ultrafilter when passing to the ultraproduct. In the revised version we will insert a detailed paragraph in §3 spelling out this application of Łoś's theorem, verifying that every definable family in the ultraproduct inherits the property with a bound that does not depend on the choice of ultrafilter. revision: yes
-
Referee: [§4] §4 (forking and f-generics): the statements about forking and f-generics for amenable groups in FHP theories presuppose that the structures satisfy FHP uniformly; without the transfer argument above, applicability of these results to the cited ultraproducts remains unestablished.
Authors: We acknowledge that the forking and f-generic results in §4 presuppose uniform FHP. Once the explicit transfer argument is added to §3, the applicability of these results to the ultraproducts of finite fields and of the p-adics will be secured. We will add a short clarifying remark in §4 noting this dependence. revision: yes
Circularity Check
No circularity: new combinatorial class defined independently with external examples and derived results
full rationale
The paper introduces FHP theories via the external combinatorial Fractional Helly Property applied to definable families, positions them as generalizing NIP inside low NTP2, lists examples including ultraproducts, and derives forking/f-generic statements for amenable groups. No quoted step reduces a claimed prediction or theorem to a fitted parameter, self-definition, or unverified self-citation chain. The ultraproduct examples are presented as new instances satisfying the property by the definition; any verification gap is a completeness issue rather than a reduction by construction. The derivation remains self-contained against the stated combinatorial input and model-theoretic background.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption All definable families of sets in the structure satisfy the Fractional Helly Property and its variants.
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We investigate the class of FHP theories, i.e. theories of structures in which all definable families of sets satisfy the Fractional Helly Property (and its variants) from combinatorics. FHP theories generalize NIP and form a new subclass of low NTP2 theories.
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
-
[1]
Point selections and weak -nets for convex hulls
Noga Alon, Imre B \'a r \'a ny, Zolt \'a n F \"u redi, and Daniel J Kleitman. Point selections and weak -nets for convex hulls. Combinatorics, Probability and Computing , 1(3):189--200, 1992
work page 1992
-
[2]
Distality in valued fields and related structures
Matthias Aschenbrenner, Artem Chernikov, Allen Gehret, and Martin Ziegler. Distality in valued fields and related structures. Trans. Am. Math. Soc. , 375(7):4641--4710, 2022
work page 2022
-
[3]
Vapnik- C hervonenkis density in some theories without the independence property, I
Matthias Aschenbrenner, Alf Dolich, Deirdre Haskell, Dugald Macpherson, and Sergei Starchenko. Vapnik- C hervonenkis density in some theories without the independence property, I . Transactions of the American Mathematical Society , 368(8):5889--5949, 2016
work page 2016
-
[4]
Strong theories, burden, and weight
Hans Adler. Strong theories, burden, and weight. Manuscript , 2007
work page 2007
-
[5]
Combinatorics and geometry in an unstable world
Hans Adler. Combinatorics and geometry in an unstable world. ``Neostability workshop'', Banff, slides, https://www.birs.ca/workshops/2009/09w5113/files/adler.pdf , 2009
work page 2009
-
[6]
Helly's theorem: new variations and applications
Nina Amenta, Jes \'u s A De Loera, and Pablo Sober \'o n. Helly's theorem: new variations and applications. Algebraic and Geometric Methods in Discrete Mathematics , 685:55, 2017
work page 2017
-
[7]
Piercing convex sets and the H adwiger- D ebrunner (p, q) -problem
Noga Alon and Daniel J Kleitman. Piercing convex sets and the H adwiger- D ebrunner (p, q) -problem. Advances in Mathematics , 96(1):103--112, 1992
work page 1992
-
[8]
Transversal numbers for hypergraphs arising in geometry
Noga Alon, Gil Kalai, Ji r i Matou s ek, and Roy Meshulam. Transversal numbers for hypergraphs arising in geometry. Advances in Applied Mathematics , 29(1):79--101, 2002
work page 2002
-
[9]
Asymptotic Differential Algebra and Model Theory of Transseries
Matthias Aschenbrenner, Joris van der Hoeven, and Lou van den Dries. Asymptotic Differential Algebra and Model Theory of Transseries . Princeton University Press, 2017
work page 2017
-
[10]
Almost-disjoint sets, the dense set problem and the partition calculus
James E Baumgartner. Almost-disjoint sets, the dense set problem and the partition calculus. Annals of Mathematical Logic , 9(4), 1976
work page 1976
-
[11]
Colourful and fractional (p, q) -theorems
Imre B \'a r \'a ny, Ferenc Fodor, Luis Montejano, Deborah Oliveros, and Attila P \'o r. Colourful and fractional (p, q) -theorems. Discrete & Computational Geometry , 51(3):628--642, 2014
work page 2014
-
[12]
Imre B \'a r \'a ny and Gil Kalai. Helly-type problems. Bulletin of the American Mathematical Society , 59(4):471--502, 2022
work page 2022
-
[13]
Density of compressible types and some consequences
Martin Bays, Itay Kaplan, and Pierre Simon. Density of compressible types and some consequences. Journal of the European Mathematical Society , 27(7):2751--2793, 2024
work page 2024
-
[14]
The additive groups of Z and Q with predicates for being square-free
Neer Bhardwaj and Chieu-Minh Tran. The additive groups of Z and Q with predicates for being square-free. The Journal of Symbolic Logic , 86(4):1324--1349, 2021
work page 2021
-
[15]
Lascar strong types in some simple theories
Steven Buechler. Lascar strong types in some simple theories. Journal of Symbolic Logic , pages 817--824, 1999
work page 1999
-
[16]
An independence theorem for NTP2 theories
Ita \" Ben Yaacov and Artem Chernikov. An independence theorem for NTP2 theories. The Journal of Symbolic Logic , 79(1):135--153, 2014
work page 2014
-
[17]
Itay Ben-Yaacov, Anand Pillay, and Evgueni Vassiliev. Lovely pairs of models. Annals of pure and applied logic , 122(1-3):235--261, 2003
work page 2003
-
[18]
The number of types in simple theories
Enrique Casanovas. The number of types in simple theories. Annals of Pure and Applied Logic , 98(1-3):69--86, 1999
work page 1999
-
[19]
Enrique Casanovas. Dividing and chain conditions. Archive for Mathematical Logic , 42(8), 2003
work page 2003
-
[20]
Remarks on generic stability in independent theories
Gabriel Conant and Kyle Gannon. Remarks on generic stability in independent theories. Annals of Pure and Applied Logic , 171(2):102736, 2020
work page 2020
-
[21]
Definable convolution and idempotent K eisler measures
Artem Chernikov and Kyle Gannon. Definable convolution and idempotent K eisler measures. Israel Journal of Mathematics , 248(1):271--314, 2022
work page 2022
-
[22]
Definable convolution and idempotent K eisler measures, II
Artem Chernikov and Kyle Gannon. Definable convolution and idempotent K eisler measures, II . Model Theory , 2(2):185--232, 2023
work page 2023
-
[23]
Gabriel Conant, Kyle Gannon, and James Hanson. Keisler measures in the wild. Model Theory , 2(1):1--67, 2023
work page 2023
-
[24]
Definable convolution and idempotent K eisler measures III
Artem Chernikov, Kyle Gannon, and Krzysztof Krupi\'nski. Definable convolution and idempotent K eisler measures III . G eneric stability, generic transitivity, and revised N ewelski's conjecture. arXiv preprint arXiv:2406.00912 , 2024
-
[25]
Valued difference fields and NTP2
Artem Chernikov and Martin Hils. Valued difference fields and NTP2 . Israel Journal of Mathematics , 204(1):299--327, 2014
work page 2014
-
[26]
Indiscernible sequences and arrays in valued fields
Artem Chernikov. Indiscernible sequences and arrays in valued fields. RIMS Kokyuroku , 1718:127--131, 2010
work page 2010
-
[27]
Theories without the tree property of the second kind
Artem Chernikov. Theories without the tree property of the second kind. Annals of Pure and Applied Logic , 165(2):695--723, 2014
work page 2014
-
[28]
Model theory, K eisler measures, and groups
Artem Chernikov. Model theory, K eisler measures, and groups. Bulletin of Symbolic Logic , 24(3):336--339, 2018
work page 2018
-
[29]
Externally definable fsg groups in NIP theories
Artem Chernikov. Externally definable fsg groups in NIP theories. Preprint, arXiv:2506.23265 , 2025
-
[30]
Invariant measures in simple and in small theories
Artem Chernikov, Ehud Hrushovski, Alex Kruckman, Krzysztof Krupi \'n ski, Slavko Moconja, Anand Pillay, and Nicholas Ramsey. Invariant measures in simple and in small theories. Journal of Mathematical Logic , 23(02):2250025, 2023
work page 2023
-
[31]
Enrique Casanovas and Byunghan Kim. A supersimple nonlow theory. Notre Dame Journal of Formal Logic , 39(4):507--518, 1998
work page 1998
-
[32]
Forking and dividing in NTP2 theories
Artem Chernikov and Itay Kaplan. Forking and dividing in NTP2 theories. The Journal of Symbolic Logic , 77(1):1--20, 2012
work page 2012
-
[33]
Artem Chernikov, Itay Kaplan, and Pierre Simon. Groups and fields with NTP _2 . Proceedings of the American Mathematical Society , 143(1):395--406, 2015
work page 2015
-
[34]
Artem Chernikov, Itay Kaplan, and Saharon Shelah. On non-forking spectra. Journal of the European Mathematical Society , 18(12):2821--2848, 2016
work page 2016
-
[35]
Combinatorial properties of nonarchimedean convex sets
Artem Chernikov and Alex Mennen. Combinatorial properties of nonarchimedean convex sets. Pacific Journal of Mathematics , 323(1):1--30, 2023
work page 2023
-
[36]
External definability and groups in NIP theories
Artem Chernikov, Anand Pillay, and Pierre Simon. External definability and groups in NIP theories. Journal of the London Mathematical Society , 90(1):213--240, 2014
work page 2014
-
[37]
On model-theoretic tree properties
Artem Chernikov and Nicholas Ramsey. On model-theoretic tree properties. Journal of Mathematical Logic , 16(02):1650009, 2016
work page 2016
-
[38]
Externally definable sets and dependent pairs
Artem Chernikov and Pierre Simon. Externally definable sets and dependent pairs. Israel Journal of Mathematics , 194(1):409--425, 2013
work page 2013
-
[39]
Externally definable sets and dependent pairs II
Artem Chernikov and Pierre Simon. Externally definable sets and dependent pairs II . Transactions of the American Mathematical Society , 367(7):5217--5235, 2015
work page 2015
-
[40]
On the number of D edekind cuts and two-cardinal models of dependent theories
Artem Chernikov and Saharon Shelah. On the number of D edekind cuts and two-cardinal models of dependent theories. Journal of the Institute of Mathematics of Jussieu , 15(4):771--784, 2016
work page 2016
-
[41]
Artem Chernikov and Pierre Simon. Definably amenable NIP groups. Journal of the American Mathematical Society , 31(3):609--641, 2018
work page 2018
-
[42]
Henselian valued fields and inp-minimality
Artem Chernikov and Pierre Simon. Henselian valued fields and inp-minimality. The Journal of Symbolic Logic , 84(4):1510--1526, 2019
work page 2019
-
[43]
Definable regularity lemmas for NIP hypergraphs
Artem Chernikov and Sergei Starchenko. Definable regularity lemmas for NIP hypergraphs. The Quarterly Journal of Mathematics , 72(4):1401--1433, 2021
work page 2021
-
[44]
Hypergraph regularity and higher arity VC -dimension
Artem Chernikov and Henry Towsner. Hypergraph regularity and higher arity VC -dimension. Preprint, arXiv:2010.00726v1 , 2020
-
[45]
Definable sets over finite fields
Zo \'e Chatzidakis, Lou Van Den Dries, and Angus Macintyre. Definable sets over finite fields. J. reine angew. Math , 427:107--135, 1992
work page 1992
-
[46]
A new extension of D irichlet's theorem on prime numbers
Leonard E Dickson. A new extension of D irichlet's theorem on prime numbers. Messenger of Math , 33(1904):155--161, 1904
work page 1904
-
[47]
Geometric group theory , volume 63
Cornelia Dru t u and Michael Kapovich. Geometric group theory , volume 63. American Mathematical Soc., 2018
work page 2018
-
[48]
The discrete yet ubiquitous theorems of C arath \'e odory, H elly, S perner, T ucker, and T verberg
Jes \'u s De Loera, Xavier Goaoc, Fr \'e d \'e ric Meunier, and Nabil Mustafa. The discrete yet ubiquitous theorems of C arath \'e odory, H elly, S perner, T ucker, and T verberg. Bulletin of the American Mathematical Society , 56(3):415--511, 2019
work page 2019
-
[49]
On a sumset conjecture of E rd o s
Mauro Di Nasso, Isaac Goldbring, Renling Jin, Steven Leth, Martino Lupini, and Karl Mahlburg. On a sumset conjecture of E rd o s. Canad. J. Math. , 67(4):795--809, 2015
work page 2015
-
[50]
An upper-bound theorem for families of convex sets
J \"u rgen Eckhoff. An upper-bound theorem for families of convex sets. Geometriae Dedicata , 19(2):217--227, 1985
work page 1985
-
[51]
On coloring graphs to maximize the proportion of multicolored k-edges
Paul Erd o s and Daniel J Kleitman. On coloring graphs to maximize the proportion of multicolored k-edges. Journal of Combinatorial Theory , 5(2):164--169, 1968
work page 1968
-
[52]
On uniform definability of types over finite sets for NIP formulas
Shlomo Eshel and Itay Kaplan. On uniform definability of types over finite sets for NIP formulas. Journal of Mathematical Logic , 21(03):2150015, 2021
work page 2021
-
[53]
A survey of asymptotic classes and measurable structures
Richard Elwes and Dugald Macpherson. A survey of asymptotic classes and measurable structures. London Mathematical Society Lecture Note Series , 350:125, 2008
work page 2008
-
[54]
On extremal problems of graphs and generalized graphs
Paul Erd o s. On extremal problems of graphs and generalized graphs. Israel Journal of Mathematics , 2(3):183--190, 1964
work page 1964
-
[55]
Relative decidability and definability in H enselian valued fields
Joseph Flenner. Relative decidability and definability in H enselian valued fields. The Journal of Symbolic Logic , 76(4):1240--1260, 2011
work page 2011
-
[56]
On finite set-systems whose every intersection is a kernel of a star
Zolt \'a n F \"u redi. On finite set-systems whose every intersection is a kernel of a star. Discrete mathematics , 47:129--132, 1983
work page 1983
-
[57]
Local K eisler measures and NIP formulas
Kyle Gannon. Local K eisler measures and NIP formulas. The Journal of Symbolic Logic , 84(3):1279--1292, 2019
work page 2019
-
[58]
Concerning K eisler measures over ultraproducts
Kyle Gannon. Concerning K eisler measures over ultraproducts. Annals of Pure and Applied Logic , 176(1):103492, 2025
work page 2025
-
[59]
An introduction to amenable groups
Alejandra Garrido. An introduction to amenable groups. Lecture notes, http://people.maths.ox.ac.uk/kar/amenable.pdf
-
[60]
On V apnik- C hervonenkis density over indiscernible sequences
Vincent Guingona and Cameron Donnay Hill. On V apnik- C hervonenkis density over indiscernible sequences. Mathematical Logic Quarterly , 60(1-2):59--65, 2014
work page 2014
-
[61]
On a common generalization of S helah's 2-rank, dp-rank, and o-minimal dimension
Vincent Guingona and Cameron Donnay Hill. On a common generalization of S helah's 2-rank, dp-rank, and o-minimal dimension. Annals of Pure and Applied Logic , 166(4):502--525, 2015
work page 2015
-
[62]
The theory of ordered abelian groups does not have the independence property
Yuri Gurevich and Peter H Schmitt. The theory of ordered abelian groups does not have the independence property. Transactions of the American Mathematical Society , 284(1):171--182, 1984
work page 1984
-
[63]
On uniform definability of types over finite sets
Vincent Guingona. On uniform definability of types over finite sets. The Journal of Symbolic Logic , 77(2):499--514, 2012
work page 2012
-
[64]
Ehud Hrushovski, Krzysztof Krupi \'n ski, and Anand Pillay. On first order amenability. Preprint, arXiv:2004.08306 , 2020
-
[65]
Amenability, connected components, and definable actions
Ehud Hrushovski, Krzysztof Krupi \'n ski, and Anand Pillay. Amenability, connected components, and definable actions. Selecta Mathematica , 28(1):16, 2022
work page 2022
-
[66]
Ehud Hrushovski and Anand Pillay. On NIP and invariant measures. Journal of the European Mathematical Society , 13(4):1005--1061, 2011
work page 2011
-
[67]
Ehud Hrushovski, Ya'acov Peterzil, and Anand Pillay. Groups, measures, and the NIP . Journal of the American Mathematical Society , 21(2):563--596, 2008
work page 2008
-
[68]
A note on generically stable measures and fsg groups
Ehud Hrushovski, Anand Pillay, and Pierre Simon. A note on generically stable measures and fsg groups. Notre Dame Journal of Formal Logic , 53(4):599--605, 2012
work page 2012
-
[69]
Generically stable and smooth measures in NIP theories
Ehud Hrushovski, Anand Pillay, and Pierre Simon. Generically stable and smooth measures in NIP theories. Transactions of the American Mathematical Society , 365(5):2341--2366, 2013
work page 2013
-
[70]
Introduction to cardinal arithmetic
Michael Holz, Karsten Steffens, and Edmund Weitz. Introduction to cardinal arithmetic . Springer Science & Business Media, 2009
work page 2009
-
[71]
Epsilon-nets and simplex range queries
David Haussler and Emo Welzl. Epsilon-nets and simplex range queries. In Proceedings of the second annual symposium on Computational geometry , pages 61--71, 1986
work page 1986
-
[72]
Compression schemes, stable definable families, and o-minimal structures
Hunter R Johnson and Michael C Laskowski. Compression schemes, stable definable families, and o-minimal structures. Discrete & Computational Geometry , 43(4):914--926, 2010
work page 2010
-
[73]
The canonical topology on dp-minimal fields
Will Johnson. The canonical topology on dp-minimal fields. Journal of Mathematical Logic , 18(02):1850007, 2018
work page 2018
-
[74]
Intersection patterns of convex sets
Gil Kalai. Intersection patterns of convex sets. Israel Journal of Mathematics , 48(2):161--174, 1984
work page 1984
-
[75]
A definable (p, q) -theorem for NIP theories
Itay Kaplan. A definable (p, q) -theorem for NIP theories. Advances in Mathematics , 436:109418, 2024
work page 2024
-
[76]
The number of types in a first order theory
HJ Keisler. The number of types in a first order theory. Notices of the American Mathematical Society , 21:A--316, 1974
work page 1974
-
[77]
H Jerome Keisler. Six classes of theories. Journal of the Australian Mathematical Society , 21(3):257--266, 1976
work page 1976
-
[78]
The stability function of a theory
H Jerome Keisler. The stability function of a theory. The Journal of Symbolic Logic , 43(3):481--486, 1978
work page 1978
-
[79]
H Jerome Keisler. Measures and forking. Annals of Pure and Applied Logic , 34(2):119--169, 1987
work page 1987
-
[80]
John L Kelley. Measures on B oolean algebras. Pacific Journal of Mathematics , 9(4):1165--1177, 1959
work page 1959
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.