The following pages link to AEtnaNova (Q18486):
Displaying 8 items.
- Set graphs. IV. Further connections with claw-freeness (Q400530) (← links)
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions (Q477206) (← links)
- Set graphs. I. Hereditarily finite sets and extensional acyclic orientations (Q1941395) (← links)
- Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate (Q2252530) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
- Applicable Mathematics in a Minimal Computational Theory of Sets (Q4553281) (← links)
- Computational Logic and Set Theory (Q5198513) (← links)
