:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Cholak, Peter, Dobrinen, Natasha, McCoy, Charlie
Format:	Preprint
Publié:	2026
Sujets:	Logic
Accès en ligne:	https://arxiv.org/abs/2604.09894
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Borel sets of Rado graphs and Ramsey's Theorem
par: Dobrinen, Natasha
Publié: (2019)

Cofinal types of ultrafilters over measurable cardinals
par: Benhamou, Tom, et autres
Publié: (2023)

On the Tukey types of Fubini products
par: Benhamou, Tom, et autres
Publié: (2023)

Ramsey Theory and Bounding in Arithmetic
par: Cholak, Peter
Publié: (2026)

Exact big Ramsey degrees for finitely constrained binary free amalgamation classes
par: Balko, Martin, et autres
Publié: (2021)

Tukey-idempotency and strong p-points
par: Benhamou, Tom, et autres
Publié: (2025)

Big Ramsey degrees and the two-branching pseudotree
par: Chodounský, David, et autres
Publié: (2025)

Low$_2$ computably enumerable sets have hyperhypersimple supersets
par: Cholak, Peter, et autres
Publié: (2024)

Random graph coloring and the instability
par: Akito Tsuboi
Publié: (2024)

Characterisation of the big Ramsey degrees of the generic partial order
par: Balko, Martin, et autres
Publié: (2023)

Stationary list colorings
par: Hayashi, Yusuke
Publié: (2025)

Decomposing graphs into stable and ordered parts
par: Buffière, Hector, et autres
Publié: (2025)

Reflexive graph lenses in univalent foundations
par: Sterling, Jonathan
Publié: (2024)

Flipper games for monadically stable graph classes
par: Gajarský, Jakub, et autres
Publié: (2023)

Continuous colorings on compact spaces
par: de Rancourt, Noé, et autres
Publié: (2025)

On first-order transductions of classes of graphs
par: Braunfeld, Samuel, et autres
Publié: (2022)

The strength of Ramsey Theorem for coloring relatively large sets
par: Carlucci, Lorenzo, et autres
Publié: (2012)

Epsilon-saturation for stable graphs and Littlestone classes
par: Malliaris, Maryanthe, et autres
Publié: (2025)

On chromatic number of countable graphs
par: Kikyo, Hirotaka, et autres
Publié: (2026)

Effectiveness and strong graph indivisibility
par: Dzhafarov, Damir D., et autres
Publié: (2024)

A very sharp threshold for first order logic distinguishability of random graphs
par: Benjamini, Itai, et autres
Publié: (2022)

Decomposition horizons and a characterization of stable hereditary classes of graphs
par: Braunfeld, Samuel, et autres
Publié: (2022)

Complete representation by partial functions for signatures containing antidomain restriction
par: McLean, Brett
Publié: (2023)

Ultrafilter extensions of bounded graphs are elementary
par: Molnár, Zalán
Publié: (2024)

Borel line graphs
par: Anderson, James, et autres
Publié: (2023)

Modal reduction principles: a parametric shift to graphs
par: Conradie, Willem, et autres
Publié: (2024)

On the generalized coloring numbers
par: Siebertz, Sebastian
Publié: (2025)

Difference-restriction algebras with operators
par: Borlido, Célia, et autres
Publié: (2025)

Uniformization of ladder system colorings and stationary precaliber forcings
par: Aoki, Yushiro
Publié: (2025)

Elementary first-order model checking for sparse graphs
par: Gajarský, Jakub, et autres
Publié: (2024)

A Borel graphable equivalence relation with no Borel graphing of diameter two
par: Lutz, Patrick
Publié: (2026)

Verifying Solutions to Semantics-Guided Synthesis Problems
par: Murphy, Charlie, et autres
Publié: (2024)

On statistical learning of graphs
par: Cipriani, Vittorio, et autres
Publié: (2025)

The ineffectiveness of the regularity lemma for bounded degree graphs
par: Lyons, Clark, et autres
Publié: (2025)

Topology, forcing, and graph colourings
par: Greenberg, Noam, et autres
Publié: (2026)

Unfoldings and coverings of weighted graphs
par: Courcelle, Bruno
Publié: (2022)

Probabilistic Strategy Logic with Degrees of Observability
par: Mu, Chunyan, et autres
Publié: (2024)

Constant time testability of first-order logic with modulo counting on finitary graphs
par: Adler, Isolde, et autres
Publié: (2026)

Borel fractional perfect matchings in quasi-transitive amenable graphs
par: Murray, Sam
Publié: (2025)

Trees in graphs of large linear cliquewidth
par: Bojańczyk, Mikołaj, et autres
Publié: (2025)