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.
Recommendations
- Set-theoretic semantics for Heyting's system Int
- A logical framework for developing and mechanizing set theories
- scientific article; zbMATH DE number 7333175
- Steps towards a proof-theoretical semantics
- A set-theoretic semantics for Clear
- A Framework for Formalizing Set Theories Based on the Use of Static Set Terms
- Towards a computation system based on set theory
- scientific article; zbMATH DE number 2209836
- scientific article; zbMATH DE number 221384
Cited in
(3)
This page was built for publication: A step semantic system for set theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065794)
