Pages that link to "Item:Q4884662"
From MaRDI portal
The following pages link to Techniques of computable set theory with applications to proof verification (Q4884662):
Displaying 6 items.
- The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations (Q737087) (← links)
- A tableau-based decision procedure for a fragment of set theory with iterated membership (Q812437) (← links)
- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership (Q2215960) (← links)
- A coinductive approach to computing with compact sets (Q2974666) (← links)
- A fast saturation strategy for set-theoretic tableaux (Q4610319) (← links)
- (Q5310200) (← links)