Search results
Jump to navigation
Jump to search
- ...st1=Yanofsky |first1=Noson |title=A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points |journal=The Bulletin of Symbolic Logic |d ...3 KB (446 words) - 19:43, 29 December 2024
- ...wed how to create a paradox similar to the [[liar paradox]], but without [[self-reference]]. Unlike the liar paradox, which uses a single sentence, '''Yabl *[https://www.mit.edu/~yablo/pwsr.pdf "Paradox Without Self-Reference"] - ''Analysis'', vol. 53 (1993), pp. 251–52 ...9 KB (1,198 words) - 16:35, 27 February 2025
- ...an contain itself as a member or is defined in terms of a circular or self-referential structure, used in the study of [[Non-well-founded set theory|non-well-foun {{defn |1=A conception that defines sets in such a way as to avoid certain paradoxes by excluding collections that are too large to be sets.}} ...90 KB (13,951 words) - 23:05, 2 December 2024
- {{defn |1=A self-operating machine or, in computer science, a theoretical model of computati ...of abstraction, particularly in the context of Frege's Basic Law V and the paradoxes it generates.<ref>{{Citation |last=Tennant |first=Neil |title=Logicism and ...270 KB (38,241 words) - 06:11, 6 January 2025
- ...the source code of a program. Moreover, the definition of ''g'' is [[self-referential]]. A rigorous proof addresses these issues. The overall goal is to show tha ...tica'' to *56, Cambridge at the University Press, 1962. Re: the problem of paradoxes, the authors discuss the problem of a set not be an object in any of its "d ...53 KB (7,812 words) - 09:12, 21 February 2025