Complexity assessments for decidable fragments of Set Theory. III: A quadratic reduction of constraints over nested sets to Boolean formulae

Add code
Dec 09, 2021
Figure 1 for Complexity assessments for decidable fragments of Set Theory. III: A quadratic reduction of constraints over nested sets to Boolean formulae

Share this with someone who'll enjoy it:

View paper onarxiv icon

Share this with someone who'll enjoy it: