Omitting types in an intermediate logic (Q539154): Difference between revisions

The authors prove an omitting-types theorem and one direction of the Ryll-Nardzewski theorem, from classical model theory, for a special intermediate logic, called semi-classical logic (SLC). The semi-classical logic is the logic of the class of linear constant-domain Kripke models with an extra constraint, i.e., every node of the model is identified with an atomic formula of the language in the following sense. For each atomic formula \(\theta(\bar{x})\) in the language and \(\bar{a}\) in the universe, if \(\theta(\bar{a})\) is satisfied in a node \(\alpha\), then there is a least such \(\alpha\), and conversely, for each node \(\alpha\), there is an atomic formula \(\theta(\bar{x})\) in the language and \(\bar{a}\) in the universe such that \(\alpha\) is the least node that satisfies \(\theta(\bar{a})\).