Definition
In mathematics, a binary operation or dyadic operation is a rule for combining two elements to produce another element. More formally, a binary operation is an operation of arity two.
Related concepts
Abstract logicAckermann set theoryAdditionAleph numberAlgebraAlgebraic logicAlgebraic structureAlphabet (formal languages)ArgumentArithmetic operationsArityAssociativeAtomic formulaAtomic model (mathematical logic)Atomic sentenceAutomata theoryAutomated theorem provingAxiomAxiom of choiceAxiom schemaAxiomatic systemAxiomatization of Boolean algebrasBanach–Tarski paradoxBijectionBinary functionBitwise operationBoolean algebraBoolean algebras canonically definedBoolean functionCantor's diagonal argumentCantor's paradoxCantor's theoremCardinalityCarol WalkerCartesian productCategorical theoryCategory (mathematics)Category of setsCategory theoryChurch encodingChurch–Turing thesisClass (set theory)Classical logicCodomainCommutativeCompactness theoremComplement (set theory)Complete theoryComposition of functionsComputability theoryComputable functionComputable setComputably enumerable setComputer scienceConcrete categoryConjugation (group theory)Conservative extensionConsistencyConstructible universeConstruction of the real numbersConstructive set theoryContinuum hypothesisCountable setDecidability (logic)Decision problemDeductive systemDiagram (mathematical logic)Division (mathematics)Division by zeroDomain of a functionDot productElement (mathematics)Elementary diagramElementary equivalenceElementary function arithmeticEmpty setEnumerationEquation x^y = y^xEquiconsistencyEquivalence relationEric W. WeissteinEuclid's ElementsEuclidean geometryExistential quantificationExponentiationExpression (mathematics)Extension by definitionsExtension by new constant and function namesExtensionalityField (mathematics)Finitary relationFinite-valued logicFinite model theoryFinite setFirst-order logicFixed-point logicForcing (mathematics)Formal grammarFormal languageFormal proofFormal semantics (logic)Formal systemFormation ruleFoundations of geometryFoundations of mathematicsFree logicFree variables and bound variablesFunction (mathematics)Functional predicateFuzzy setGeneral set theoryGrothendieck universeGround expressionGround formulaGroup (mathematics)Gödel's completeness theoremGödel's incompleteness theoremsGödel numberingHalting problemHereditary setHigher-order logicHilbert's axiomsHilbert systemHistory of logicHistory of mathematical logicIdentity elementImage (mathematics)Inaccessible cardinalIndependence (mathematical logic)InferenceInfinite-valued logicInfinite setInfix notationInformation theoryInhabited setInjective functionInterpretation (logic)Interpretation (model theory)Interpretation functionIntersection (set theory)Inverse elementIsomorphismIterated binary operationJuxtapositionKolmogorov complexityKripke's theory of truthKripke–Platek set theoryLambda calculusLarge cardinalLemma (mathematics)Lindström's theoremLinear algebraList of Hilbert systemsList of axiomsList of first-order theoriesList of formal systemsList of mathematical theoriesList of set identities and relationsList of statements independent of ZFCLogicLogical biconditionalLogical conjunctionLogical connectiveLogical consequenceLogical constantLogical disjunctionLogical equalityLogical equivalenceLogical truthLogicismLöwenheim–Skolem theoremMagma (algebra)Many-valued logicMap (mathematics)Material conditionalMathWorldMathematical logicMathematical objectMathematicsMatrix (mathematics)Matrix multiplicationMetalanguageMinimal axioms for Boolean algebraModel complete theoryModel theoryMonadic predicate calculusMonadic second-order logicMonoidMorse–Kelley set theoryMultiplicationNP (complexity)Naive set theoryNatural deductionNegationNew FoundationsNon-Euclidean geometryNon-logical symbolNon-standard modelNon-standard model of arithmeticNumberOpen formulaOperandsOperation (mathematics)Operator (programming)Ordered pairOrdinal analysisOrdinal numberP (complexity)P versus NP problemParadoxes of set theoryPartial algebraPartial functionPartition of a setPeano axiomsPhilosophy of mathematicsPolish notationPower setPredicate (mathematical logic)Predicate logicPredicate variablePrime modelPrimitive recursive arithmeticPrimitive recursive functionPrincipia MathematicaProof of impossibilityProof theoryPropositionPropositional calculusPropositional formulaPropositional variableQuantifier (logic)Quantifier rankReal numbersRecursionRecursive setRelation (mathematics)Reverse Polish notationReverse mathematicsRing (algebra)Robinson arithmeticRule of inferenceRussell's paradoxSatisfiabilitySaturated modelScalar multiplicationScalar productSchröder–Bernstein theoremSecond-order arithmeticSecond-order logicSelf-verifying theoriesSemantic theory of truthSemantics of logicSemigroupSentence (mathematical logic)Sequent calculusSet (mathematics)Set theorySignature (logic)Singleton (mathematics)Skolem arithmeticSoundnessSpectrum of a sentenceSpectrum of a theorySquare of oppositionStrength (mathematical logic)String (formal languages)Structure (mathematical logic)Substitution (logic)Substructure (mathematics)SubtractionSuperscriptSupertaskSurjective functionSyllogismSymbol (formal)Syntax (logic)T-schemaTarski's axiomatization of the realsTarski's axiomsTarski's theory of truthTarski's undefinability theoremTarski–Grothendieck set theoryTautology (logic)Term (logic)Term logicTernary operationTernary relationTetrationTheoremTheories of truthTheory (mathematical logic)Three-valued logicTimeline of mathematical logicTransfer principleTransitive setTrue arithmeticTruth predicateTruth tableTruth valueTuring machineType (model theory)Type theoryUltrafilter (set theory)UltraproductUnary operationUncountable setUndecidable problemUninterpreted functionUnion (set theory)Uniqueness quantificationUniversal algebraUniversal quantificationUniversal setUniverse (mathematics)UrelementValidity (logic)Variable (mathematics)Vector additionVector spaceVenn diagramVon Neumann universeVon Neumann–Bernays–Gödel set theoryWell-formed formulaZermelo–Fraenkel set theory
143 concepts already in your glossary