output
19962026
most citedA dusty veil shading Betelgeuse during its Great Dimming

101 citations

Showing math.LOShow all

7 papers · 1 filter

math.LO2025★ 4 cited

Axiomatizing Rumsfeld Ignorance

Jie Fan

In a recent paper, Kit Fine presents some striking results concerning the logical properties of (first-order) ignorance, second-order ignorance and Rumsfeld ignorance. However, Rum…

math.LO2022★ 1 cited

On Erdos--Dushnik--Miller theorem without AC

Amitayu Banerjee, Alexa Gopaulsingh

In set theory without the Axiom of Choice, we study the possible placement of Erdos-Dushnik-Miller theorem restricted to an uncountable set of vertices in the hierarchy of weak cho…

math.LO2022

Unreachability of Inductive-Like Pointclasses in

Derek Levinson, Itay Neeman, Grigor Sargsyan

Hjorth proved from that there is no sequence of distinct sets of length . Sargsyan extended Hjorth's technique to show there is no sequence of distinc…

math.LO2020★ 4 cited

Maximal independent sets, variants of chain/antichain principle and cofinal subsets without AC

Amitayu Banerjee

In set theory without the Axiom of Choice (AC), we observe new relations of the following statements with weak choice principles. 1. Every locally finite connected graph has a maxi…

math.LO2019★ 2 cited

Chromatic number of the product of graphs, graph homomorphisms, Antichains and cofinal subsets of posets without AC

Amitayu Banerjee, Zalán Gyenis

We have observations concerning the set theoretic strength of the following combinatorial statements without the axiom of choice. 1. If in a partially ordered set, all chains are f…

math.LO2018★ 1 cited

On The Computability of Perfect Subsets of Sets with Positive Measure

Chitat Chong, Wei Li, Wei Wang +1

A set with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak c…