scientific article; zbMATH DE number 4152340

zbMATH Open0703.03003MaRDI QIDQ3481672FDOQ3481672

Authors: Michail R. Tetruashvili 

Publication date: 1989

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

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

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)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• ON THE COMPUTING POWER OF PROGRAMS WITH SETS
• Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator
• Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages

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)