|
|
|
|
|
by loicd
1070 days ago
|
|
Exactly. A statement is true by definition if and only if it is satisfied in every model. Also, Gödel also proved the completeness theorem that states that a statement is true if and only if it is provable. So, another way to look at undecidability is this: a statement is undecidable if and only if it can be neither proved nor disproved. |
|
> A statement is true by definition if and only if it is satisfied in every model.
I don’t think this is a standard definition.
Every treatment I’ve seen refers to truth with respect to a model; if no model is specified, it is assumed to be obvious from context. Outside of formal treatments (i.e. in the setting where the 99% of mathematicians who aren’t logicians do their work), the model is the standard model.
First-order formulae that are true in every model are validities.