218 search results - page 9 / 44 » Finite Trees as Ordinals |
JCT
2006
14 years 9 months ago
2006
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
SIAMCOMP
2000
14 years 9 months ago
2000
The main result is a finite-state version of the Kraft
CG
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
MLQ
2000
14 years 9 months ago
2000
In Zermelo-Fraenkel set theory with the axiom of choice every set has the same cardinal number as some ordinal. Von Rimscha has weakened this condition to "Every set has the s...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...