Talk:Boolean expression
Add topicLatest comment: 2 years ago by Chatul in topic Size of boolean expression?
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
WHAT DOES BOOLEAN EXPRESSION AND, and BOOLEAN EXPRESSION OR MEAN
I added links. Timcrall (talk) 18:07, 7 February 2013 (UTC)
mismatch
[edit]- Some programming languages [...] represent OR, AND, NOT and EXCLUSIVE OR by "|", "&", "¬" (infix) and "¬" (prefix).
XOR is a binary operator and NOT is unary, so I guess (though unacquainted with the languages in question) that these need swapping. —Tamfang (talk) 22:32, 13 October 2023 (UTC)
- Yes, the PL/I logical not is a prefix ¬ and the PL/I exclusive or is an infix ¬. -- Shmuel (Seymour J.) Metz Username:Chatul (talk) 14:26, 16 October 2023 (UTC)
Size of boolean expression?
[edit]What is the "size" of a boolean expression? Is it the number of binary operators in it? The article on the parity function says that the size of a Boolean formula computing parity must be O(n^2) and so I hoped this article would explain what the size is. 67.198.37.16 (talk) 07:44, 27 November 2023 (UTC)
- That question is best addressed in talk:Parity function, since that is where the term is used. FWIW, I don't cosider the term to be meaningful for expressions. -- Shmuel (Seymour J.) Metz Username:Chatul (talk) 13:11, 27 November 2023 (UTC)