Revision as of 10:16, 30 April 2011 view source CBM (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 55,390 edits Undid revision 426696588 by 149.169.114.2 (talk) - doesn't work ← Previous edit		Revision as of 07:48, 4 May 2011 view source 117.211.37.162 (talk) →Example: The set of true reachable propositions Tag: shouting Next edit →
Line 87: This set is called 'true reachable propositions' because in non-constructive approaches to the foundations of mathematics, the set of true propositions may be larger than the set recursively constructed from the axioms and rules of inference. See also [[Gödel's incompleteness theorems]]. JITENDRA VHVUJHKUFYFUHJGHJ HJHBV JH ===Functional recursion===

Recursion: Difference between revisions