Why Church-encoded types aren't sufficient to express inductive proofs?

cs.stackexchange https://cs.stackexchange.com/questions/68808

Question

I've heard some claims that the calculus of constructions without inductive types isn't powerful enough to express proofs by induction. Is that correct? If so, why isn't the Church-encoding sufficient for that?

No correct solution

Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange
scroll top