About: Finite promise games and greedy clique sequences

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

The finite promise games are a collection of mathematical games developed by American mathematician Harvey Friedman in 2009 which are used to develop a family of fast-growing functions , and . The greedy clique sequence is a graph theory concept, also developed by Friedman in 2010, which are used to develop fast-growing functions , and .

Property	Value
dbo:abstract	The finite promise games are a collection of mathematical games developed by American mathematician Harvey Friedman in 2009 which are used to develop a family of fast-growing functions , and . The greedy clique sequence is a graph theory concept, also developed by Friedman in 2010, which are used to develop fast-growing functions , and . represents the theory of ZFC plus, for each , "there is a strongly -Mahlo cardinal", and represents the theory of ZFC plus "for each , there is a strongly -Mahlo cardinal". represents the theory of ZFC plus, for each , "there is a -stationary Ramsey cardinal", and represents the theory of ZFC plus "for each , there is a strongly -stationary Ramsey cardinal". represents the theory of ZFC plus, for each , "there is a -huge cardinal", and represents the theory of ZFC plus "for each , there is a strongly -huge cardinal". (en)
dbo:wikiPageExternalLink	https://cs.nyu.edu/pipermail/fom/2009-December/014276.html%7Curl-status=live%7Caccess-date=2021-10-02%7Cwebsite=New https://cs.nyu.edu/pipermail/fom/2009-September/014007.html%7Curl-status=live%7Caccess-date=2021-10-02%7Cwebsite=New https://cs.nyu.edu/pipermail/fom/2010-January/014282.html%7Curl-status=live%7Caccess-date=2021-10-02%7Cwebsite=New
dbo:wikiPageID	68870278 (xsd:integer)
dbo:wikiPageLength	16123 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	1048239729 (xsd:integer)
dbo:wikiPageWikiLink	dbc:Mathematical_games dbr:Mathematical_game dbr:Clique_(graph_theory) dbr:Zermelo–Fraenkel_set_theory dbr:Mahlo_cardinal dbr:Harvey_Friedman dbr:Graph_theory dbc:Mathematical_concepts dbr:Huge_cardinal dbr:Second-order_arithmetic dbr:Ramsey_cardinal dbr:Factorial
dbp:wikiPageUsesTemplate	dbt:Cite_web dbt:Short_description
dcterms:subject	dbc:Mathematical_games dbc:Mathematical_concepts
rdfs:comment	The finite promise games are a collection of mathematical games developed by American mathematician Harvey Friedman in 2009 which are used to develop a family of fast-growing functions , and . The greedy clique sequence is a graph theory concept, also developed by Friedman in 2010, which are used to develop fast-growing functions , and . (en)
rdfs:label	Finite promise games and greedy clique sequences (en)
owl:sameAs	wikidata:Finite promise games and greedy clique sequences https://global.dbpedia.org/id/G5qu3
prov:wasDerivedFrom	wikipedia-en:Finite_promise_games_and_greedy_clique_sequences?oldid=1048239729&ns=0
foaf:isPrimaryTopicOf	wikipedia-en:Finite_promise_games_and_greedy_clique_sequences
is foaf:primaryTopic of	wikipedia-en:Finite_promise_games_and_greedy_clique_sequences