The conjunction A∧B holds when both A and B hold.
An AND gate computes a∧b=ab for bits a,b. It is irreversible when only its one-bit output is retained. The Toffoli gate embeds the operation reversibly as (a,b,c)↦(a,b,c⊕ab); setting c=0 preserves the inputs while recording their logical conjunction.
Ancestors (8)
- Logical connective
- Proposition
- Propositional logic
- Mathematical logic
- Foundations of mathematics
- Area of mathematics
- Mathematics
- Home
Incoming links (76)
- AND gate
- Boolean formula
- Boolean operation
- Boolean operations on events
- Boolean satisfiability problem
- Clausal form
- Clause of a Boolean formula
- Coherent logic
- Complement of a set
- Conjunction elimination rule
- Conjunctive normal form
- Countable infinitary logic
- Definable set
- De Morgan dual of a Boolean function
- De Morgan's laws
- Endpoint-false disjunctive normal form
- Exclusive or
- Functional completeness
- Gödel-Gentzen negative translation
- Implicant
- Least Herbrand model
- Logical connective
- Łoś-Tarski preservation theorem
- NAND gate
- Negative translation of a classical proof
- NMOS transistor
- Past exam of the computer science course of the University of Oxford / 2015 / Computational complexity / 2 / d / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Computational complexity / 2 / e / 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 / Knowledge representation and reasoning / 1 / d / i / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Knowledge representation and reasoning / 2 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Logic and proof / 1 / a / 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 / c / 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 / d / Solution
- Past exam of the computer science course of the University of Oxford / 2020 / Artificial intelligence / 2 / e / Solution
- Past exam of the laser science and quantum information processing course of the University of Oxford / 2019 / 5 / a / 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 / 2 / b / Solution
- Past exam of the logic and set theory course of the University of Oxford / 2008 / A / 3 / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2010 / iii / Paper 20 / 4 / a / 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 / 2013 / iii / Paper 74 / 3 / 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 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 25 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 25 / 6 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 121 / 2 / iii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 121 / 3 / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 135 / 3 / 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 / 2014 / 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 / 2014 / Digital systems, linear algebra, introduction to formal proof / 8 / b / 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 (resit) / 2 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / 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 / 2017 / Digital systems, linear algebra, introduction to formal proof / 1 / 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 / 7 / a / 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
- 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 / 8 / e / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Digital systems, linear algebra and introduction to formal proof / 3 / a / Solution
- Primitive positive formula
- Propositional logic
- Set difference
- Set intersection
- Stability of a formula under double negation
- Unsatisfiable Boolean formula
- 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.