Pages that link to "Item:Q3768865"

The following pages link to Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory (Q3768865):

Displayed 4 items.

• The automation of syllogistic. I: Syllogistic normal forms (Q1111540) ‎ (← links)
• A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849) ‎ (← links)
• Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) ‎ (← links)
• Banishing Ultrafilters from Our Consciousness (Q3305324) ‎ (← links)