Concepedia

Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ<sub>0</sub>‐formulas in set theory

Franco Parlamento, Alberto Policriti

Communications on Pure and Applied Mathematics · 1988 · 30 citations · 9 references

DOI

Concepts

References

9

Theory of Recursive Functions and Effective Computability.

Solomon Feferman, Hartley Rogers · American Mathematical Monthly · 1969 · 2.8K citations

, , +14

Theory of Recursive Functions and Effective Computability

D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text

, , +14

A system of axiomatic set theory—Part I

Paul Bernays · Journal of Symbolic Logic · 1937 · 130 citations

, , +13

Decision procedures for elementary sublanguages of set theory. I. Multi‐level syllogistic and some extensions

Alfredo Ferro, Eugenio G. Omodeo, Jacob T. Schwartz · Communications on Pure and Applied Mathematics · 1980 · 84 citations

, , +8

Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions

Michael Breban, Alfredo Ferro, Eugenio G. Omodeo et al. · Communications on Pure and Applied Mathematics · 1981 · 39 citations

, , +15