The Ackermann encoding and its siblings
From MaRDI portal
Cites work
- A single-sorted theory of multisets
- An efficient algorithm for computing bisimulation equivalence
- Canonical form for graphs in quasipolynomial time: preliminary report
- Canonisation and Definability for Graphs of Bounded Rank Width
- Die Widerspruchsfreiheit der allgemeinen Mengenlehre.
- Enumeration of the adjunctive hierarchy of hereditarily finite sets
- Exponentials Reiterated
- Finality regained: A coalgebraic study of Scott-sets and multisets
- scientific article; zbMATH DE number 5898612 (Why is no real title available?)
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- scientific article; zbMATH DE number 193143 (Why is no real title available?)
- scientific article; zbMATH DE number 1337735 (Why is no real title available?)
- scientific article; zbMATH DE number 952378 (Why is no real title available?)
- Iterated exponentials
- Linear ordering on graphs, anti-founded sets and polynomial time computability
- Mapping Sets and Hypersets into Numbers
- Multiset theory
- On sets and graphs. Perspectives on logic and combinatorics
- On the Lambert \(w\) function
- Practical graph isomorphism. II.
- Proving termination with multiset orderings
- Set theory.
- Squeezing multisets into real numbers
- Three Partition Refinement Algorithms
- Über Abbildung von Mannigfaltigkeiten.
This page was built for publication: The Ackermann encoding and its siblings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6849514)