Proof that type does not have decidable equality in Agda
-
05-11-2019 - |
質問
Can one create such function in Agda ?
ℕ→ℕ-undecidable : ¬ ( (f g : ℕ → ℕ ) → Dec (f ≡ g))
ℕ→ℕ-undecidable = ?
I am particularly interested in proof using cubical Agda.
正しい解決策はありません
所属していません cs.stackexchange