Y
Hacker News
new
|
ask
|
show
|
jobs
by
dpierce9
475 days ago
First order logics can be provably sound and complete when they do not express certain arithmetic operations.
1 comments
bubblyworld
475 days ago
First-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 =)
link