swMATH6360MaRDI QIDQ18486FDOQ18486
Author name not available (Why is that?)
Official website: http://link.springer.com/chapter/10.1007/11829263_7
Cited In (10)
- Set graphs. IV. Further connections with claw-freeness
- Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate
- Computational logic and set theory. Applying formalized logic to analysis. Foreword by Martin Davis
- Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
- Set graphs. II. Complexity of set graph recognition and similar problems
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- Referee
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
- SETL
- Applicable mathematics in a minimal computational theory of sets
This page was built for software: AEtnaNova
