- ...sketch.
- This reminds one of Löwenheim's claim
in section 2 of his paper,
that he would analyze the dependence/independence of several axiom
systems for the Calculus of Classes.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...Classes.
- Schröder had worked out some simple cases involving a couple of
negated equations - and sketched a combinatorial procedure for the
elimination in general. However, because he wanted to keep precise track
of all the combinations involved he failed to note the nature of the
final result - instead he dwelt on the incredibly complicated nature
of the calculations that needed to be done.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...lattices.
- The fact that the Gruppenkalul is nothing other
than lattice theory seems to have escaped everyone's attention.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...axioms.
- We now know that the first-order theory of lattices is
undecidable, so a general algorithm would be impossible.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.