Question 1
This image question appears in the interactive quiz.
Answer options
Key Idea
A subset is a set whose members all fit inside another set.
Logic, proof, and limits of formal reasoning.
Answer five questions about Logic and Foundations and get instant feedback.
This image question appears in the interactive quiz.
A subset is a set whose members all fit inside another set.
What axiom says you can pick one item from each set, even if there are infinitely many sets?
It is equivalent to surprising results like the well-ordering theorem, and it can even imply counterintuitive things like the Banach-Tarski paradox, where a ball can be split and reassembled into two.
A step-by-step build-up of a conclusion from earlier steps
In proof theory, a derivation is often pictured as a tree: the leaves are assumptions or axioms, and the root is the final conclusion you have justified.
If a set has $n$ elements, then the power set has $2^n$ elements.
Every element either appears or does not appear in a subset, so $n$ independent yes-no choices give $2^n$ subsets, for example 3 elements yield 8.
What theorem shows that any strong enough consistent system misses some arithmetic truths?
Gödel builds a self-referential arithmetic sentence $G$ that effectively says "I am not provable here", so if the system is consistent then $G$ is true but unprovable.
Learn and play with MAGMA Mentor to build your understanding step by step.