News for hackers. Stuff that matters.
Re:Catala: A Programming Language for the Law by Garlef on Thursday May 06, 2021 @05:25AM (#27060864)
> Goedel's incompleteness theory shows that an axiomatic system can either be consistent or complete, but not both.

Goedel's theorem is about a specific form of incompleteness.

I think you'd have to provide some additional arguments why the theorem would be relavant in this context.

In other words: I don't think law as a formal system needs all the features that are preconditions for Goedel's theorem.

Similarly: Most proof assistants are very much usable without allowing arbitrary recursion.

There are no comments on this comment yet.