MyFinder is a unique search engine with a simple privacy concept in mind. We log your searches but none of the data, it's that simple.
Negation normal formCompactness theoremChomsky normal formGreibach normal formFirst-order logicPropositional formulaCanonical formClosed-form expressionSatisfiabilityFirst-countable spacePreorderSmith normal formFormulaSecond-order logicCanonical normal formAxiomatic systemComposition algebraSemisimple lie algebraContext-free grammarConjunctive normal formLogical formQuantizationMonadic predicate calculusNormSyntactic monoidExpressionHorn clauseTrue quantified boolean formulaClauseComplete boolean algebraSimple groupTransitive closureRiccati equationCartan subalgebraInvertible matrixFormula for primesSatisfiability modulo theoriesFrobenius normal formEquationInitial and terminal objectsModular latticeDisjunctive normal formNon-standard model of arithmeticPolarization identityStrong np-completenessSecond-order arithmeticHerbrand structureClosure operatorGrothendieck inequalityLogit-normal distributionRule of inferenceAlgebraically closed fieldHigher-order logicAxiom of extensionalityConstructible universeUniversal quantificationEuler's criterionPascal's ruleSpecial linear lie algebraMultiplicative functionAlgebraic fractionPythagorean trigonometric identityRecursive languageHilbert's basis theoremBounded quantificationUniversal propertyMonotonic functionBanach latticeAxiom schemaUrysohn's lemmaFixed-point theoremsRational numberSinkhorn's theoremIncidence algebraPerfect numberContext-free languageHypothetical syllogismAliquot sumAlgebraic numberProvability logicRational functionCompletenessSquare triangular numberField normLogarithmic derivativeEquivalence relationFunctional calculusFormal languageCombinatory logicStructureOrdinary differential equationPositive definitenessLinear differential equationCylindric algebraSchur-convex functionBounded inverse theoremCoprime integersHermite normal formFormal proofContext-sensitive language