In one respect, boolean logic is popular because of bits. If we had ternary processors, ternary logic would be more popular. In another respect, boolean logic is popular because it's easy to reason about. The truth tables are relatively small in size and quantity. Not the case with ternary. Ternary is probably way better at modeling the real world, but the complexity could make code hard to understand. Maybe that can…
> Ternary is probably way better at modeling the real world, but the complexity could make code hard to understand. Maybe that can be solved. Is it not true that the brain process in ternary? From the point of view of perception, I believe that we process the world in terms of pairwise comparisons. For example, the atomic indivisible of visual processing is figure/ground separation.
A case against Boolean logic
61–70 of 97 posts
Re: A case against Boolean logic
#62Earlier quoted context omitted.
> The alternative presented is intuitionist logic, which is practically what in the computing world? Where is it used? Or where could or should it be used? The Curry-Howard correspondence[1] tells us that every function is a proof (in the intuitionistic sense) of the proposition represented by its return type, given the axioms ("context" in the article) represented by its arguments. This fact is leveraged heavily by…
Fuzzy logic may be one approximation. Analog processors may be another.
Re: A case against Boolean logic
#63Re: A case against Boolean logic
#64Logic is identification of that which exists . Thus, a proposition either does correspond to reality or doesn’t at all. There is no partial semi-truths: the moment a concept or proposition ceases to describe reality, it becomes false. Contexts don’t change much. They are merely implicit knowledge, subject to the same binary standard. They don’t change the truth, only applicability. Mentioning Gödel here is not just c…
https://plato.stanford.edu/entries/aristotle-noncontradictio...
Re: A case against Boolean logic
#65In one respect, boolean logic is popular because of bits. If we had ternary processors, ternary logic would be more popular. In another respect, boolean logic is popular because it's easy to reason about. The truth tables are relatively small in size and quantity. Not the case with ternary. Ternary is probably way better at modeling the real world, but the complexity could make code hard to understand. Maybe that can…
> If we had ternary processors, ternary logic would be more popular. Why? Boolean logic is older than its namesake, George Boole (1815-1864). Syllogisms are ancient. And we've had ternary systems, as well as others. And what does the third value represent? True and false are pretty universal when it comes to predicates, but anything in between is rather subjective.
enum Bool
{
True,
False,
FileNotFound
};
https://thedailywtf.com/articles/What_Is_Truth_0x3f_Re: A case against Boolean logic
#66Re: A case against Boolean logic
#67So we might be able to construct either, but they meant to say the opposite. Am I to take criticism of Boolean logic from someone who doesn't understand negation?
Re: A case against Boolean logic
#68In one respect, boolean logic is popular because of bits. If we had ternary processors, ternary logic would be more popular. In another respect, boolean logic is popular because it's easy to reason about. The truth tables are relatively small in size and quantity. Not the case with ternary. Ternary is probably way better at modeling the real world, but the complexity could make code hard to understand. Maybe that can…
> The alternative presented is intuitionist logic, which is practically what in the computing world? Where is it used? Or where could or should it be used? The Curry-Howard correspondence[1] tells us that every function is a proof (in the intuitionistic sense) of the proposition represented by its return type, given the axioms ("context" in the article) represented by its arguments. This fact is leveraged heavily by…
Intuitionistic logic doesn’t hold PEM as a priori.
Due to many issues like [0] you actually lose the univalent in HoTT.
That is what allows you to say two programs are equivalent by behavior.
No comment on the OP, but be careful as it is a rabbit hole.
[0] https://ncatlab.org/nlab/show/Diaconescu-Goodman-Myhill+theo...
Re: A case against Boolean logic
#69Re: A case against Boolean logic
#70This blog is one of the most confused and inaccurate collection of writing that I recurrently find on HN. The account spams a deeply flawed blog post about 'Category theory illustrated' (also referenced from this article) where it misstates central theorems in CT and this 'Case against boolean logic' article, which promises an alternative to Boolean logic, but never formulates one. The article instead gestures toward…