整礎帰納法
#Fleeting_Notes
整礎帰納法(Well-founded induction)
(ワードのみ)整礎、整礎関係、前順序集合
Definition: A well-founded relation is a binary relation on a set A such that there are no infinite descending chains· .. --< ai --< ... --< al --< ao. When a --< b we say a is a predecessor of b.
『For Discrete Mathematics 2018-19: Well-founded Induction and Recursion』
ソフトウェア構成特論 第 3 回
『The formal semantics of programming languages: an introduction』 P33
確認用
Q. 整礎帰納法
メモ
4.4 順序集合
調査用
Google.icon 整礎帰納法(日)
Google.icon Well-founded induction(英)
Wikipedia.icon
整礎帰納法 - Wikipedia(日)
整礎帰納法(検索) - Wikipedia(日)
Wikipedia.icon
Well-founded induction - Wikipedia(英)
Well-founded induction(検索) - Wikipedia(英)