scientific article; zbMATH DE number 845472

zbMath0852.03016MaRDI QIDQ4865517

Michail R. Tetruashvili

Publication date: 26 February 1996

Full work available at URL: https://eudml.org/doc/47540

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexitydecidabilityquantifier-free set theory

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Unnamed Item
• 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. I. Multi-level syllogistic and some extensions

This page was built for publication: