Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Diaconescus_theorem> ?p ?o }
Showing triples 1 to 41 of
41
with 100 triples per page.
- Diaconescus_theorem abstract "In mathematical logic, Diaconescu's theorem, or the Goodman–Myhill theorem, states that the full axiom of choice is sufficient to derive the law of the excluded middle, or restricted forms of it, in constructive set theory. It was discovered in 1975 by Diaconescu and later by Goodman and Myhill. Already in 1967, Errett Bishop posed the Theorem as an exercise (Problem 2 on page 58 in ).".
- Diaconescus_theorem wikiPageID "18288107".
- Diaconescus_theorem wikiPageLength "3030".
- Diaconescus_theorem wikiPageOutDegree "21".
- Diaconescus_theorem wikiPageRevisionID "545362374".
- Diaconescus_theorem wikiPageWikiLink Axiom_of_choice.
- Diaconescus_theorem wikiPageWikiLink Axiom_of_extensionality.
- Diaconescus_theorem wikiPageWikiLink Axiom_of_specification.
- Diaconescus_theorem wikiPageWikiLink Axiom_schema_of_predicative_separation.
- Diaconescus_theorem wikiPageWikiLink Axiom_schema_of_specification.
- Diaconescus_theorem wikiPageWikiLink Bijection.
- Diaconescus_theorem wikiPageWikiLink Category:Constructivism_(mathematics).
- Diaconescus_theorem wikiPageWikiLink Category:Set_theory.
- Diaconescus_theorem wikiPageWikiLink Choice_function.
- Diaconescus_theorem wikiPageWikiLink Constructive_set_theory.
- Diaconescus_theorem wikiPageWikiLink Constructive_type_theory.
- Diaconescus_theorem wikiPageWikiLink Dedekind-infinite.
- Diaconescus_theorem wikiPageWikiLink Dedekind-infinite_set.
- Diaconescus_theorem wikiPageWikiLink Errett_Bishop.
- Diaconescus_theorem wikiPageWikiLink Finite_set.
- Diaconescus_theorem wikiPageWikiLink Heyting_arithmetic.
- Diaconescus_theorem wikiPageWikiLink Intuitionistic_type_theory.
- Diaconescus_theorem wikiPageWikiLink Law_of_excluded_middle.
- Diaconescus_theorem wikiPageWikiLink Law_of_the_excluded_middle.
- Diaconescus_theorem wikiPageWikiLink Mathematical_logic.
- Diaconescus_theorem wikiPageWikiLink Natural_number.
- Diaconescus_theorem wikiPageWikiLink Proposition.
- Diaconescus_theorem wikiPageWikiLink Set-builder_notation.
- Diaconescus_theorem wikiPageWikiLink Theorem.
- Diaconescus_theorem wikiPageWikiLinkText "Diaconescu's theorem".
- Diaconescus_theorem hasPhotoCollection Diaconescus_theorem.
- Diaconescus_theorem subject Category:Constructivism_(mathematics).
- Diaconescus_theorem subject Category:Set_theory.
- Diaconescus_theorem comment "In mathematical logic, Diaconescu's theorem, or the Goodman–Myhill theorem, states that the full axiom of choice is sufficient to derive the law of the excluded middle, or restricted forms of it, in constructive set theory. It was discovered in 1975 by Diaconescu and later by Goodman and Myhill. Already in 1967, Errett Bishop posed the Theorem as an exercise (Problem 2 on page 58 in ).".
- Diaconescus_theorem label "Diaconescu's theorem".
- Diaconescus_theorem sameAs Théorème_de_Diaconescu.
- Diaconescus_theorem sameAs m.04cvl21.
- Diaconescus_theorem sameAs Q3527059.
- Diaconescus_theorem sameAs Q3527059.
- Diaconescus_theorem wasDerivedFrom Diaconescus_theoremoldid=545362374.
- Diaconescus_theorem isPrimaryTopicOf Diaconescus_theorem.