Pages that link to "Mathematician:Raymond Merrill Smullyan"
Jump to navigation
Jump to search
The following pages link to Mathematician:Raymond Merrill Smullyan:
Displayed 14 items.
- Smullyan's Drinking Principle (← links)
- Equivocation/Examples/Smullyan's Equivocation (← links)
- Smullyan's Drinking Principle/Formal Exposition (← links)
- Smullyan's Drinking Principle/Formal Proof (← links)
- Smullyan's Drinking Principle/Informal Proof (← links)
- Smullyan's Drinking Principle/Semi-Formal Proof (← links)
- Smullyan's Drinking Principle/Paradoxical Aspects (← links)
- ProofWiki:Jokes (← links)
- Category:Named Theorems/Smullyan (transclusion) (← links)
- Mathematician:Mathematicians/Sorted By Nation/United States (transclusion) (← links)
- Mathematician:Hilary Whitehall Putnam (← links)
- Mathematician:Raymond M. Smullyan (redirect page) (← links)
- Russell's Paradox (← links)
- Equality of Ordered Pairs (← links)
- Cartesian Product of Unions (← links)
- Inverse of Mapping is One-to-Many Relation (← links)
- Inverse of Bijection is Bijection (← links)
- Inverse Element of Bijection (← links)
- Inverse of Inverse of Bijection (← links)
- Cantor's Theorem (← links)
- Cantor-Bernstein-Schröder Theorem (← links)
- Natural Numbers are Infinite (← links)
- Cardinality of Cartesian Product of Finite Sets (← links)
- Rational Numbers are Countably Infinite (← links)
- Integers are Countably Infinite (← links)
- Cantor's Diagonal Argument (← links)
- Continuum Hypothesis (← links)
- Union of Singleton (← links)
- Intersection of Singleton (← links)
- Zermelo's Well-Ordering Theorem (← links)
- Subset of Finite Set is Finite (← links)
- Power Set of Subset (← links)
- Infinite Set has Countably Infinite Subset/Proof 3 (← links)
- Infinite Set is Equivalent to Proper Subset/Proof 1 (← links)
- Set of Finite Subsets of Countable Set is Countable (← links)
- Cantor's Theorem (Strong Version) (← links)
- Cartesian Product of Natural Numbers with Itself is Countable (← links)
- Maximal Element need not be Greatest Element (← links)
- Successor Set of Transitive Set is Transitive (← links)
- Transfinite Recursion Theorem (← links)
- Limit Ordinal Equals its Union (← links)
- Class is Transitive iff Union is Subclass (← links)
- Ordinal Addition/Examples/Ordinal Addition by One (← links)
- Union of Doubleton (← links)
- Union of Finite Sets is Finite (← links)
- Non-Greatest Element of Well-Ordered Class has Immediate Successor (← links)
- Barber Paradox (← links)
- Knaster-Tarski Lemma (← links)
- Knaster-Tarski Lemma/Power Set (← links)
- Cantor-Bernstein-Schröder Theorem/Proof 6 (← links)
- Knaster-Tarski Lemma/Corollary/Power Set/Proof 2 (← links)
- Knaster-Tarski Lemma/Corollary/Power Set (← links)
- Knaster-Tarski Lemma/Corollary/Power Set/Proof 1 (← links)
- Intersection of Ordinals is Ordinal (← links)
- Immediate Successor is Unique in Toset (← links)
- Cantor's Theorem/Proof 1 (← links)
- Finite Union of Finite Sets is Finite (← links)
- Codomain of Bijection is Domain of Inverse (← links)
- Domain of Bijection is Codomain of Inverse (← links)
- Rational Numbers are Countably Infinite/Proof 1 (← links)
- Immediate Successor under Total Ordering is Unique (← links)
- Immediate Predecessor under Total Ordering is Unique (← links)
- Principle of Recursive Definition (← links)
- Principle of Recursive Definition/General Result (← links)
- Principle of Recursive Definition/Fallacious Proof (← links)
- Principle of Finite Induction (← links)
- Second Principle of Mathematical Induction (← links)
- Subset Relation is Antisymmetric (← links)
- Hartogs' Lemma (Set Theory)/Proof 2 (← links)
- Barber Paradox/Historical Note (← links)
- Cantor's Diagonal Argument/Historical Note (← links)
- Intersection of Doubleton (← links)
- Even Natural Numbers are Infinite (← links)
- Set of Points on Line Segment is Infinite (← links)
- Set of Doubletons of Natural Numbers is Countable (← links)
- Subset/Examples/Even Numbers form Subset of Integers (← links)
- Finite Sets are Comparable (← links)
- Strictly Positive Integers have same Cardinality as Natural Numbers (← links)
- Power Set of Natural Numbers has Cardinality of Continuum (← links)
- Generalized Continuum Hypothesis (← links)
- Generalized Continuum Hypothesis/Historical Note (← links)
- Continuum Hypothesis/Historical Note (← links)
- Continuum Hypothesis is Independent of ZFC (← links)
- Continuum Hypothesis is Independent of ZFC/Historical Note (← links)
- Axiom of Choice is Independent of ZF (← links)
- Axiom of Choice is Independent of ZF/Historical Note (← links)
- Empty Set can be Derived from Axiom of Abstraction (← links)
- Doubleton of Sets can be Derived using Axiom of Abstraction (← links)
- Power Set can be Derived using Axiom of Abstraction (← links)
- Set Union can be Derived using Axiom of Abstraction (← links)
- Set of Natural Numbers can be Derived using Axiom of Abstraction (← links)
- Frege Set Theory is Logically Inconsistent (← links)
- Russell's Paradox/Corollary (← links)
- Exists Subset which is not Element/Proof 1 (← links)
- Exists Subset which is not Element/Proof 2 (← links)
- Class is Subclass of Universal Class (← links)
- Not Every Class is a Set/Proof 1 (← links)
- Not Every Class is a Set/Proof 2 (← links)
- Class has Subclass which is not Element (← links)
- Basic Universe is Supercomplete (← links)
- Basic Universe is not Set (← links)
- Empty Class Exists and is Unique (← links)
- Empty Class is Subclass of All Classes (← links)
- Empty Class is Supercomplete (← links)
- Basic Universe is not Empty (← links)
- Existence of Set is Equivalent to Existence of Empty Set (← links)
- Singleton Class can be Formed from Set (← links)
- Singleton Class/Examples/Empty Set (← links)
- Singleton Class of Empty Set is Supercomplete (← links)
- Singleton Classes are Equal iff Sets are Equal (← links)
- Doubleton Class can be Formed from Two Sets (← links)
- Doubleton Class of Equal Sets is Singleton Class (← links)
- Singleton Class of Set is Set (← links)
- Basic Universe has Infinite Number of Elements (← links)
- Equivalence of Formulations of Axiom of Pairing for Classes (← links)
- Equality of Ordered Pairs/Lemma (← links)
- Equality of Ordered Pairs/Necessary Condition (← links)
- Equality of Ordered Pairs/Necessary Condition/Proof from Kuratowski Formalization (← links)
- Equality of Ordered Pairs/Necessary Condition/Proof from Empty Set Formalization (← links)
- Equality of Ordered Pairs/Necessary Condition/Proof from Wiener Formalization (← links)
- Intersection of Class Exists and is Unique (← links)
- Intersection of Empty Set/Class Theory (← links)
- Union of Subclass is Subclass of Union of Class (← links)
- Intersection of Class is Subset of Intersection of Subclass (← links)
- Union of Transitive Class is Subclass (← links)
- Union of Class is Subclass implies Class is Transitive (← links)
- Union of Transitive Class is Transitive (← links)
- Union of Class is Transitive if Every Element is Transitive (← links)
- Class Difference of B with Class Difference of A with B/Mistake (← links)
- Power Set Exists and is Unique (← links)
- Set is Subset of Power Set of Union (← links)
- Set equals Union of Power Set (← links)
- Cartesian Product Exists and is Unique (← links)
- Cardinality of Cartesian Product of Finite Sets/Examples/Sets with 3 and 5 Elements (← links)
- Cartesian Product of Sets is Set (← links)
- Existence and Uniqueness of Domain of Relation (← links)
- Existence and Uniqueness of Image of Relation (← links)
- Domain of Relation is Subclass of Union of Union of Relation (← links)
- Image of Relation is Subclass of Union of Union of Relation (← links)
- Relation is Set implies Domain and Image are Sets (← links)
- Domain of Relation is Subclass of Union of Union of Relation/Proof (← links)
- Empty Class is Transitive (← links)
- Singleton of Empty Class is Transitive (← links)
- Transitive Class/Examples/Class with Empty Class and its Singleton (← links)
- Transitive Class/Examples/Ordinal 3 (← links)
- Transitive Class/Examples/Ordinal 3 without 1 is not Transitive (← links)
- Union of Transitive Class is Transitive/Proof 1 (← links)
- Set is Transitive iff Subset of Power Set (← links)
- Power Set of Transitive Set is Transitive (← links)
- Transitive Class/Examples/Singleton of Singleton of Empty Class is not Transitive (← links)
- Universal Class less Set is not Transitive (← links)
- Cardinality/Examples/3 (← links)
- Cardinality/Examples/3/Historical Note (← links)
- Basic Universe is Inductive (← links)
- Equivalence of Formulations of Axiom of Infinity for Zermelo Universe (← links)
- Inductive Construction of Natural Numbers fulfils Peano's Axioms (← links)
- Natural Number is Transitive Set (← links)
- Natural Number is Ordinary Set (← links)
- Natural Numbers cannot be Elements of Each Other (← links)
- Inductive Construction of Natural Numbers fulfils Peano's Axiom of Injectivity (← links)
- Element of Natural Number is Natural Number (← links)
- Natural Number is not Subset of its Union (← links)
- Natural Number is Superset of its Union (← links)
- Natural Number is Union of its Successor (← links)
- Set of Natural Numbers Equals its Union (← links)
- Set of Natural Numbers Equals Union of its Successor (← links)
- Principle of General Induction (← links)
- Von Neumann Construction of Natural Numbers is Minimally Inductive (← links)
- Double Induction Principle/Lemma (← links)
- Successor Mapping on Natural Numbers is Progressing (← links)
- Progressing Function Lemma (← links)
- Progressing Function Lemma/Linguistic Note (← links)
- Sandwich Principle (← links)
- Sandwich Principle/Corollary 1 (← links)
- Sandwich Principle/Corollary 2 (← links)
- Class under Progressing Mapping such that Elements are Sandwiched is Nest (← links)
- Sandwich Principle/Linguistic Note (← links)
- Sandwich Principle/Proof 1 (← links)
- Characteristics of Minimally Inductive Class under Progressing Mapping (← links)
- Characteristics of Minimally Inductive Class under Progressing Mapping/Image of Proper Subset is Subset (← links)
- Characteristics of Minimally Inductive Class under Progressing Mapping/Mapping Preserves Subsets (← links)
- Bounded Class is Set (← links)
- Closed Class under Progressing Mapping Lemma (← links)
- Minimally Closed Class under Progressing Mapping induces Nest (← links)
- Minimally Closed Class under Progressing Mapping (← links)
- Bounded Subset of Minimally Closed Class under Progressing Mapping has Greatest Element (← links)
- Fixed Point of Progressing Mapping on Minimally Closed Class is Greatest Element (← links)
- Minimally Closed Class under Progressing Mapping is Well-Ordered (← links)
- Smallest Element of Minimally Closed Class under Progressing Mapping (← links)
- Minimally Closed Class under Progressing Mapping induces Nest/Proof (← links)
- Bounded Subset of Minimally Closed Class under Progressing Mapping has Greatest Element/Proof (← links)
- Fixed Point of Progressing Mapping on Minimally Closed Class is Greatest Element/Proof (← links)
- Minimally Closed Class under Progressing Mapping is Well-Ordered/Proof (← links)
- Smallest Element of Minimally Closed Class under Progressing Mapping/Proof (← links)
- Double Induction Principle/Proof 1 (← links)
- Characteristics of Minimally Inductive Class under Progressing Mapping/Sandwich Principle/Proof 1 (← links)
- Minimally Inductive Class under Progressing Mapping induces Nest/Proof 1 (← links)
- Minimally Inductive Class under Progressing Mapping induces Nest/Proof 2 (← links)
- Non-Empty Bounded Subset of Minimally Inductive Class under Progressing Mapping has Greatest Element/Proof 1 (← links)
- Non-Empty Bounded Subset of Minimally Inductive Class under Progressing Mapping has Greatest Element/Proof 2 (← links)
- Fixed Point of Progressing Mapping on Minimally Inductive Class is Greatest Element/Proof 1 (← links)
- Fixed Point of Progressing Mapping on Minimally Inductive Class is Greatest Element/Proof 2 (← links)
- Minimally Inductive Class under Progressing Mapping is Well-Ordered under Subset Relation/Proof 1 (← links)
- Minimally Inductive Class under Progressing Mapping is Well-Ordered under Subset Relation/Proof 2 (← links)
- Inductive Set under Mapping has Minimally Inductive Subset (← links)
- Natural Numbers are Comparable/Strong Result (← links)
- No Natural Number between Number and Successor/Proof using Von Neumann Construction (← links)
- Natural Number m is Less than n implies n is not Greater than Successor of n/Proof using Von Neumann Construction (← links)
- Natural Number Ordering is Preserved by Successor Mapping (← links)
- Non-Empty Bounded Subset of Natural Numbers has Greatest Element (← links)
- Well-Ordering Principle/Proof using Von Neumann Construction (← links)
- Natural Number m is Less than n iff m is an Element of n (← links)
- Trichotomy Law for Natural Numbers (← links)
- Natural Number Less than or Equal to Successor of Another (← links)
- Mapping whose Image of Natural Number n is Subset of Image of Successor (← links)
- Mapping whose Image of Natural Number n is Subset of Image of Successor/Corollary (← links)
- Equivalence of Definitions of Cardinality of Finite Class (← links)
- Finite Class is Set (← links)
- Non-Empty Finite Set of Natural Numbers has Greatest Element (← links)
- Set of Subsets of Element of Minimally Inductive Class under Progressing Mapping is Finite (← links)
- Minimally Inductive Class under Progressing Mapping with Fixed Element is Finite (← links)
- Subset of Natural Numbers is either Finite or Denumerable (← links)
- Non-Empty Set of Natural Numbers with no Greatest Element is Denumerable (← links)
- Equivalence of Formulations of Axiom of Choice/Formulation 1 implies Formulation 3 (← links)
- Equivalence of Formulations of Axiom of Choice/Formulation 3 implies Formulation 1 (← links)
- Cartesian Product is Unique (← links)
- Russell's Paradox/Proof 1 (← links)
- Intersection of Non-Empty Class is Set/Proof 1 (← links)
- Binary Relation is Subclass of Product of Domain with Range (← links)
- Union of Class is Transitive if Every Element is Transitive/Proof (← links)
- Equivalent Statements for Transitive Set (← links)
- Principle of Recursive Definition/Also presented as (← links)
- Principle of Recursive Definition/Strong Version (← links)
- Principle of Recursive Definition/Proof 4 (← links)
- Addition in Minimally Inductive Set is Unique (← links)
- Natural Number Multiplication is Unique (← links)
- Increasing Sequence of Sets forms Nest (← links)
- Sequence of Recursively Defined Terms forms Minimally Inductive Set (← links)
- Double Induction Principle/General (← links)
- Relation on Slowly Progressing Mapping which fulfils conditions of General Double Induction Principle (← links)
- Minimally Inductive Class under Slowly Progressing Mapping is Nest (← links)
- Sandwich Principle for Slowly Progressing Mapping (← links)
- Sandwich Principle for Slowly Progressing Mapping/Corollary (← links)
- Natural Numbers are Comparable/Strong Result/Proof 2 (← links)
- Minimally Inductive Class under Slowly Progressing Mapping is Nest/Proof 2 (← links)
- Successor Mapping is Slowly Progressing (← links)
- General Double Induction Principle/Proof (← links)
- Relation on Slowly Progressing Mapping which fulfils conditions of General Double Induction Principle/Proof (← links)
- Sandwich Principle for Slowly Progressing Mapping/Proof (← links)
- Sandwich Principle for Slowly Progressing Mapping/Corollary/Proof (← links)
- Subset Relation is Reflexive (← links)
- Equivalence of Formulations of Axiom of Unions (← links)
- Equivalence of Formulations of Axiom of Unions/Proof (← links)
- Intersection of Non-Empty Class is Set/Corollary (← links)
- Class Union Distributes over Class Intersection (← links)
- Class Intersection Distributes over Class Union (← links)
- Class Difference with Class Difference (← links)
- Class Difference of B with Class Difference of A with B (← links)
- Intersection with Subclass is Subclass (← links)
- Union with Superclass is Superclass (← links)
- Class Difference with Class Difference with Subclass (← links)
- Equivalence of Formulations of Axiom of Powers (← links)
- Subset is Element of Power Set (← links)
- Class Union Exists and is Unique (← links)
- Successor Mapping is Progressing (← links)
- Diagonal Relation is Reflexive (Class Theory) (← links)
- Subset Relation is Ordering/Class Theory (← links)
- Smallest Element is Unique/Class Theory (← links)
- Subset Relation is Transitive/Proof 1 (← links)
- Subclass of Well-Ordered Class is Well-Ordered (← links)
- Class which has Injection to Subclass of Well-Orderable Class is Well-Orderable (← links)
- Class which has Injection to Subclass of Well-Orderable Class is Well-Orderable/Mistake (← links)
- Countable Set is Well-Orderable (← links)
- Rational Numbers are Well-Orderable (← links)
- Rational Numbers are Well-Orderable/Proof 1 (← links)
- Rational Numbers are Well-Orderable/Proof 2 (← links)
- Well-Ordering is not necessarily Usual Ordering (← links)
- Categories of Elements under Well-Ordering (← links)
- Characterisation of Limit Element under Well-Ordering (← links)
- Strict Lower Closure of Limit Element is Infinite (← links)
- First Principle of Transfinite Induction (← links)
- Second Principle of Transfinite Induction (← links)
- Axiom of Choice/Examples/Russell's Socks and Shoes (← links)
- Axiom of Choice/Examples/Russell's Socks and Shoes/Historical Note (← links)
- Ordering where every Subclass has Smallest Element is Well-Ordering (← links)
- Condition on Proper Lower Sections for Total Ordering to be Well-Ordering/Mistake (← links)
- Condition for Total Ordering to be Well-Ordering (← links)
- Backward Path of Well-Ordering is Finite (← links)
- Equivalence of Formulations of Axiom of Choice/Formulation 1 iff Formulation 4 (← links)
- Principle of Superinduction (← links)
- Double Superinduction Principle (← links)
- Double Superinduction Principle/Lemma (← links)
- G-Tower is Nest/Lemma 1 (← links)
- G-Tower is Nest (← links)
- G-Tower is Nest/Lemma 2 (← links)
- Sandwich Principle for G-Towers (← links)
- Sandwich Principle for G-Towers/Corollary 1 (← links)
- Sandwich Principle for G-Towers/Corollary 2 (← links)
- Fixed Point of g-Tower is Greatest Element (← links)
- Union of g-Tower is Greatest Element and Unique Fixed Point (← links)
- Intersection of Set whose Every Element is Closed under Mapping is also Closed under Mapping (← links)
- Intersection of Set whose Every Element is Closed under Chain Unions is also Closed under Chain Unions (← links)
- Set which is Superinductive under Progressing Mapping has Fixed Point (← links)
- Superinductive Class under Strictly Progressing Mapping is Proper Class (← links)
- Set which is Superinductive under Progressing Mapping has Fixed Point/Corollary (← links)
- Intersection of Set whose Every Element is Closed under Mapping is also Closed under Mapping/Proof (← links)
- Intersection of Set whose Every Element is Closed under Chain Unions is also Closed under Chain Unions/Proof (← links)
- G-Tower is Well-Ordered under Subset Relation (← links)
- Strict Lower Closure of G-Tower is Set of Elements which are Proper Subsets (← links)
- G-Tower is Well-Ordered under Subset Relation/Corollary (← links)
- G-Tower is Well-Ordered under Subset Relation/Empty Set (← links)
- G-Tower is Well-Ordered under Subset Relation/Successor of Non-Greatest Element (← links)
- G-Tower is Well-Ordered under Subset Relation/Union of Limit Elements (← links)
- Slow g-Tower is Slowly Well-Ordered under Subset Relation (← links)
- Union of Slowly Well-Ordered Class under Subset Relation is Well-Orderable (← links)
- Union of Slow g-Tower is Well-Orderable (← links)
- Set with Slowly Progressing Mapping on Power Set with Self as Fixed Point is Well-Orderable (← links)
- Set with Choice Function is Well-Orderable (← links)
- Zermelo's Well-Ordering Theorem/Proof 1 (← links)
- Zermelo's Well-Ordering Theorem/Converse/Proof 1 (← links)
- Well-Orderable Set has Choice Function (← links)
- Countable Set has Choice Function (← links)
- Union of Slowly Well-Ordered Class under Subset Relation is Well-Orderable/Corollary 1 (← links)
- Union of Slowly Well-Ordered Class under Subset Relation is Well-Orderable/Corollary 2 (← links)
- Union of Slowly Well-Ordered Class under Subset Relation is Well-Orderable/Corollary 3 (← links)
- Union of Slowly Well-Ordered Class under Subset Relation is Well-Orderable/Corollary 4 (← links)
- Choice Function for Power Set implies Choice Function for Set (← links)
- Choice Function for Set does not imply Choice Function for Union of Set (← links)
- Maximal Principles/Also known as (← links)
- Maximal Principles (← links)
- Maximal Principles/Historical Note (← links)
- Maximal Principles are Equivalent to Axiom of Choice (← links)
- Maximal Element of Nest is Greatest Element (← links)
- Non-Empty Set of Type M has Maximal Element (← links)
- Axiom of Choice implies Kuratowski's Lemma (← links)
- Kuratowski's Lemma/Formulation 2 (← links)
- Closed Set under Chain Unions with Choice Function is of Type M (← links)
- Maximal Element under Subset Relation need not be Greatest Element (← links)
- Nesthood has Finite Character (← links)
- Set whose every Finite Subset is Nest is also Nest (← links)
- Consistency of Logical Formulas has Finite Character (← links)
- Set of Logical Formulas is Inconsistent iff it has Finite Inconsistent Subset (← links)
- Consistency of Logical Formulas has Finite Character/Proof 2 (← links)
- Consistent Set of Formulas can be Extended to Maximal Consistent Set (← links)
- Tukey's Lemma/Formulation 2 (← links)
- Class of Finite Character is Swelled (← links)
- Class of Finite Character is Closed under Chain Unions (← links)
- Kuratowski's Lemma implies Tukey's Lemma (← links)
- Axiom of Choice implies Tukey's Lemma (← links)
- Set of Finite Character with Choice Function is of Type M (← links)
- Set of Subsets of Finite Character of Countable Set is of Type M (← links)
- Zorn's Lemma/Formulation 2 (← links)
- Tukey's Lemma implies Zorn's Lemma (← links)
- Property of being Totally Ordered is of Finite Character (← links)
- Axiom of Choice implies Zorn's Lemma/Proof 3 (← links)
- Hausdorff's Maximal Principle/Formulation 2 (← links)
- Axiom of Choice implies Kuratowski's Lemma/Proof 2 (← links)
- Zorn's Lemma implies Hausdorff's Maximal Principle (← links)
- Maximal Principles are Equivalent (← links)
- Axiom of Choice implies Maximal Principles (← links)
- Hausdorff's Maximal Principle implies Kuratowski's Lemma/Proof 1 (← links)
- Hausdorff's Maximal Principle implies Axiom of Choice (← links)
- Hausdorff's Maximal Principle implies Axiom of Choice/Lemma (← links)
- Hausdorff's Maximal Principle implies Kuratowski's Lemma/Proof 2 (← links)
- Hausdorff's Maximal Principle implies Axiom of Choice/Proof (← links)
- Principle E (← links)
- Principle E/Linguistic Note (← links)
- Principle E is Equivalent to Kuratowski's Lemma (← links)
- Closure under Chain Unions with Choice Function implies Elements with no Immediate Extension (← links)
- Swelled Set which is Closed under Chain Unions with Choice Function is Type M (← links)
- Element of Swelled Set with no Immediate Extension is Maximal (← links)
- Swelled Set which is Closed under Chain Unions with Choice Function is Type M/Historical Note (← links)
- Set of Finite Character with Choice Function is Type M (← links)
- Set of Finite Character with Countable Union is Type M/Proof 1 (← links)
- Consistent Set of Logical Formulas is Subset of Maximally Consistent Set (← links)
- Set of Finite Character with Countable Union is Type M/Proof 2 (← links)
- Set of Finite Character with Countable Union is Type M/Proof 2/Historical Note (← links)
- Union of Chain in Set of Finite Character with Countable Union is Maximal Element (← links)
- Union of Chain in Set of Finite Character with Countable Union is Maximal Element/Proof (← links)
- Cowen's Theorem (← links)
- Cowen's Theorem/Lemma 1 (← links)
- Cowen's Theorem/Lemma 2 (← links)
- Cowen's Theorem/Lemma 3 (← links)
- Cowen's Theorem/Lemma 4 (← links)
- Cowen's Theorem/Lemma 5 (← links)
- Cowen's Theorem/Lemma 6 (← links)
- Cowen's Theorem/Lemma 7 (← links)
- Cowen's Theorem/Lemma 8 (← links)
- Cowen's Theorem/Proof (← links)
- Cowen's Theorem/Also presented as (← links)
- G-Tower is G-Ordered (← links)
- Set is G-Set iff Element of G-Ordered Set (← links)
- Class of All Ordinals is Minimally Superinductive over Successor Mapping (← links)
- Properties of Class of All Ordinals (← links)
- Properties of Class of All Ordinals/Zero is Ordinal (← links)
- Properties of Class of All Ordinals/Union of Chain of Ordinals is Ordinal (← links)
- Properties of Class of All Ordinals/Superinduction Principle (← links)
- Class of All Ordinals is Well-Ordered by Subset Relation/Proof 2 (← links)
- Successor Set of Ordinal is Ordinal/Proof 1 (← links)
- Union of Set of Ordinals is Ordinal/Proof 1 (← links)
- Natural Number is Ordinal (← links)
- Natural Number is Ordinal/Proof 1 (← links)
- Natural Number is Ordinal/Proof 2 (← links)
- Element of Ordinal is Ordinal/Proof 1 (← links)
- Ordinal is Transitive/Proof 4 (← links)
- Successor Set of Ordinary Transitive Set is Ordinary (← links)
- Ordinal is not Element of Itself/Proof 3 (← links)
- Ordinal is Proper Subset of Successor (← links)
- Successor Mapping on Ordinals is Strictly Progressing (← links)
- Class of All Ordinals is Proper Class/Proof 1 (← links)
- Well-Ordering of Class of All Ordinals under Subset Relation (← links)
- Strict Ordering of Ordinals is Equivalent to Membership Relation (← links)
- Ordinal Membership is Trichotomy/Proof 1 (← links)
- Ordinal Membership is Trichotomy/Corollary (← links)
- Ordinal Membership is Transitive (← links)
- Equality of Successors implies Equality of Ordinals (← links)
- Exists Ordinal Greater than Set of Ordinals (← links)
- Successor of Ordinal Smaller than Limit Ordinal is also Smaller/Proof 1 (← links)
- Union of Ordinal is Subset of Itself (← links)
- Ordinal equals Successor of its Union (← links)
- Transitive Class of Ordinals is Subset of Ordinal not in it (← links)
- Transitive Set of Ordinals is Ordinal (← links)
- Class of All Ordinals is Only Proper Class of Ordinals (← links)
- Ordinal equals its Initial Segment/Proof 4 (← links)
- Set is Ordinal iff Every Transitive Proper Subset is Element of it (← links)
- Class such that Every Transitive Subset is Element of it Contains All Ordinals (← links)
- Element of Every Transitive-Closed Class is Ordinal (← links)
- Equivalence of Definitions of Ordinal/Definition 3 is equivalent to Definition 4 (← links)
- Ordinal Addition/Examples/Ordinal Addition by Two (← links)
- Ordinal Addition/Examples/Ordinal Addition by Natural Number (← links)
- Set of Natural Numbers is Ordinal (← links)
- Set of Natural Numbers is Smallest Ordinal Greater than All Natural Numbers (← links)
- Set of Natural Numbers is Limit Ordinal (← links)
- Image of Class under Mapping is Image of Restriction of Mapping to Class (← links)
- Image of Set under Mapping is Set iff Restriction is Set (← links)
- Restriction of Mapping is Subclass of Cartesian Product (← links)
- Composite of Mapping with Inverse of Another is Identity implies Mappings are Equal (← links)
- Strict Lower Closure of Element is Proper Lower Section (← links)
- Proper Lower Section under Well-Ordering is Initial Segment (← links)
- Well-Ordering on Set is Proper Well-Ordering (← links)
- G-Tower is Properly Well-Ordered under Subset Relation (← links)
- Union of Nest of Mappings is Mapping (← links)
- Domain of Union of Nest of Mappings is Union of Class of Domains (← links)
- Image of Union of Nest of Mappings is Union of Class of Images (← links)
- Union of Nest of Injections is Injection (← links)
- Union of Nest of Mappings is Mapping/Proof (← links)
- Domain of Union of Nest of Mappings is Union of Class of Domains/Proof (← links)
- Image of Union of Nest of Mappings is Union of Class of Images/Proof (← links)
- Union of Nest of Injections is Injection/Proof (← links)
- Well-Ordering on Class is not necessarily Proper (← links)
- Order Automorphism on Well-Ordered Class is Forward Moving (← links)
- Order Automorphism on Well-Ordered Class is Forward Moving/Linguistic Note (← links)
- Order Automorphism on Well-Ordered Class is Identity Mapping (← links)
- Well-Ordered Classes are Isomorphic at Most Uniquely (← links)
- Well-Ordered Class is not Isomorphic to Initial Segment (← links)
- Distinct Ordinals are not Order Isomorphic (← links)
- Distinct Lower Sections of Well-Ordered Class are not Order Isomorphic (← links)
- Lower Sections of Well-Ordered Classes are Order Isomorphic at most Uniquely (← links)
- Isomorphisms between Lower Sections of Well-Ordered Classes are Nested (← links)
- Fundamental Theorem of Well-Ordering (← links)
- Axiom of Swelledness is implied by Axiom of Replacement (← links)
- Equivalence of Formulations of Axiom of Replacement (← links)
- Axiom of Replacement implies Image of Bijection on Set is Set (← links)
- Image of Bijection on Set is Set with Axiom of Choice implies Axiom of Replacement (← links)
- Counting Theorem/Proof 2 (← links)
- Counting Theorem/Corollary (← links)
- Counting Theorem/Motivation (← links)
- Extending Operation is a Slowly Progressing Mapping (← links)
- Extending Operation is a Strictly Progressing Mapping (← links)
- Union of Chain of Ordinal Sequences is Ordinal Sequence (← links)
- Length of Union of Chain of Ordinal Sequences (← links)
- Union of Nest of Ordinal Sequences which is Proper Class (← links)
- Characteristic of Extending Operation (← links)
- Properties of Mapping on Class of All Ordinals (← links)
- Transfinite Recursion Theorem/Formulation 2/Lemma (← links)
- Transfinite Recursion Theorem/Formulation 2 (← links)
- Transfinite Recursion Theorem/Formulation 3 (← links)
- Transfinite Recursion Theorem/Formulation 4 (← links)
- Transfinite Recursion Theorem/Formulation 1/Proof 1 (← links)
- Transfinite Recursion Theorem/Formulation 1/Proof 2 (← links)
- Transfinite Recursion Theorem/Formulation 5 (← links)
- Transfinite Recursion Theorem without Axiom of Replacement implies Counting Theorem (← links)
- Class Mapping has Minimally Superinductive Class (← links)
- Zermelo's Well-Ordering Theorem/Proof 3 (← links)
- Property of Increasing Mapping on Ordinals (← links)
- Existence of Disjoint Well-Ordered Sets Isomorphic to Ordinals (← links)
- Choice Function for Set does not imply Choice Function for Union of Set/Mistake (← links)
- Cantor-Bernstein-Schröder Theorem/Also known as (← links)
- Talk:Main Page/Archive 14 (← links)
- Talk:Main Page/Archive 16 (← links)
- User:Prime.mover/Source Work Progress (← links)
- Category:Mistakes/Set Theory and the Continuum Problem (← links)
- Category:Transfinite Recursion Theorem (← links)
- Axiom:Axiom of Choice (← links)
- Axiom:Axiom of Abstraction (← links)
- Axiom:Axiom of Choice/Formulation 1 (← links)
- Axiom:Axiom of Choice/Formulation 3 (← links)
- Axiom:Peano's Axioms/Formulation 1 (← links)
- Axiom:Axiom of Choice/Historical Note (← links)
- Axiom:Axiom of Abstraction/Historical Note (← links)
- Axiom:Peano's Axioms/Historical Note (← links)
- Axiom:Axiom of Specification/Historical Note (← links)
- Axiom:Axiom of Replacement/Historical Note (← links)
- Axiom:Axiom of Extension/Class Theory (← links)
- Axiom:Axiom of Specification/Also known as (← links)
- Axiom:Axiom of Specification/Set Theory (← links)
- Axiom:Axiom of Specification/Class Theory (← links)
- Axiom:Axiom of Transitivity (← links)
- Axiom:Axiom of Swelledness (← links)
- Axiom:Axiom of the Empty Set/Class Theory (← links)
- Axiom:Axiom of Pairing/Set Theory/Weak Form (← links)
- Axiom:Axiom of Pairing/Class Theory (← links)
- Mathematician:Mathematicians/Sorted By Birthday/May (← links)
- Mathematician:Mathematicians/Sorted By Birth/1911 - 1920 CE (transclusion) (← links)