On Wed, Oct 6, 2010 at 11:57 AM, Ed Murphy <emurph...@socal.rr.com> wrote: > Detail: http://zenith.homelinux.net/cotc/viewcase.php?cfj=2878 > > =================== CFJ 2878 (Interest Index = 0) ==================== > > Due to Rule 2215, it would be illegal for me to make an > unqualified public statement that is identical to this > statement. > > ========================================================================
It seems to me that there should be a model which ensures every statement is either true, false, or indeterminate (because being indeterminately indeterminate, like this statement, is just weird), without excessively restricting hypotheticals. But I can't think of one. Maybe all recursive statements should just be considered indeterminate, regardless of how they would come out if we attempted to break them apart?
