Pages that link to "Item:Q3984401"
From MaRDI portal
The following pages link to Expressing infinity without foundation (Q3984401):
Displayed 7 items.
- A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849) (← links)
- The decidability of the \(\forall ^*\exists\) class and the axiom of foundation (Q1409304) (← links)
- Decidability and completeness for open formulas of membership theories (Q1903592) (← links)
- Set-syllogistics meet combinatorics (Q2971068) (← links)
- The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability (Q3570158) (← links)
- Layered map reasoning (Q4923516) (← links)
- Goals and benchmarks for automated map reasoning (Q5927984) (← links)