Revision as of 22:05, 18 January 2024 edit Citation bot (talk \| contribs) Bots 5,871,306 edits Altered pages. Add: s2cid, jstor. Formatted dashes. \| Use this bot. Report bugs. \| Suggested by Abductive \| Category:Computability theory \| #UCB_Category 90/100 ← Previous edit		Latest revision as of 03:06, 4 June 2025 edit undo Psychastes (talk \| contribs) Extended confirmed users 18,540 edits Removed {{Expert needed}} tag: not a valid reason to request an expert Tag: Twinkle
Line 1: ~~{{Expert needed\|mathematics \|ex2= logic \|reason= Article incomplete \|date = April 2021}}~~ '''Forcing''' in [[computability theory]] is a modification of [[Paul Cohen (mathematician)\|Paul Cohen's]] original [[set theory\|set-theoretic]] technique of [[forcing (set theory)\|forcing]] to deal with computability concerns.

Forcing (computability): Difference between revisions