blanketglossary

Formal language

Definition

In logic, mathematics, computer science, and linguistics, a formal language is a set of strings whose symbols are taken from a set called "alphabet".

Related concepts

ASCIIAbstract family of languagesAbstract logicAbstract machineAbstract syntax treeAckermann set theoryAleph numberAlgebraic logicAlgorithmAlphabetAlphabet (formal languages)AlphanumericAperiodic finite state automatonArgumentArityArto SalomaaAtomic formulaAtomic model (mathematical logic)Atomic sentenceAutomata theoryAutomated theorem provingAxel ThueAxiomAxiom of choiceAxiom schemaAxiomatic systemAxiomatization of Boolean algebrasBackus–Naur formBanach–Tarski paradoxBegriffsschriftBijectionBinary operationBoolean algebraBoolean algebras canonically definedBoolean functionCambridge University PressCantor's diagonal argumentCantor's paradoxCantor's theoremCardinalityCarl Friedrich GaussCartesian productCategorical theoryCategory (mathematics)Category of setsCategory theoryCharacter encodingCharacteristica universalisChomskyChomsky hierarchyChurch encodingChurch–Turing thesisClass (set theory)Classical logicClosure (mathematics)CodomainColorless green ideas sleep furiouslyCombinatorics on wordsCompactness theoremCompiler-compilerComplement (set theory)Complete theoryComplexity classComputability theoryComputable functionComputable setComputably enumerable setComputational complexity theoryComputational linguisticsComputer scienceConcatenationConcrete categoryCone (formal languages)Conservative extensionConsistencyConstructible universeConstruction of the real numbersConstructive set theoryContext-free grammarContext-free languageContext-sensitive grammarContext-sensitive languageContext free languageContext sensitive languageContinuum hypothesisCountable setDCFLDecidability (logic)Decider (Turing machine)Decision problemDecision procedureDeductive apparatusDeductive systemDegeneracy (mathematics)Deterministic acyclic finite state automatonDeterministic context-free grammarDeterministic context-free languageDeterministic pushdown automatonDiagram (mathematical logic)Domain of a functionElement (mathematics)Elementary diagramElementary equivalenceElementary function arithmeticEmbedded pushdown automatonEmil PostEmpty setEncyclopedia of MathematicsEnumerationEquiconsistencyEquivalence relationEuclid's ElementsEuclidean geometryEuropean Mathematical SocietyExecutableExistential quantificationExpression (mathematics)Extension by definitionsExtension by new constant and function namesExtensionalityFORTRANFinitary relationFinite-state automatonFinite-state machineFinite-valued logicFinite languageFinite model theoryFinite setFirst-order logicFixed-point logicForcing (mathematics)Formal grammarFormal languagesFormal methodFormal methodsFormal proofFormal semantics (logic)Formal semantics (natural language)Formal systemFormal verificationFormalism (philosophy of mathematics)Formation ruleFoundations of geometryFoundations of mathematicsFree logicFree monoidFree variables and bound variablesFunction (mathematics)Functional predicateFuzzy setGauss notationGeneral set theoryGeorge BooleGottfried LeibnizGottlob FregeGrammar frameworkGrothendieck universeGround expressionGround formulaGrzegorz RozenbergGödel's completeness theoremGödel's incompleteness theoremsGödel numberingHalting problemHeinz ZemanekHereditary setHigher-order logicHilbert's axiomsHilbert systemHistory of logicHistory of mathematical logicIdentifierImage (mathematics)Inaccessible cardinalIndependence (mathematical logic)Indexed grammarIndexed languageInferenceInfinite-valued logicInfinite setInformation theoryInhabited setInjective functionIntermediate codeInterpretation (logic)Interpretation (model theory)Interpretation functionIntersection (set theory)Introduction to Automata Theory, Languages, and ComputationIsomorphismJeffrey UllmanJohn BackusJohn HopcroftKeyword (computer programming)Kleene starKolmogorov complexityKripke's theory of truthKripke–Platek set theoryLambda calculusLarge cardinalLemma (mathematics)Leonardo Torres QuevedoLex programming toolLexical analyzerLindström's theoremLinear bounded automatonLinear context-free rewriting languageLinear context-free rewriting systemLinguisticsList of Hilbert systemsList of axiomsList of first-order theoriesList of formal systemsList of mathematical theoriesList of set identities and relationsList of statements independent of ZFCLiterary languageLogicLogical biconditionalLogical conjunctionLogical connectiveLogical consequenceLogical constantLogical disjunctionLogical equalityLogical equivalenceLogical truthLogicismLöwenheim–Skolem theoremMachine codeMany-valued logicMap (mathematics)Material conditionalMathematical linguisticsMathematical logicMathematical notationMathematical objectMathematicsMetalanguageMichael A. HarrisonMinimal axioms for Boolean algebraModel complete theoryModel theoryMonadic predicate calculusMonadic second-order logicMorse–Kelley set theoryNP (complexity)Naive set theoryNatural deductionNatural languageNatural language processingNatural numberNegationNested stack automatonNested wordNew FoundationsNoam ChomskyNon-Euclidean geometryNon-logical symbolNon-recursive grammarNon-standard modelNon-standard model of arithmeticOpen formulaOperation (mathematics)Ordinal analysisOrdinal numberPTIMEP (complexity)P versus NP problemParadoxes of set theoryParserParser generatorParsingPartition of a setPeano axiomsPeter NaurPhilosophy of mathematicsPictographsPost 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 variablePushdown automatonQuantifier (logic)Quantifier rankRange concatenation grammarsRange concatenation languageRecursionRecursive languageRecursive setRecursively enumerable languageRegular expressionRegular expressionsRegular grammarRegular languageRelation (mathematics)Reverse mathematicsRobinson arithmeticRule of inferenceRussell's paradoxSatisfiabilitySaturated modelSchröder–Bernstein theoremSecond-order arithmeticSecond-order logicSelf-verifying theoriesSemantic theory of truthSemanticsSemantics (computer science)Semantics of logicSentence (mathematical logic)Sequent calculusSet (mathematics)Set theorySeymour GinsburgSignature (logic)Singleton (mathematics)Skolem arithmeticSoundnessSpectrum of a sentenceSpectrum of a theorySpringer Science+Business MediaSpringer VerlagSquare of oppositionStar-free languageStrength (mathematical logic)String (computer science)String (formal languages)String homomorphismString operationsStructure (mathematical logic)SubsetSubstitution (logic)Substructure (mathematics)SupertaskSurjective functionSyllogismSymbol (formal)SyntacticSyntaxSyntax (logic)Syntax (programming languages)Syntax analysisT-schemaTarski's axiomatization of the realsTarski's axiomsTarski's theory of truthTarski's undefinability theoremTarski–Grothendieck set theoryTautology (logic)Term (logic)Term logicThe Laws of ThoughtTheoremTheories of truthTheory (mathematical logic)Thread automatonThree-valued logicTimeline of mathematical logicTransfer principleTransformation ruleTransitive setTree-adjoining grammarTree stack automatonTrue arithmeticTruth predicateTruth tableTruth valueTuring machineType (model theory)Type theoryUltrafilter (set theory)UltraproductUncountable setUndecidable problemUnicodeUninterpreted functionUnion (set theory)Uniqueness quantificationUniversal quantificationUniversal setUniverse (mathematics)University of Maryland, BaltimoreUnrestricted grammarUrelementValidity (logic)Variable (mathematics)Venn diagramViennaVirtual machineVon Neumann universeVon Neumann–Bernays–Gödel set theoryWell-formed formulaWolfgang RautenbergYaccZermelo–Fraenkel set theory

143 concepts already in your glossary