Proof that type does not have decidable equality in Agda
-
05-11-2019 - |
Question
Can one create such function in Agda ?
ℕ→ℕ-undecidable : ¬ ( (f g : ℕ → ℕ ) → Dec (f ≡ g))
ℕ→ℕ-undecidable = ?
I am particularly interested in proof using cubical Agda.
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange