Omitting types in an intermediate logic (Q539154): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
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})\). | |||
Property / review text: 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})\). / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Mohammad Ardeshir / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03B55 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5900598 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
intuitionistic logic | |||
Property / zbMATH Keywords: intuitionistic logic / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Kripke models | |||
Property / zbMATH Keywords: Kripke models / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
semi-isolated | |||
Property / zbMATH Keywords: semi-isolated / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
omitting types | |||
Property / zbMATH Keywords: omitting types / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s11225-011-9310-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1985386660 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4357059 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5393630 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some preservation theorems in an intermediate logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Diagram Construction in Intuitionistic Logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Logic and structure / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3669380 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructivism in mathematics. An introduction. Volume II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Submodels of Kripke models / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 03:10, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Omitting types in an intermediate logic |
scientific article |
Statements
Omitting types in an intermediate logic (English)
0 references
27 May 2011
0 references
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})\).
0 references
intuitionistic logic
0 references
Kripke models
0 references
semi-isolated
0 references
omitting types
0 references