{"title":"有序原则","authors":"Gove Effinger, G. Mullen","doi":"10.1201/9780429324819-5","DOIUrl":null,"url":null,"abstract":"The well-ordering principle is a concept which is equivalent to mathematical induction. In your textbook, there is a proof for how the well-ordering principle implies the validity of mathematical induction. However, because of the very way in which we constructed the set of natural numbers and its arithmetic, we deduced, in class, the validity of mathematical induction directly from the axioms of set theory. In this note, we show how mathematical induction, in turn, implies the well-ordering principle.","PeriodicalId":383229,"journal":{"name":"An Elementary Transition to Abstract Mathematics","volume":"756 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Well-Ordering Principle\",\"authors\":\"Gove Effinger, G. Mullen\",\"doi\":\"10.1201/9780429324819-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The well-ordering principle is a concept which is equivalent to mathematical induction. In your textbook, there is a proof for how the well-ordering principle implies the validity of mathematical induction. However, because of the very way in which we constructed the set of natural numbers and its arithmetic, we deduced, in class, the validity of mathematical induction directly from the axioms of set theory. In this note, we show how mathematical induction, in turn, implies the well-ordering principle.\",\"PeriodicalId\":383229,\"journal\":{\"name\":\"An Elementary Transition to Abstract Mathematics\",\"volume\":\"756 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"An Elementary Transition to Abstract Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1201/9780429324819-5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"An Elementary Transition to Abstract Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1201/9780429324819-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The well-ordering principle is a concept which is equivalent to mathematical induction. In your textbook, there is a proof for how the well-ordering principle implies the validity of mathematical induction. However, because of the very way in which we constructed the set of natural numbers and its arithmetic, we deduced, in class, the validity of mathematical induction directly from the axioms of set theory. In this note, we show how mathematical induction, in turn, implies the well-ordering principle.