Kurt Gödel, completeness, incompleteness

Abstrakt

The famous results of Gödel – semantic completeness of classical (predicate) logic and deductive incompleteness of any ''reasonable'' arithmetic – are briefly presented for a reader able of elementary mathematical thinking.

Kategorie a štítky

  • Článek v odborném periodiku