Digraph parameters and finite set arithmetic

DOI10.1002/MALQ.201400062MaRDI QIDQ2947232zbMATHOpenAlexFDO

Authors Laurence Kirby

Publication date 22 September 2015

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.201400062

zbMATH Keywords

digraphsset arithmeticHereditarily finite sets

Mathematics Subject Classification ID

Ordinal and cardinal numbers (03E10) Other classical set theory (including functions, relations, and set algebra) (03E20)

Recommendations

• Ordinal operations on graph representations of sets
• Addition and multiplication of sets
• Well-quasi-ordering hereditarily finite sets
• Ordinal exponentiations of sets
• A graphic generalization of arithmetic

Cites work

• scientific article; zbMATH DE number 1254478 (Why is no real title available?)
• A hierarchy of hereditarily finite sets
• Addition and multiplication of sets
• Counting extensional acyclic digraphs
• Die Widerspruchsfreiheit der allgemeinen Mengenlehre
• Finitary set theory
• Induction and foundation in the theory of hereditarily finite sets
• Ordinal exponentiations of sets
• Ordinal operations on graph representations of sets
• Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
• The Number of Full Sets with n Elements

Cited in

(5)

• Is hyper-extensionality preservable under deletions of graph elements?
• Set graphs. II. Complexity of set graph recognition and similar problems
• Bounded finite set theory
• Well-quasi-ordering hereditarily finite sets
• Ordinal operations on graph representations of sets

This page was built for publication: Digraph parameters and finite set arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947232)