Through a reduction of the halting problem for register machines we prove that it is undecidable whether or not a coherent formula is a logical consequence of a coherent theory. We include a simple completeness proof for coherent logic. Although not published in the present form, these results seem to be folklore. Therefore we do not claim originality. Given the undecidability of the halting problem for register machines the presentation is self-contained.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- On the Undecidability of Coherent Logic
- Springer Berlin Heidelberg
Neuer Inhalt/© ITandMEDIA