Definition
A formal grammar is a set of symbols and the production rules for rewriting some of them into every possible string of a formal language over an alphabet. A grammar does not describe the meaning of the strings—only their form.
Related concepts
Abstract logicAbstract machineAbstract syntax treeAckermann set theoryAdaptive grammarAffix grammarAleph numberAlgebraic logicAlphabet (formal languages)Ambiguous grammarAperiodic finite state automatonApplied mathematicsArgumentArityAtomic formulaAtomic model (mathematical logic)Atomic sentenceAttribute grammarAutomata theoryAutomated theorem provingAxiomAxiom of choiceAxiom schemaAxiomatic systemAxiomatization of Boolean algebrasBackus–Naur formBanach–Tarski paradoxBig O notationBijectionBinary operationBoolean algebraBoolean algebras canonically definedBoolean functionCantor's diagonal argumentCantor's paradoxCantor's theoremCardinalityCartesian productCategorial grammarCategorical theoryCategory (mathematics)Category of setsCategory theoryChomsky hierarchyChurch encodingChurch–Turing thesisClass (set theory)Classical logicCodomainCompactness theoremCompilerComplement (set theory)Complete theoryCompositional semanticsComputability theoryComputable functionComputable setComputably enumerable setComputational complexity of matrix multiplicationComputational linguisticsConcrete categoryConcrete syntax treeConservative extensionConsistencyConstructible universeConstruction of the real numbersConstructive set theoryContext-free grammarContext-free languageContext-sensitive grammarContext-sensitive languageContinuum hypothesisCountable setDecidability (logic)Decider (Turing machine)Decision problemDeductive systemDeep structure and surface structureDeterministic acyclic finite state automatonDeterministic context-free grammarDeterministic context-free languageDeterministic pushdown automatonDiagram (mathematical logic)Disjoint setsDomain of a functionDonald KnuthEarley parserElement (mathematics)Elementary diagramElementary equivalenceElementary function arithmeticEmbedded pushdown automatonEmpty setEmpty stringEnumerationEquiconsistencyEquivalence relationEuclid's ElementsEuclidean geometryExistential quantificationExpression (mathematics)Expressivity (computer science)Extended Backus–Naur formExtension by definitionsExtension by new constant and function namesExtensionalityFinitary relationFinite-state machineFinite-valued logicFinite languageFinite model theoryFinite setFirst-order logicFixed-point logicForcing (mathematics)Formal languageFormal languagesFormal methodsFormal proofFormal semantics (logic)Formal systemFormal verificationFormation ruleFoundations of geometryFoundations of mathematicsFree logicFree variables and bound variablesFunction (mathematics)Functional predicateFuzzy setGeneral set theoryGenerative grammarGrammarGrammar frameworkGrothendieck universeGround expressionGround formulaGödel's completeness theoremGödel's incompleteness theoremsGödel numberingHalting problemHereditary setHigher-order logicHilbert's axiomsHilbert systemHistory of logicHistory of mathematical logicIRE Transactions on Information TheoryImage (mathematics)Inaccessible cardinalIndependence (mathematical logic)Indexed grammarIndexed languageInferenceInfinite-valued logicInfinite setInformation theoryInhabited setInjective functionInterpretation (logic)Interpretation (model theory)Interpretation functionIntersection (set theory)IsomorphismJPR02Kleene starKolmogorov complexityKripke's theory of truthKripke–Platek set theoryL-systemLL parserLR parserLambda calculusLarge cardinalLeft recursionLemma (mathematics)Lindström's theoremLinear bounded automatonLinear context-free rewriting languageLinear context-free rewriting systemLinguisticsLink grammarList 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 truthLogicismLojbanLöwenheim–Skolem theoremMany-valued logicMap (mathematics)Material conditionalMathematical linguisticsMathematical logicMathematical notationMathematical objectMetalanguageMichael A. HarrisonMinimal axioms for Boolean algebraModel complete theoryModel theoryMonadic predicate calculusMonadic second-order logicMorse–Kelley set theoryMouton de GruyterNP (complexity)Naive set theoryNatural deductionNatural language processingNegationNested stack automatonNested wordNew FoundationsNoam ChomskyNon-Euclidean geometryNon-logical symbolNon-recursive grammarNon-standard modelNon-standard model of arithmeticNonterminal symbolOpen formulaOperation (mathematics)Ordinal analysisOrdinal numberPTIMEP (complexity)P versus NP problemParadoxes of set theoryParse treeParserParsing algorithmParsing expression grammarPartition of a setPeano axiomsPhilosophy of mathematicsPhrase structure grammarPost canonical systemPower setPredicate (mathematical logic)Predicate logicPredicate variablePrime modelPrimitive recursive arithmeticPrimitive recursive functionPrincipia MathematicaProduction (computer science)Programming languageProgramming language theoryProof of impossibilityProof theoryProper subsetPropositionPropositional calculusPropositional formulaPropositional variablePumping lemma for context-free languagesPushdown automatonQuantifier (logic)Quantifier rankRange concatenation grammarsRange concatenation languageRecursionRecursion (computer science)Recursive languageRecursive setRecursively enumerable languageReflexive transitive closureRegular expressionRegular grammarRegular languageRelation (mathematics)Reverse mathematicsRewriting systemRobinson arithmeticRule of inferenceRussell's paradoxSatisfiabilitySaturated modelSchröder–Bernstein theoremSecond-order arithmeticSecond-order logicSelf-verifying theoriesSemantic theory of truthSemanticsSemantics (computer science)Semantics of logicSemi-Thue systemSentence (mathematical logic)Sequent calculusSet-builder notationSet (mathematics)Set theorySeymour GinsburgShape grammarSignature (logic)Singleton (mathematics)Skolem arithmeticSoundnessSpectrum of a sentenceSpectrum of a theorySquare of oppositionStar-free languageStrength (mathematical logic)String (computer science)String (formal languages)Structure (mathematical logic)Substitution (logic)Substructure (mathematics)SupertaskSurjective functionSyllogismSymbol (formal)Syntactic sugarSyntax (logic)Syntax analysisT-schemaTarski's axiomatization of the realsTarski's axiomsTarski's theory of truthTarski's undefinability theoremTarski–Grothendieck set theoryTautology (logic)Term (logic)Term logicTerminal and nonterminal symbolsTerminal symbolTheoremTheoretical computer scienceTheoretical linguisticsTheories of truthTheory (mathematical logic)Thread automatonThree-valued logicTimeline of mathematical logicTop-down parsingTop-down parsing languageTransfer principleTransitive setTree-adjoining grammarTree stack automatonTrue arithmeticTruth predicateTruth tableTruth valueTupleTuring machineType (model theory)Type theoryUltrafilter (set theory)UltraproductUncountable setUndecidable problemUninterpreted functionUnion (set theory)Uniqueness quantificationUniversal quantificationUniversal setUniverse (mathematics)Unrestricted grammarUrelementValidity (logic)Variable (mathematics)Venn diagramVon Neumann universeVon Neumann–Bernays–Gödel set theoryWell-formed formulaZermelo–Fraenkel set theory
139 concepts already in your glossary