Get to know Boolos better with 7 real example sentences.
Boolos in a sentence
Using Boolos
- In the example corpus, boolos often appears in combinations such as: george boolos.
Context around Boolos
- Average sentence length in these examples: 27 words
- Position in the sentence: 5 start, 1 middle, 1 end
- Sentence types: 7 statements, 0 questions, 0 exclamations
Corpus analysis for Boolos
- In this selection, "boolos" usually appears near the start of the sentence. The average example has 27 words, and this corpus slice is mostly made up of statements.
- Around the word, george, kripke, thus, 1989, 1998 and burgess stand out and add context to how "boolos" is used.
- Recognizable usage signals include boolos burgess and and boolos s proof. That gives this page its own corpus information beyond isolated example sentences.
- By corpus frequency, "boolos" sits close to words such as aaba, aafc and aaib, which helps place it inside the broader word index.
Example types with boolos
The same corpus examples are grouped by length and sentence type, making it easier to see the contexts in which the word appears:
A similar proof method was independently discovered by Saul Kripke (Boolos 1998, p. 383). (14 words)
Boolos Burgess and Jeffrey 2002:25 include the possibility of "there is someone stationed at each end to add extra blank squares as needed". (24 words)
The best-known way is due to philosopher and mathematical logician George Boolos (1940–1996), who was an expert on the work of Frege. (24 words)
Boolos's proof proceeds by constructing, for any computably enumerable set S of true sentences of arithmetic, another sentence which is true but not contained in S. This gives the first incompleteness theorem as a corollary. (36 words)
Proof via Berry's paradox George Boolos (1989) sketches an alternative proof of the first incompleteness theorem that uses Berry's paradox rather than the liar paradox to construct a true but unprovable formula. (34 words)
Thus, Boolos and Jeffrey are saying that an algorithm implies instructions for a process that "creates" output integers from an arbitrary "input" integer or integers that, in theory, can be arbitrarily large. (32 words)
Example sentences (7)
A similar proof method was independently discovered by Saul Kripke (Boolos 1998, p. 383).
Boolos Burgess and Jeffrey 2002:25 include the possibility of "there is someone stationed at each end to add extra blank squares as needed".
Boolos's proof proceeds by constructing, for any computably enumerable set S of true sentences of arithmetic, another sentence which is true but not contained in S. This gives the first incompleteness theorem as a corollary.
George Boolos (1989) built on a formalized version of Berry's paradox to prove Gödel's Incompleteness Theorem in a new and much simpler way.
Proof via Berry's paradox George Boolos (1989) sketches an alternative proof of the first incompleteness theorem that uses Berry's paradox rather than the liar paradox to construct a true but unprovable formula.
The best-known way is due to philosopher and mathematical logician George Boolos (1940–1996), who was an expert on the work of Frege.
Thus, Boolos and Jeffrey are saying that an algorithm implies instructions for a process that "creates" output integers from an arbitrary "input" integer or integers that, in theory, can be arbitrarily large.
Common combinations with boolos
These word pairs occur most frequently in English texts: