Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent

Replies: 20   Last Post: Mar 19, 2013 1:32 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Graham Cooper

Posts: 4,256
Registered: 5/20/10
Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent

Posted: Mar 15, 2013 12:14 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Mar 15, 3:34 am, Charlie-Boo <shymath...@gmail.com> wrote:
> On Mar 13, 5:57 pm, Graham Cooper <grahamcoop...@gmail.com> wrote:
> >
> > -------------

>
>  >  WAGER:  I will paypal CHARLIE BOO $25
>
>  >  if he can prove ANY theory at all is inconsistent!
>
> Didn?t I say ?CBL proves Hilbert impossible.? ?
>
> http://groups.google.com/group/sci.logic/msg/3bc441b51ffe6455?hl=en
>
> So you want a formal proof  in CBL that ...
>


JUST ANSWER 1 QUESTION STRAIGHT!

How many CHARACTER SYMBOLS are in CBL?



====================================

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.


You can't! The answer is TYPE: NUM!

I could answer that Question about MY SET THEORY

because IT RUNS!

Here is 1 of 9 MODULES of BLOCKPROLOG

Check function ATERM and AVAR

TERM
a-z, 0-9, % and *

VAR
A-Z, @

That's 26 + 10 + 2 + 26 + 1 = 65 CHARACTERS!

CBL has how many?

What is | {ALPHABET(CBL)} | ?



<?

//**********************************
//** ADD **
//**********************************

//Copyright 2013 (c) BLOCKPROLOG.COM




function aterm($ch)
{
$good = false;
if (($ch>="a") & ($ch<="z"))
{
$good = true;
}
if (($ch>="0") & ($ch<="9"))
{
$good = true;
}
if (($ch=="!") | ($ch=="%"))
{
$good = true;
}
return $good;
}


function avar($ch)
{
return ((($ch>="A") & ($ch<="Z")) | ($ch="@"));

}



function tableHeads($id, $ref, $term)
{
global $factadded;

if ($id == 0)
{
$id = 1;
$sql1 = "SELECT MAX(id) AS MID FROM HEADS";
$result1 = mysql_query($sql1);
if ($row = mysql_fetch_array($result1))
{
$id = $row['MID'] + 1;
}
}


//echo "<br>STORE:" . $id ." : ". $ref ." : ". $term;

if (avar($term[0])) //A B C
{
$sql1="INSERT INTO
HEADS(id, ref, term, var)
VALUES($id, '$ref', '*', '$term')";
}
else //a b c
{
$sql1="INSERT INTO
HEADS(id, ref, term, var)
VALUES($id, '$ref', '$term', '')";
}



$result1=mysql_query($sql1);
$factadded = true;

// echo "<br>DEBUG10 FID:" . mysql_insert_id();
return $id;
}




function tableTails($id, $ref, $term, $tail)
{
}



function tableQuery($ref, $term)
{
//echo "<br>QUERY: ". $ref ." : ". $term;

global $pushes;

if (aterm($term[0]))
{
$sql1="INSERT INTO
QUERY(ref, term, buds)
VALUES('$ref', '$term', 0)";
$result1=mysql_query($sql1);
}
else
{
pushvr($term, $ref);
$pushes++;
}
}




function add1line($strng, $tail)
{

// $strng = 'a [b c] [d e]'


// SQL TABLE HEADS
// +----+-----+------+-----+
// | id | ref | term | var |
// +----+-----+------+-----+
// | 1 | 1 | f | |
// | 1 | 21 | g | |
// | 1 | 22 | a | |

// SQL TABLE TAILS
// +----+-----+------+-----+------+
// | id | ref | term | var | tail |
// +----+-----+------+-----+------+
// | 1 | 1 | t | | 1 |
// | 1 | 21 | x | | 1 |
// | 1 | 22 | y | | 1 |


// f [g a] BLoCKPROLOG
// t [x y].
//
// f(g(a)) :- t(x(y)). PROLOG


//echo "<br><br>DEBUG:add-facts " . $strng;

$i = 0;
$lentail = strlen($strng);
$bc = 0; // bracket count
$tc[0] = 1; // term count
$ec = 0; // ] count
$charmode = false;
$term = "";
$sym = "*";
$hid = 0;


while ($i < $lentail)
{
$ch = $strng[$i];
$ischar = false;
$isvar = false;
$gotterm = false;
$gotsym = false;

if (aterm($ch))
{
$ischar = true;
}
if (($ch>="A") & ($ch<="Z"))
{
$ischar = true;
$isvar = true;
}

if ($ischar)
{
if ((!$charmode) & ($sym!="*"))
{
$gotsym = true;
$thesym = $sym;
}
$term = $term . $ch;
$charmode = true;
$sym = "";
}
else
{

//check for '[' ']' ' '

if ($ch == "[")
{
$sym = "[";
}
if ($ch == "]")
{
$sym = "]";
$ec++;
}
if (($ch == " ") & ($sym == ""))
{
$sym = " ";
}
if ($charmode)
{
$gotterm = true;
}
$charmode = false; //ignore consecutive spaces
}

if ($gotterm)
{
// add to table when character stream ends

$ref = "";
for ($r=0;$r<=$bc;$r++)
{
$ref = $ref . $tc[$r];
}

if ($tail == 0)
{
$hid = tableHeads( $hid, $ref, $term);
}
if ($tail > 0)
{
$hid = tableTails( $hid, $ref, $term, $tail);
}
if ($tail < 0)
{
$hid = tableQuery( $ref, $term);
}

$term = "";
}

if ($gotsym)
{
//if ($thesym == "]")
//{
while ($ec>0) //multiple end brackets ]]][
{
$bc--;
$ec--;
if (($thesym != "[") | ($ec > 0))
{
$tc[$bc]++;
}
}
//}
if ($thesym == "[")
{
$tc[$bc]++;
$bc++;
$tc[$bc]=1;
}
else
{
if ($thesym == " ")
{
$tc[$bc]++;
}
}

$gotsym = false;
}


$i++;
}

return $hid;
}


?>



.
.
.
.
.
.
.


That's the INPUT PARSER that detects what level of BRACKETS have been
entered before each TERM.

EACH TERM of EACH LINE has to be PROCESSED by a PARSER.

COPY AND PASTE-ABLE <=/=> MACHINE PARSABLE PROOF

That's 1 of 9 MODULES called by the INDEX.PHP



<?

//**********************************
//** INDEX **
//**********************************

//Copyright 2013 (c) BLOCKPROLOG.COM

//SETUP INSTRUCTIONS IN BP-CONFIG.PHP




include "bp-header.html";

include "bp-config.php";
include "bp-init.php";
include "bp-add.php";
include "bp-query.php";
include "bp-command.php";
include "bp-routines.php";
include "bp-main.php";

main(htmlentities($_POST['text1']));

include "bp-footer.html";



?>



Herc
--
www.BLoCKPROLOG.com



Date Subject Author
3/13/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Graham Cooper
3/13/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Graham Cooper
3/14/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Charlie-Boo
3/14/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Charlie-Boo
3/14/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Graham Cooper
3/14/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Charlie-Boo
3/14/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Graham Cooper
3/14/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Charlie-Boo
3/14/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Graham Cooper
3/15/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Charlie-Boo
3/19/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Graham Cooper
3/19/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Charlie-Boo
3/19/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Charlie-Boo
3/15/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Graham Cooper
3/15/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Charlie-Boo
3/15/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Graham Cooper
3/19/13
Read Re: I Bet $25 to your $1 (PayPal) That You Can’t P
rove Naive Set Theory Inconsistent
Charlie-Boo

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.