User:IssaRice/Computability and logic/Some important distinctions and equivalences in introductory mathematical logic: Difference between revisions
| Line 11: | Line 11: | ||
I have a rough draft quiz about this that I should post. Also see <ref>https://www.hedonisticlearning.com/posts/the-pedagogy-of-logic-a-rant.html#syntax-versus-semantics</ref> | I have a rough draft quiz about this that I should post. Also see <ref>https://www.hedonisticlearning.com/posts/the-pedagogy-of-logic-a-rant.html#syntax-versus-semantics</ref> | ||
In computability theory, "syntax" corresponds to algorithms and "semantics" corresponds to functions computable via algorithms. See Rice's theorem. | In computability theory, "syntax" corresponds to algorithms and "semantics" corresponds to functions computable via algorithms. See Rice's theorem, where this distinction becomes especially important. | ||
{| class="wikitable" | {| class="wikitable" | ||