Tags
- A
- Absoluteness
- Alonzo Church
- Arithmetical hierarchy
- Arity
- Axiom of Choice
- Axiom schema
- Bounded quantifier
- Cambridge
- Cambridge University Press
- Charles Sanders Peirce
- Church–Turing thesis
- Closure operator
- Completeness
- Consistency
- Countable model
- Decidability
- Digital object identifier
- Effective method
- Entscheidungsproblem
- Enumeration
- First-order
- First-order logic
- First-order theories
- Foundations of mathematics
- Free variables and bound variables
- Gödel's completeness theorem
- Gödel's incompleteness theorems
- Google Books
- Historical revisionism
- Hypercomputation
- Independence
- International Standard Book Number
- International Standard Serial Number
- Interpretation
- JSTOR
- Logical disjunction
- Mathematical logic
- MathWorld
- Model theory
- Need U
- Number
- Oxford University Press
- Partial function
- Peano axioms
- Power set
- Propositional calculus
- Propositional variable
- Real closed field
- Recursively enumerable set
- Rule of inference
- Satisfiability
- Second-order logic
- Set theory
- Signature
- Soundness
- Soundness and completeness
- Steve Simpson
- Storrs, Connecticut
- Structure
- Theorem
- Theory
- Toronto
- Undecidable problem
- Use–mention distinction
- Zentralblatt MATH