disjunktiva

Disjunktiva is a term used in logic and linguistics to describe disjunctive constructions—forms that present alternatives joined by a coordinating conjunction such as or. In formal logic, disjunction is a binary connective denoted by the symbol ∨ and read as "p or q." The disjunction is true whenever at least one of its operands is true; it is false only when both operands are false.

In Boolean algebra and computer science, the inclusive disjunction is the standard interpretation, though an exclusive disjunction (xor) also exists in some contexts. In natural language, disjunctiva show as questions and sentences that offer choices: "Would you like tea or coffee?" They can be inclusive (allowing both) or exclusive depending on context or explicit specification.

A related concept is the disjunctive normal form (DNF) in propositional logic and boolean algebra: a formula that is a finite OR of clauses, each clause being an AND of literals. DNF is used for simplification, parsing, and algorithm design, including SAT-solving heuristics and digital circuit design.

The term is also used in linguistics to discuss how disjunctions function across languages, including scope of negation and interaction with quantifiers.

See also: disjunction, exclusive or, disjunctive normal form, De Morgan's laws.