15 ms·
>>> intuitionism, which gives us a type of logic where some propositions are neither true nor false but essentially undecidable. Between math and software deve
by TeMPOraL 5y ago
>>> intuitionism, which gives us a type of logic where some propositions are neither true nor false but essentially undecidable.
Between math and software development, I feel I've encountered this idea at least three times (+ rediscovered it independently), under different names - "3-value logic", "3-state booleans" - without ever hearing about "intuitionism". Thanks for mentioning it, and now I wonder how it all relates (i.e. I'm about to get stuck on Wikipedia).
> interpreting "A is true" to mean "I have a proof of A", and likewise "not A is true" means "I have a proof of not A".
Makes me think of an interesting progression I've also seen when studying maths and then (classical) AI algorithms. You start with boolean logic, then figure out you need to represent lack of knowledge/certainty and get 3-state logic. Then someone notices that there are degrees to being sure, and you get fuzzy logic[0], representing logical values as real numbers. And then someone notices that this smells awful lot like probability theory, and you get Bayesian probability as applied to reasoning, with all the extra concepts like using whole probability distributions as first-class logic values.
--
[0] - I'm not sure how much mathematical rigour there is to it; it's something I've learned when studying AI for videogames.
- SquishyPanda23 5y agoThis is an interesting point. I haven't really thought about the connection between intuitionistic logic and three-valued logic before. They are different logics in general though. 3-value logic is more like the A is True, False or None/Unknown. Another interpretation one can put on intuitionistic logic is game semantics. Here a statement is true if the verifier has a winning strategy to prove the proposition. It's false if the falsifier has a winning strategy. Then intuitionistic logic corresponds roughly to the idea that some games don't have a winning strategy for either player. So here (and in the proofs example I gave above) is that we get an idea of "neither true nor false" that is represented by the lack of an explicit rule for concluding truth or falsity in some cases. In contrast, 3-valued logic gets at the idea of "neither true or false" by introducing another symbol (e.g. "None" or "-1") together with new operators that operate on sentences with that symbol. So we get one from classical logic by deleting something (namely the law of the excluded middle) and the other by adding something.