A step semantic system for set theory (Q1065794)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3922643
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A step semantic system for set theory |
scientific article; zbMATH DE number 3922643 |
Statements
A step semantic system for set theory (English)
0 references
1984
0 references
A hierarchy of languages \(M_ n\), for every natural n is constructed, where \(M_ 0\) is the language \(\text{Russian{Ya}}_{\omega}\) of \textit{A. A. Markov} [Dokl. Akad. Nauk. SSSR 214, 1262-1264 (1974; Zbl 0308.02037)]. The hierarchy culminates in a language \(M_{\omega}\) of set theory in constructive mathematics. The truth of various formulas of \(M_{\omega}\) is investigated and it is shown that the language \(M_{\omega}\) is reasonably close to the language of set theory in classical predicate logic.
0 references
languages for constructive set theory
0 references
constructive mathematics
0 references
0.8800012
0 references
0.87580657
0 references
0.87500286
0 references
0 references
0 references
0.8610999
0 references
