Pages that link to "Item:Q3570158"
From MaRDI portal
The following pages link to The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability (Q3570158):
Displaying 5 items.
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions (Q477206) (← links)
- Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate (Q2252530) (← links)
- The Bernays-Schönfinkel-Ramsey class for set theory: decidability (Q2915897) (← links)
- Set-syllogistics meet combinatorics (Q2971068) (← links)
