Pages that link to "Item:Q4168916"
From MaRDI portal
The following pages link to The ∀<sub><i>n</i></sub>∃‐Completeness of Zermelo‐Fraenkel Set Theory (Q4168916):
Displayed 7 items.
- The automation of syllogistic. I: Syllogistic normal forms (Q1111540) (← links)
- A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849) (← links)
- Truth In V for ∃*∀∀-Sentences is Decidable (Q3416111) (← links)
- A note on the decidability of mls extended with the powerset operator (Q3712309) (← links)
- Foundation versus induction in Kripke-Platek set theory (Q4254688) (← links)
- PRIMITIVE INDEPENDENCE RESULTS (Q4408482) (← links)
- The subset relation and 2‐stratified sentences in set theory and class theory (Q6096719) (← links)