Talk:Compound Propositions and Useful Rules

The Showing Logical Equivalence section uses 1s and 0s rather than T and F. Why is that?

I don't know why they write it this way. I prefer T and F but it's not uncommon to see it written as 0/1 in computer science. Some (probably most) programming languages will take 0 as false and 1 as true in conditional statements or have integer-valued comparison operators. Maybe sometime I'll write my own course on mathematical logic with a recursive definition of the language/syntax. I think it's actually more succinct that way. AP295 (discuss • contribs) 20:13, 16 November 2023 (UTC)