The following pages link to Decision problem
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Power set (links | edit)
- Principia Mathematica (links | edit)
- Primitive recursive function (links | edit)
- Recursion (links | edit)
- Proof by contradiction (links | edit)
- Regular language (links | edit)
- Set (mathematics) (links | edit)
- Soundness (links | edit)
- Set theory (links | edit)
- Subset (links | edit)
- Surjective function (links | edit)
- ♯P (links | edit)
- Static program analysis (links | edit)
- Square-free integer (links | edit)
- Turing machine (links | edit)
- Transfinite induction (links | edit)
- Theorem (links | edit)
- Travelling salesman problem (links | edit)
- Uncountable set (links | edit)
- Unary numeral system (links | edit)
- Word problem for groups (links | edit)
- Subset sum problem (links | edit)
- PSPACE (links | edit)
- Genetic algorithm (links | edit)
- Type theory (links | edit)
- Minimum spanning tree (links | edit)
- Arity (links | edit)
- Injective function (links | edit)
- Russell's paradox (links | edit)
- Philosophy of mathematics (links | edit)
- Union (set theory) (links | edit)
- Saul Kripke (links | edit)
- Syllogism (links | edit)
- Domain of a function (links | edit)
- Codomain (links | edit)
- Natural deduction (links | edit)
- Cantor's diagonal argument (links | edit)
- Zorn's lemma (links | edit)
- Complement (set theory) (links | edit)
- Co-NP-complete (links | edit)
- NP-hardness (links | edit)
- P-complete (links | edit)
- PSPACE-complete (links | edit)
- NP-easy (links | edit)
- NP-equivalent (links | edit)
- EXPTIME (links | edit)
- EXPSPACE (links | edit)
- Decidability (links | edit)
- Classical logic (links | edit)
- Gödel's incompleteness theorems (links | edit)