Stack Exchange

mobotsar

top accounts reputation activity subscriptions

all accepts posts badges comments revisions reviews

2023
Oct 9		accepted	How does one show termination of a function that is structurally recursive over a type T with subterms of type List T?
Jul 8		revised	How does one show termination of a function that is structurally recursive over a type T with subterms of type List T? added 204 characters in body
Jul 7		asked	How does one show termination of a function that is structurally recursive over a type T with subterms of type List T?
2022
Aug 1		awarded	Self-Learner
May 13		awarded	Scholar
May 13		awarded	Supporter
May 13		revised	I'm stuck trying to prove ∀x : ℕ, 3 \| (x + 5x) with Coq deleted 6 characters in body
May 13		accepted	I'm stuck trying to prove ∀x : ℕ, 3 \| (x + 5x) with Coq
May 10		awarded	Teacher
May 9		answered	I'm stuck trying to prove ∀x : ℕ, 3 \| (x + 5x) with Coq
May 9		comment	I'm stuck trying to prove ∀x : ℕ, 3 \| (x + 5x) with Coq Ah, I got it. Thank you for the tips. I guess that was rather obvious.
May 9		awarded	Student
May 9		comment	I'm stuck trying to prove ∀x : ℕ, 3 \| (x + 5x) with Coq Couchy, thanks for the comment. That does seem like a decent aproach, but then I still have to prove that forall x, 3\|(6 * x), which is the bit that I can't seem to figure out.
May 9		awarded	Editor
May 9		revised	I'm stuck trying to prove ∀x : ℕ, 3 \| (x + 5x) with Coq deleted 1 character in body
May 9		asked	I'm stuck trying to prove ∀x : ℕ, 3 \| (x + 5x) with Coq
May 9		awarded	Informed