Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

The type ℕ∞ has decidable equality iff WLPO holds #4151

Open
jkingdon opened this issue Aug 22, 2024 · 1 comment
Open

The type ℕ∞ has decidable equality iff WLPO holds #4151

jkingdon opened this issue Aug 22, 2024 · 1 comment

Comments

@jkingdon
Copy link
Contributor

This is mentioned as background knowledge at https://mathstodon.xyz/@MartinEscardo/113001536506411322 but I don't see it proved in iset.mm, or an issue for it.

In iset.mm notation this would be

A. x e. NN+oo A. y e. NN+oo DECID x = y <-> _om e. WOmni
@benjub
Copy link
Contributor

benjub commented Aug 22, 2024

/!\ Spoiler alert below the dots /!\

...

...

...

Forward implication:
Given a proposition $f \colon \omega \to 2$, define $g \in \mathbb{N}_\infty$ by $g(n) \coloneqq \min ( f(i) \mid i \leq n)$.
Then, $g$ is the point at infinity iff $\forall n \in \omega f(n)=1$.

Backward implication:
Decidability of equality with the point at infinity follows from the fact that $\mathbb{N}_\infty \subseteq \Omega$, and decidability of equality in $\mathbb{N}$ has been proved.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
Status: No status
Development

No branches or pull requests

2 participants