A note on the decidability of mls extended with the powerset operator

DOI10.1002/CPA.3160380403zbMath0586.03007OpenAlexW2047086208MaRDI QIDQ3712309

Alfredo Ferro

Publication date: 1985

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cpa.3160380403

zbMATH Keywords

unquantified theory of sets

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Axiomatics of classical set theory and its fragments (03E30)

Related Items (1)

The automation of syllogistic. I: Syllogistic normal forms

Cites Work

• The ∀_n∃‐Completeness of Zermelo‐Fraenkel Set Theory

This page was built for publication: A note on the decidability of mls extended with the powerset operator