conclusion of introduction to qspace? yes, and np=qspace? yes

[Daniel Pehoushek]

do all logicians on earth know that a question is a qbf? yes
and they know the answer to a qbf is always yes or no? yes
ok good
all logicians know that solving one qbf is hard and buggy? yes
but solving all qbfs from all models is a linear transformation? yes
ok good
so from a dnf of all models comes a dnf of all qbfs? yes
what if i want a cnf from the dnf? trivial but quadratic
is qbf exponential? well, P!=NP for large dimensions, so, yes
so for true satisfiability one must know all models? yes, #P=NP
and from 2002 #P=#Q? yes
everybody knows? yes
so the conclusion that #Q=NP seems like two inferences to some logicians? yes
i don't believe that at all. well, you are stupid.
the number of valid quantifications problem is
in theory as hard in general as finding one model? yes
daniel