Text version can be found here.

- 03B16 : Higher-order logic
- 03B20 : Subsystems of classical logic (including intuitionistic logic)
- 03B35 : Mechanization of proofs and logical operations
- 03B38 : Type theory
- 03B40 : Combinatory logic and lambda calculus
- 03B44 : Temporal logic
- 03B45 : Modal logic (including the logic of norms)
- 03B47 : Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics)
- 03B50 : Many-valued logic
- 03B70 : Logic in computer science
- 03D05 : Automata and formal grammars in connection with logical questions
- 03F05 : Cut-elimination and normal-form theorems
- 03F07 : Structure of proofs
- 03F52 : Proof-theoretic aspects of linear logic and other substructural logics
- 03F55 : Intuitionistic mathematics
- 18A05 : Definitions and generalizations in theory of categories
- 18A10 : Graphs, diagram schemes, precategories
- 18A15 : Foundations, relations to logic and deductive systems
- 18A20 : Epimorphisms, monomorphisms, special classes of morphisms, null morphisms
- 18A22 : Special properties of functors (faithful, full, etc.)
- 18A23 : Natural morphisms, dinatural morphisms
- 18A25 : Functor categories, comma categories
- 18A30 : Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.)
- 18A32 : Factorization systems, substructures, quotient structures, congruences, amalgams
- 18A35 : Categories admitting limits (complete categories), functors preserving limits, completions
- 18A40 : Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.)
- 18A50 : Graded categories (general)
- 18G05 : Projectives and injectives (category-theoretic aspects)
- 18G10 : Resolutions; derived functors (category-theoretic aspects)
- 68N15 : Theory of programming languages
- 68N18 : Functional programming and lambda calculus
- 68N30 : Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
- 68Q04 : Classical models of computation (Turing machines, etc.)
- 68Q42 : Grammars and rewriting systems
- 68Q45 : Formal languages and automata
- 68Q55 : Semantics in the theory of computing
- 68Q60 : Specification and verification (program logics, model checking, etc.)
- 68Q65 : Abstract data types; algebraic specification
- 68Q70 : Algebraic theory of languages and automata