scientific article; zbMATH DE number 4152340

MaRDI QIDQ3481672zbMATHFDO

Authors Michail R. Tetruashvili

Publication date 1989

zbMATH Keywords

powerset operatorunquantified set theory

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Axiomatics of classical set theory and its fragments (03E30)

Recommendations

• scientific article; zbMATH DE number 23190
• Publication:5749278
• scientific article; zbMATH DE number 845472
• Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator
• Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators

Cited in

(6)

• scientific article; zbMATH DE number 23190 (Why is no real title available?)
• ON THE COMPUTING POWER OF PROGRAMS WITH SETS
• scientific article; zbMATH DE number 845472 (Why is no real title available?)
• scientific article; zbMATH DE number 4012568 (Why is no real title available?)
• Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages
• Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator

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 Q3481672)