Re: Existence of proof verifiers: A comedy
- From: Charlie-Boo <shymathguy@xxxxxxxxx>
- Date: Sat, 3 May 2008 19:30:15 -0700 (PDT)
On May 3, 7:11 pm, Marshall <marshall.spi...@xxxxxxxxx> wrote:
On May 3, 2:33 pm, Charlie-Boo <shymath...@xxxxxxxxx> wrote:
On May 3, 12:26 pm, Marshall <marshall.spi...@xxxxxxxxx> wrote:
> (History of data management is probably off-topic, though.)
BTW That comment provides a proof that he failed. Can you (anybody)
see how?
Well, again, I think you have a point, but it's overstated. This
newsgroup is about mathematical logic, not data management.
If the field of data management had no connection to logic,
then you'd have a solid point. But if you go over to, say,
comp.databases.theory, (which despite its name is almost
entirely inhabited by practicioners working in the field, and
not academics) you will find that predicate logic is a not
infrequent subject of discussion.
What I am saying is that DataBase Query Processing IS a problem of
using Logic, as is Program Synthesis and even Theory of Computation.
They talk about the obvious role of AND, OR, NOT in queries, but never
exploited that. When you say it is off-topic. that is pointing out
that nobody came up with a general logical solution that uses
Predicate Calculus for the wff and Rules of Inference to reduce that
down to ANY file with any number of levels of hierarchy and any
logical expression at each level.
Codd's Relational Database nonsense is way off the mark. He made a
living telling people that their databases were no good, despite the
fact that they worked fine. Now everybody has to store their data in
particular "flat files" plus 2 level "indexes". The real solution is
to leave the data in place and MODEL it as Codd said he was doing.
Rather than putting the data into some fixed form, to model it means
to leave it in place and have a means to define each file that might
exist - any levels, any logical expressions. That is exactly what I
describe in the ARXIV paper. Each database file - each field in it -
is an arbitrarty predicate calculus wff. That is the general model
based on logic.
See my detailed explanation earlier.
C-B
(The conversation is much less sophisticated than it is
here, of course; that's why I'm on this newsgroup these
days and not so much c.d.t.)
Marshall
.
- Follow-Ups:
- Re: Existence of proof verifiers: A comedy
- From: Jan Burse
- Re: Existence of proof verifiers: A comedy
- References:
- Re: Existence of proof verifiers: A comedy
- From: Marshall
- Re: Existence of proof verifiers: A comedy
- From: Charlie-Boo
- Re: Existence of proof verifiers: A comedy
- From: Marshall
- Re: Existence of proof verifiers: A comedy
- From: Charlie-Boo
- Re: Existence of proof verifiers: A comedy
- From: Marshall
- Re: Existence of proof verifiers: A comedy
- Prev by Date: Re: All panduks are green
- Next by Date: Re: Existence of proof verifiers: A comedy
- Previous by thread: Re: Existence of proof verifiers: A comedy
- Next by thread: Re: Existence of proof verifiers: A comedy
- Index(es):
Relevant Pages
|