Godel's completeness theorem can be stated as "Every consistent first-order theory with a well-orderable language has a model." (from Wikipedia)
What would be an example of a language that is not well-orderable?
Godel's completeness theorem can be stated as "Every consistent first-order theory with a well-orderable language has a model." (from Wikipedia)
What would be an example of a language that is not well-orderable?
Copyright © 2021 JogjaFile Inc.