I really like this blog post from @hillelogram because it touches upon something I’ve been thinking about a lot lately that didn’t make it into my most recent blog post: how constructive approaches have a really hard time capturing *negative* information.https://twitter.com/zayenz/status/1294172678161674245 …
-
-
Replying to @lexi_lambda @hillelogram
Is this somehow linked with intuitionism and law of excluded middle? Whereby you can’t prove existence by claiming the inverse to be true?
1 reply 0 retweets 3 likes -
Replying to @prathyvsh @hillelogram
Yes. Intuitionistic logic is also known as “constructive logic,” which is not a coincidence. And the Curry-Howard correspondence, which is also deeply related, connects computation to intuitionistic logic.
1 reply 0 retweets 1 like -
Replying to @lexi_lambda @hillelogram
Thanks for the explanation. It has me wondering, would this mean certain predicative structures would be inexpressible in constructive logic? Or are their extensional domains equivalent?
2 replies 0 retweets 0 likes -
Replying to @prathyvsh @hillelogram
This is a really good question. It’s possible for the predicate to be undecidable, in which case it can’t be captured constructively, but that isn’t very interesting—any useful validation predicate will be decidable. And in that case, I’m not sure I know the answer!
1 reply 0 retweets 1 like -
I just spent the better part of an hour thinking about it, and I feel like I *should* know the answer (i.e. it feels like something I should be able to deduce from things I already know), but I’m afraid I don’t have the mathematical knowledge to say. Maybe
@hillelogram does?2 replies 0 retweets 1 like -
Replying to @lexi_lambda @hillelogram
This has been a question I have been mulling over for quite some time now, but I am trying to improve my knowledge of the mathematical machinery/context needed to precisely arrive at a good delineation of what separates these approaches/schools of thought.
1 reply 0 retweets 0 likes -
I feel it is related to why Simply Typed LC is the internal language of CCC while I find such a category missing for untyped LC. There‘s a discussion between some great people in the field on it but it flies over my head to make much sense out of it: https://golem.ph.utexas.edu/category/2006/08/categorifying_cccs_seeing_comp.html …
1 reply 0 retweets 0 likes -
Would love to know if you guys have some pointers on the issue or can refer to something which I can read up to understand more about these approaches. Also, thanks to both of you for bringing more clarity to these issues in a way it applies to day-to-day programming. Cheers!
1 reply 0 retweets 0 likes
I liked Lean's page on "Axioms and Computation": https://leanprover.github.io/theorem_proving_in_lean/axioms_and_computation.html …
A note on terminology: @hillelogram uses "constructive" for "predicate-free" and "predicative" for "uses predicates". But predicates themselves can also be constructive (logically) or non-constructive.
-
-
This looks pretty interesting. Thanks!
0 replies 0 retweets 0 likesThanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.
cognitive psychology. PhD