Search results
Jump to navigation
Jump to search
- ...ematical logic]], [[set theory]], [[Forcing (mathematics)|forcing]], and [[Computability theory|recursion theory]]. She is a professor of mathematics at [[Dartmouth [[Category:Set theorists]] ...6 KB (798 words) - 22:51, 3 February 2025
- ...[Philosophy|philosopher]] and [[ethicist]]. He was noted for his work in [[computability]], [[mathematical logic]] and the [[foundations of mathematics]]. ...vigad, Jeremy]]; Brattka, Vasco (2014): ''[https://arxiv.org/abs/1206.3431 Computability and Analysis: The Legacy of Alan Turing]''. In [[Rod Downey|Downey, Rod]] ( ...36 KB (4,447 words) - 22:27, 14 January 2025
- ...ample, Hardy's definition includes [[multivalued function]]s and what in [[computability theory]] are called [[partial functions]]. The second group of logicians, the set-theorists, emerged with [[Georg Cantor]]'s "set theory" (1870–1890) but were driven f ...78 KB (11,625 words) - 16:51, 28 February 2025
- ...ems, like [[first-order logic]], qualify as logics. For such reasons, some theorists deny that [[higher-order logic]]s are logics in the strict sense.{{sfnm|1a1 ...".{{sfnm|1a1=Maltby|1a2=Day|1a3=Macaskill|1y=2007|2a1=Dowden|1p=564}} Some theorists state that formal logic studies the general form of arguments while informa ...145 KB (20,377 words) - 19:04, 1 March 2025