XPost: comp.theory, sci.logic   
   From: dbush.mobile@gmail.com   
      
   On 8/13/2025 9:40 PM, olcott wrote:   
   > How many tests that are black in color are entirely   
   > white in color and the answer must be a positive   
   > integer and must come with proof that it is correct.   
      
   Error: Assumes that something can be entirely black and entirely white   
      
   >   
   > What time is it (yes or no) ?   
      
   Error: Assumes that the answer can be yes or no   
      
   >   
   > Is this sentence true or false: "This sentence is not true" ?   
   > The above is the basis for the Tarski undefinability theorem.   
      
   Error: Assume that sentence can have a truth value   
      
   >   
   > What correct value can a halt decider return on an input   
   > that does the opposite of whatever the halt decider decides?   
      
   Error: Assumes that a halt decider exists   
      
   >   
   > The correct answer is that no such *INPUT* can possibly exist.   
   >   
      
      
   Conclusion: When you assume something and encounter a contradiction,   
   that proves the assumption false.   
      
   All you're doing is showing that you don't understand proof by   
   contradiction, a concept taught to and understood by high school   
   students more than 50 years your junior.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)