The disjunction A∨B holds when at least one of A and B holds. Constructively, a proof records which disjunct holds and provides its proof.
A logic gate computing inclusive logical disjunction: its output is one exactly when at least one input is one.
Ancestors (8)
- Logical connective
- Proposition
- Propositional logic
- Mathematical logic
- Foundations of mathematics
- Area of mathematics
- Mathematics
- Home
Incoming links (69)
- Boolean operation
- Boolean operations on events
- Boolean satisfiability problem
- Coherent logic
- Complement of a set
- Coordinate-splitting proof of the BK inequality
- Countable infinitary logic
- Definable set
- De Morgan dual of a Boolean function
- De Morgan's laws
- Disjunction introduction rule
- Endpoint-false disjunctive normal form
- Exclusive or
- First-order clause
- Functional completeness
- Gödel-Gentzen negative translation
- Henkin semantics
- Intuitionistic first-order logic
- Intuitionistic propositional logic
- Logical connective
- Logical implication
- NAND gate
- Negative translation of a classical proof
- NMOS transistor
- OR gate
- Past exam of the computer science course of the University of Oxford / 2015 / Databases / 1 / c / ii / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Knowledge representation and reasoning / 1 / a / i / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Knowledge representation and reasoning / 1 / d / ii / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Logic and proof / 1 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Logic and proof / 1 / d / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Logic and proof / 2 / d / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Logic and proof / 3 / a / A / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Logic and proof / 3 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Logic and proof / 3 / d / Solution
- Past exam of the computer science course of the University of Oxford / 2019 / Artificial intelligence / 3 / e / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2007 / A / 1 / iii / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2007 / A / 1 / ii / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2008 / A / 1 / c / b / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2008 / A / 2 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 14 / 6 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 59 / 1 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 59 / 3 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 20 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 21 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 23 / 1 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 135 / 5 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2022 / iii / Paper 120 / 1 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 124 / 1 / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Digital systems, linear algebra, introduction to formal proof / 1 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Digital systems, linear algebra, introduction to formal proof / 7 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Digital systems, linear algebra, introduction to formal proof / 7 / d / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Digital systems, linear algebra, introduction to formal proof / 7 / d / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2014 / Digital systems, linear algebra, introduction to formal proof / 7 / c / iv / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2014 / Discrete mathematics, continuous mathematics and probability / 1 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Digital systems, linear algebra, introduction to formal proof / 7 / c / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Digital systems, linear algebra, introduction to formal proof / 7 / c / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Digital systems, linear algebra, introduction to formal proof / 7 / c / iv / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Digital systems, linear algebra, introduction to formal proof (resit) / 2 / d / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Digital systems, linear algebra, introduction to formal proof / 8 / d / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Digital systems, linear algebra, introduction to formal proof / 1 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Digital systems, linear algebra, introduction to formal proof / 8 / g / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Digital systems, linear algebra, introduction to formal proof resit / 7 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Digital systems, linear algebra, introduction to formal proof resit / 7 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Digital systems, linear algebra, introduction to formal proof resit / 7 / e / Solution
- Propositional logic
- Reduced product
- Set union
- Three-case disjunction elimination
- Verifying a satisfying assignment
Synonyms (1)
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.