Structures, Models, and Satisfaction

To recap, an axiomatic system that can represent recursive functions entails arithmetic sentences \(\sigma \) that are true and not provable in the system. The system cannot prove its own consistency, represented by \(\lnot \mathrm {Prov}(\lceil \bot \rceil )\) , unless it is inconsistent.