
TL;DR
This paper introduces ordered black boxes related to pcf theory, focusing on predicting bounds in partial orders and exploring their existence, including trivial cases and propagation properties.
Contribution
It establishes the existence of ordered black boxes linked to pcf theory and examines their properties, including trivial cases and downward propagation.
Findings
Existence of ordered black boxes connected to pcf theory.
Trivial cases of ordered black boxes are identified.
Propagation of ordered black boxes downward is demonstrated.
Abstract
We defined ordered black boxes in which for a partial we try to predict just a bound in to a function restricted to . The existence results are closely related to pcf, propagating downward. We can start with trivial cases.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Advanced Combinatorial Mathematics · Complexity and Algorithms in Graphs
