Propositions are α-decidable for Brouwer ordinals α, generalizing decidability with closure under conjunction and ω²-decidability for countable meets of semidecidable properties.
Counterexamples in cubical sets
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Generalized Decidability via Brouwer Trees
Propositions are α-decidable for Brouwer ordinals α, generalizing decidability with closure under conjunction and ω²-decidability for countable meets of semidecidable properties.