Sciweavers

218 search results - page 6 / 44
» Finite Trees as Ordinals
Sort
View
CIE
2006
Springer
15 years 1 months ago
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests
Abstract. We prove that the homomorphic quasiorder of finite k-labeled forests has undecidable elementary theory for k 3, in contrast to the known decidability result for k = 2. W...
Oleg V. Kudinov, Victor L. Selivanov
JSYML
2008
105views more  JSYML 2008»
14 years 9 months ago
Finite state automata and monadic definability of singular cardinals
We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formu...
Itay Neeman
RSA
2010
106views more  RSA 2010»
14 years 4 months ago
Thermodynamic limit for large random trees
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighb...
Yuri Bakhtin
COMBINATORICA
2004
127views more  COMBINATORICA 2004»
14 years 9 months ago
On Infinite Cycles I
We extend the basic theory concerning the cycle space of a finite graph to infinite locally finite graphs, using as infinite cycles the homeomorphic images of the unit circle in t...
Reinhard Diestel, Daniela Kühn
ICDM
2010
IEEE
132views Data Mining» more  ICDM 2010»
14 years 7 months ago
Monotone Relabeling in Ordinal Classification
In many applications of data mining we know beforehand that the response variable should be increasing (or decreasing) in the attributes. Such relations between response and attrib...
Ad Feelders