Theory of Formal Systems. (AM-47), Volume 47

Counterexample, Modus ponens, Variable (mathematics), Zermelo set theory, Mathematical logic, Mathematical induction, Diagonalization, Primitive recursive function, Decision problem, Inference, Transfinite number, Concatenation theory, Binary relation, Theorem, Quantifier (logic), Mathematics, Natural number, Parity (mathematics), Atomic sentence, Decidability (logic), Gödel's incompleteness theorems, Cartesian product, Disjoint sets, Logical connective, Special case, Peano axioms, Universal set, Metamathematics, Corollary, Negation, Equation, Characterization (mathematics), Exponential function, Axiomatic system, Rule of inference, Axiom, Combination, Axiom schema, Closure (mathematics), Gödel numbering, Formal system, Number theory, Definable set, Predicate (mathematical logic), Recursively enumerable set, Order theory, Arithmetic function, Recursive set, Set (mathematics), Theory, Complement (set theory), Sequence, Axiom A, Cantor's diagonal argument, Direct proof, Existential quantification, Recursion, Enumeration, Arithmetic, Sign (mathematics), Functional calculus, Subset, Turing machine, Scientific notation, System U, Logical consequence, Chinese remainder theorem, Herbrand's theorem, Validity, Prenex normal form