KnowraFormal languageLinked fromLinked fromThe 50 pages that link to Formal language, each with the reason it gives.All 50Related 25Narrower topic 24Compared with 1Formal proofNarrower topic: Proofs use a defined vocabulary and syntax rather than unrestricted prose.Gödel numberingNarrower topic: Gödel numbering starts with the symbols and strings of a formal language.EntscheidungsproblemNarrower topic: The decision problem concerns formulas encoded in a rigorously specified logical language.Regular expressionNarrower topic: A regular expression denotes a set of strings, rather than a single string.Axiomatic methodNarrower topic: Axiomatic theories need a language whose well-formed statements can be identified.Context-free grammarNarrower topic: A grammar's central purpose is to define a formal language.Formal semanticsNarrower topic: Semantics assigns meaning to expressions drawn from a formally specified language.Pushdown automatonNarrower topic: Recognition means deciding which strings in this broader class belong to a language.DerivationNarrower topic: Derivations transform strings or expressions drawn from a system's formal language.Deterministic finite automatonNarrower topic: A deterministic finite automaton recognizes a formal language by accepting exactly its strings.Finite automatonNarrower topic: A finite automaton defines a language by the strings it accepts.String (computer science)Narrower topic: A formal language groups strings that satisfy a shared condition.Axiom schemaNarrower topic: A schema's admissible instances depend on the language in which its formulas are formed.Chomsky hierarchyNarrower topic: The hierarchy classifies languages according to the grammars that generate them.Deductive systemNarrower topic: Its syntax supplies the formulas that a deductive system manipulates.Pumping lemma for regular languagesNarrower topic: The theorem concerns membership of strings in such a set.Pumping lemma for context-free languagesNarrower topic: The theorem states a structural property of sets of strings.Symbolic logicNarrower topic: Symbolic logic depends on precisely specified languages for writing formulas.Tarski's undefinability theoremNarrower topic: The theorem concerns truth for sentences in a specified formal language, not truth in every possible language.Formal specificationNarrower topic: A specification uses a formal language to remove ambiguity from requirements.Well-formed formulaNarrower topic: A well-formed formula is a valid string in a particular formal language.Automated reasoningNarrower topic: Automated reasoning requires statements whose syntax and structure software can parse.Ogden's lemmaNarrower topic: Ogden's lemma is a proof tool for classifying formal languages.Axiom (mathematics and logic)Narrower topic: Axioms must be expressible as well-formed statements in a system's language.
KnowraFormal languageLinked fromLinked fromThe 50 pages that link to Formal language, each with the reason it gives.All 50Related 25Narrower topic 24Compared with 1Formal proofNarrower topic: Proofs use a defined vocabulary and syntax rather than unrestricted prose.Gödel numberingNarrower topic: Gödel numbering starts with the symbols and strings of a formal language.EntscheidungsproblemNarrower topic: The decision problem concerns formulas encoded in a rigorously specified logical language.Regular expressionNarrower topic: A regular expression denotes a set of strings, rather than a single string.Axiomatic methodNarrower topic: Axiomatic theories need a language whose well-formed statements can be identified.Context-free grammarNarrower topic: A grammar's central purpose is to define a formal language.Formal semanticsNarrower topic: Semantics assigns meaning to expressions drawn from a formally specified language.Pushdown automatonNarrower topic: Recognition means deciding which strings in this broader class belong to a language.DerivationNarrower topic: Derivations transform strings or expressions drawn from a system's formal language.Deterministic finite automatonNarrower topic: A deterministic finite automaton recognizes a formal language by accepting exactly its strings.Finite automatonNarrower topic: A finite automaton defines a language by the strings it accepts.String (computer science)Narrower topic: A formal language groups strings that satisfy a shared condition.Axiom schemaNarrower topic: A schema's admissible instances depend on the language in which its formulas are formed.Chomsky hierarchyNarrower topic: The hierarchy classifies languages according to the grammars that generate them.Deductive systemNarrower topic: Its syntax supplies the formulas that a deductive system manipulates.Pumping lemma for regular languagesNarrower topic: The theorem concerns membership of strings in such a set.Pumping lemma for context-free languagesNarrower topic: The theorem states a structural property of sets of strings.Symbolic logicNarrower topic: Symbolic logic depends on precisely specified languages for writing formulas.Tarski's undefinability theoremNarrower topic: The theorem concerns truth for sentences in a specified formal language, not truth in every possible language.Formal specificationNarrower topic: A specification uses a formal language to remove ambiguity from requirements.Well-formed formulaNarrower topic: A well-formed formula is a valid string in a particular formal language.Automated reasoningNarrower topic: Automated reasoning requires statements whose syntax and structure software can parse.Ogden's lemmaNarrower topic: Ogden's lemma is a proof tool for classifying formal languages.Axiom (mathematics and logic)Narrower topic: Axioms must be expressible as well-formed statements in a system's language.