AEtnaNova
From MaRDI portal
Cited in
(10)- Applicable mathematics in a minimal computational theory of sets
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate
- Set graphs. IV. Further connections with claw-freeness
- Set graphs. II. Complexity of set graph recognition and similar problems
- Referee
- Computational logic and set theory. Applying formalized logic to analysis. Foreword by Martin Davis
- Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
- SETL
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
This page was built for software: AEtnaNova
