Computing Classification System 1998

F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES (0 Dokumente)

  • F.4.0 General (0 Dokumente)
  • >
  • F.4.1 Mathematical Logic (F.1.1, I.2.2-4) (0 Dokumente)
  • >
    • F.4.1 Computability theory
    • F.4.1 Computational logic
    • F.4.1 Lambda calculus and related systems
    • F.4.1 Logic and constraint programming (REVISED)
    • F.4.1 Mechanical theorem proving
    • F.4.1 Modal logic (NEW)
    • F.4.1 Model theory
    • F.4.1 Proof theory
    • F.4.1 Recursive function theory
    • F.4.1 Set theory (NEW)
    • F.4.1 Temporal logic (NEW)
  • F.4.2 Grammars and Other Rewriting Systems (D.3.1) (0 Dokumente)
  • >
    • F.4.2 Decision problems
    • F.4.2 Grammar types (e.g., context-free, context-sensitive)
    • F.4.2 Parallel rewriting systems (e.g., developmental systems, L-systems)
    • F.4.2 Parsing
    • F.4.2 Thue systems
  • F.4.3 Formal Languages (D.3.1) (0 Dokumente)
  • >
    • F.4.3 Algebraic language theory
    • F.4.3 Classes defined by grammars or automata (e.g., context-free languages, regular sets, recursive sets)
    • F.4.3 Classes defined by resource-bounded automata**
    • F.4.3 Decision problems
    • F.4.3 Operations on languages
  • F.4.m Miscellaneous (0 Dokumente)
  • >