Search and Browse the MSC 2000

03-XX Mathematical logic and foundations → ZMATH

03Dxx Computability and recursion theory → ZMATH

03D03 Thue and Post systems, etc. → ZMATH

03D05 Automata and formal grammars in connection with logical questions [See also 68Q45, 68Q70, 68R15] → ZMATH

03D10 Turing machines and related notions [See also 68Q05] → ZMATH

03D15 Complexity of computation [See also 68Q15, 68Q17] → ZMATH

03D20 Recursive functions and relations, subrecursive hierarchies → ZMATH

03D25 Recursively (computably) enumerable sets and degrees → ZMATH

03D28 Other Turing degree structures → ZMATH

03D30 Other degrees and reducibilities → ZMATH

03D35 Undecidability and degrees of sets of sentences → ZMATH

03D40 Word problems, etc. [See also 06B25, 08A50, 20F10, 68R15] → ZMATH

03D45 Theory of numerations, effectively presented structures [See also 03C57; for intuitionistic and similar approaches see 03F55] → ZMATH

03D50 Recursive equivalence types of sets and structures, isols → ZMATH

03D55 Hierarchies → ZMATH

03D60 Computability and recursion theory on ordinals, admissible sets, etc. → ZMATH

03D65 Higher-type and set recursion theory → ZMATH

03D70 Inductive definability → ZMATH

03D75 Abstract and axiomatic computability and recursion theory → ZMATH

03D80 Applications of computability and recursion theory → ZMATH

03D99 None of the above, but in this section → ZMATH