Boolean Variable

A Boolean Variable is a categorical variable whose variable domain is a binary set.

• AKA: Binary Variable.
• Context:
  • It can be a Logic Variable (whose domain is the Truth Set).
    • used in a Propositional Logic Sentence.
    • It can be a Set Member of a Propositional Variable Set.
  • …
• Example(s):
  • Binary Random Variable.
  • …
• Counter-Example(s):
  • Numeric Variable.
• See: Boolean Attribute.

---

---

References

2009

• http://en.wiktionary.org/wiki/Boolean_variable
  • 1. (mathematics, logic, computing) Any variable, from the domain of Boolean algebra, having one of only two values
• http://en.wiktionary.org/wiki/propositional_variable
  • 1. (logic) A variable that can either be true or false.

• (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Boolean_data_type
  • In computer science, the Boolean data type, sometimes called logical data type, is a primitive data type having one of two values: true or false. Many systems represent true as non-zero (often 1, or -1) and false as zero. It is the special case of a binary numeric data type of only one digit, or bit, and can also be represented in any other radix by restricting the range of allowed values for certain operations.
  • In some languages the Boolean data type is defined to represent more than two truth values. For instance the ISO SQL:1999 standard defined a Boolean data type for SQL which could hold three possible values: true, false, unknown (SQL null is treated as equivalent to the unknown truth value, but only for the Boolean data type). This defies the law of excluded middle, though very often useful.
• (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Propositional_variable
  • In mathematical logic, a propositional variable (also called a sentential variable or sentential letter) is a variable which can either be true or false. Propositional variables are the basic building-blocks of propositional formulas, used in propositional logic and higher logics.
  • Formulas in logic are typically built up recursively from some propositional variables, some number of logical connectives, and some logical quantifiers. Propositional variables are the atomic formulas of propositional logic. For example, in a given propositional logic, we might define a formula as follows:
    • Every propositional variable is a formula.
    • Given a formula X the negation ¬X is a formula.
    • Given two formulas X and Y, and a binary connective b (such as the logical conjunction ∧), then (X b Y) is a formula. (Note the parentheses.)
  • In this way, all of the formulas of propositional logic are built up from propositional variables as a basic unit.

2005

• (Goldrei, 2005) ⇒ Derek Goldrei. (2005). “Propositional and Predicate Calculus: A Model of Argument." Springer.
  • QUOTE: With considerations like these in mind, we shall define our formal statements as follows. First we shall specify the formal language, that is, the symbols from which strings can be formed. We shall always allow brackets - these will be needed to avoid ambiguity. We shall specify a set [math]\displaystyle{ P }[/math] of basic statements, called propositional variables. From these we can build more complex statements by joining statements together using brackets and symbols in a set [math]\displaystyle{ S }[/math] of connectives, which are going to represents ways of connecting statements to each other, like V for 'or' and other symbols mentioned earlier. ...
  • QUOTE: Convention for variables We shall normally use individual lower case letters like p, q, r, s, ... and subscripted letters like p₀,p₁,p₂,...p_n,... for our propositional variables. Distinct letters or subscripts give us distinct symbols. When we don't specific the set [math]\displaystyle{ P }[/math] of propositional variables in a precise way, we shall use p,q,r and so on to represent different members of the set.

---