scientific article; zbMATH DE number 4116495

zbMATH Open0682.03005MaRDI QIDQ4731166

Alberto Policriti

Publication date: 1987

Title of this publication is not available (Why is that?)

zbMATH Keywords

axiom of foundationcomplete class of formulasdecidability of classes of formulas in set theory

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Set theory (03E99)

Related Items (8)

Decidability results for sets with atoms ⋮ Title not available (Why is that?) ⋮ Undecidability results for restricted universally quantified formulae of set theory ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ A remark concerning decidability of complete theories ⋮ Completeness issues in RUE-NRF deduction: The undecidability of viability ⋮ Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4731166)