This is an old revision of this page, as edited by SmackBot(talk | contribs) at 18:52, 12 October 2010(Subst: {{unsigned}} (& regularise templates)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 18:52, 12 October 2010 by SmackBot(talk | contribs)(Subst: {{unsigned}} (& regularise templates))
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
What exactly is the reason for creating a separate forcing page just for computability theory? While it is certainly different from forcing in set theory, the principle of satisfying certain requirements by carefully controlling how one condition is extended to the next is the same. Should we have a separate page also for forcing in arithmetic? Also, the disambiguation page which takes one to 'Forcing (mathematics)' and 'Forcing (recursion theory)' seems quite silly. There is no such thing as 'forcing in mathematics', and computability (recursion) theory is definitely a part of mathematics. So if we wish to persists in this very unreasonable split of forcing into two entirely separate entities (without a general forcing page illustrating the commonalities and general principles), then certainly the former article should be renamed 'Forcing (set theory)'.—Preceding unsigned comment added by 67.175.23.32 (talk • contribs)
