3 ms·
Not Gödel's theorem, but inference for first-order logic is undecidable in general for other reasons. You can still get pretty far with heuristics though. Don't
by bubblyworld 2y ago
Not Gödel's theorem, but inference for first-order logic is undecidable in general for other reasons. You can still get pretty far with heuristics though. Don't let perfect be the enemy of good =P
- dpierce9 2y agoFirst order logics can be provably sound and complete when they do not express certain arithmetic operations.
- bubblyworld 2y agoFirst-order logic is sound and complete in general (via Gödel's lesser known completeness theorem, for instance). That doesn't contradict what I wrote =)