On May 20, 8:27 am, Jürgen R. <
jurg...@arcor.de> wrote:
> > The "proof" ends with p. 516. And
> > obviously Zermelo takes for granted that every element can be
> > addressed, i.e., is defined.
>
> No. "Addressing", whatever that might mean, has nothing to do
> with the argument. Nor is "addressing" of "elements" a notion
> that has a meaning outside of M ckenhausen.
>
There are Specification Languages but you end up programming the
function in a 4GL like Prolog anyway.
Here is a bnf grammar that could enumerate Prolog Horne Clauses.
So to enumerate all *addressable* reals (or their specifications), you
could use a grammar such as this.
Note this encompasses Predicate Calculus.
Courtesy: VTPROLOG, AI EXPERT MAGAZINE
sentence ::- rule | query | command
rule ::- head '.' | head ':-' tail '.'
query ::- '?-' tail '.'
command ::- '@' file_name '.'
head ::- goal
tail ::- goal | goal ',' tail
goal ::- constant | variable | structure
constant ::- {quoted string} | {token beginning with 'a' .. 'z'}
variable ::- {identifier beginning with 'A' .. 'Z' or '_' }
structure ::- functor '(' component_list ')'
functor ::- {token beginning with 'a' .. 'z'}
component_list ::- term | term ',' component_list
term ::- goal | list
list ::- '[]' | '[' element_list ']'
element_list ::- term | term ',' element_list | term | term
e.g.
SENTENCE
-> RULE
-> HEAD :- TAIL
-> GOAL :- GOAL
-> STRUCTURE :- STRUCTURE
-> FUNCTOR(COMPONENT_LIST) :- FUNCTOR(COMPONENT_LIST)
-> FUNCTOR(TERM,COMP_LIST) :- FUNCTOR(TERM,COMP_LIST)
-> FUNCTOR(TERM,TERM) :- FUNCTOR(TERM,TERM)
-> FUNCTOR(GOAL,GOAL) :- FUNCTOR(GOAL,GOAL)
-> FUNCTOR(CONST,VAR) :- FUNCTOR(VAR,CONST)
-> likes(john,X) :- likes(X,wine)
"JOHN LIKES PEOPLE WHO LIKE WINE".
OK here's an arithmetic grammar I'm working on!
EXPRESSION ::> SUM | TERM
SUM ::> TERM + TERM
TERM::> FACTOR FACTOR
FACTOR ::> TERM | (NUM)
NUM ::> -ABS | ABS
ABS ::> LEADINGDIGIT DIGIT^n | LEADINGDIGIT DIGIT^n . DIGITS | 0 .
DIGITS
LEADINGDIGIT ::> 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
DIGITS ::> DIGIT | DIGIT DIGITS
DIGIT ::> 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
EXPRESSION
-> TERM
-> FACTOR FACTOR
-> (NUM) (NUM)
-> (-ABS) (-ABS)
-> (-LEADINGDIGIT DIGITS) (-LEADINGDIGIT DIGITS)
-> (-10) (-20)
OK so the Natural Numbers are from 10 onwards
********
ZFC would be just as easy with about 20 symbols!
All possible predicate calculus theorems and a bnf grammar for ZFC -
COUNTED!
OK so... where is 1 missing set you can't formulate?
Herc