Digraph parameters and finite set arithmetic

DOI10.1002/MALQ.201400062zbMATH Open1371.03059OpenAlexW2096202726MaRDI QIDQ2947232FDOQ2947232

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

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

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)

Cites Work

• Addition and multiplication of sets
• Counting extensional acyclic digraphs
• The Number of Full Sets with n Elements
• Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
• A hierarchy of hereditarily finite sets
• Ordinal exponentiations of sets
• Die Widerspruchsfreiheit der allgemeinen Mengenlehre
• Finitary set theory
• Induction and foundation in the theory of hereditarily finite sets
• Title not available (Why is that?)
• Ordinal operations on graph representations of sets

Cited In (5)

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

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)