{"title":"Trees","authors":"Jon Pierre Fortney","doi":"10.1201/9781003091479-10","DOIUrl":"https://doi.org/10.1201/9781003091479-10","url":null,"abstract":"","PeriodicalId":395767,"journal":{"name":"Discrete Mathematics for Computer Science","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134379541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Boolean Algebra","authors":"Jon Pierre Fortney","doi":"10.1201/9781003091479-5","DOIUrl":"https://doi.org/10.1201/9781003091479-5","url":null,"abstract":"","PeriodicalId":395767,"journal":{"name":"Discrete Mathematics for Computer Science","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125236515","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Set Theory","authors":"Jon Pierre Fortney","doi":"10.1090/text/056/02","DOIUrl":"https://doi.org/10.1090/text/056/02","url":null,"abstract":"12. An ordinal written as ωαn1 + . . . + ω αnk, where α1 > . . . > αk are ordinals (and k and n1, . . . , nk are non-zero natural numbers), is said to be in Cantor Normal Form. Show that every non-zero ordinal has a unique Cantor Normal Form. What is the Cantor Normal Form for the ordinal ǫ0? 13. What is the smallest fixed point of α 7→ ω? The next smallest? And the next smallest? Show that the fixed points are unbounded, and explain why this means that we may index the fixed points by the ordinals. Is there a countable ordinal α such that α is the α-th fixed point?","PeriodicalId":395767,"journal":{"name":"Discrete Mathematics for Computer Science","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126212371","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Functions","authors":"Jon Pierre Fortney","doi":"10.1201/9781003091479-6","DOIUrl":"https://doi.org/10.1201/9781003091479-6","url":null,"abstract":"","PeriodicalId":395767,"journal":{"name":"Discrete Mathematics for Computer Science","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124777372","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Algorithmic Complexity","authors":"Jon Pierre Fortney","doi":"10.1201/9781003091479-8","DOIUrl":"https://doi.org/10.1201/9781003091479-8","url":null,"abstract":"","PeriodicalId":395767,"journal":{"name":"Discrete Mathematics for Computer Science","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126573120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Graph Theory","authors":"Jon Pierre Fortney","doi":"10.1201/9781003091479-9","DOIUrl":"https://doi.org/10.1201/9781003091479-9","url":null,"abstract":"","PeriodicalId":395767,"journal":{"name":"Discrete Mathematics for Computer Science","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127794040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Introduction to Algorithms","authors":"Jon Pierre Fortney","doi":"10.1201/9781003091479-1","DOIUrl":"https://doi.org/10.1201/9781003091479-1","url":null,"abstract":"","PeriodicalId":395767,"journal":{"name":"Discrete Mathematics for Computer Science","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117218877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Number Representations","authors":"Jon Pierre Fortney","doi":"10.1002/0471650412.ch2","DOIUrl":"https://doi.org/10.1002/0471650412.ch2","url":null,"abstract":"","PeriodicalId":395767,"journal":{"name":"Discrete Mathematics for Computer Science","volume":"7 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114124243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Logic","authors":"Jon Pierre Fortney","doi":"10.1525/luminos.54.g","DOIUrl":"https://doi.org/10.1525/luminos.54.g","url":null,"abstract":"","PeriodicalId":395767,"journal":{"name":"Discrete Mathematics for Computer Science","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114532961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：