There are several decision problems for certain computation models with atoms that are decidable when atoms admit certain well quasi order (WQO), and undecidable otherwise. We recall the problems and formulate few questions related to WQOs.
Again, a question closely related to a characterization of standard atoms (not to be confused with standard alphabets:). The question is a refinement of a question posted in Automorphisms vs color-preserving automorphisms in Fraisse classes, which has been answered negatively (see the recent post The colored open question closed).
A question in my recent post Automorphisms vs color-preserving automorphisms in Fraisse classes has been answered negatively by Mikołaj. The counterexample Fraisse class is the age of the structure , the rational numbers with the ternary ‘cyclic order’ relation defined by:
I am about to reformulate the question slightly, in order to make refutation harder;)
Here is a question closely related to a characterization of standard atoms (not to be confused with standard alphabets:). It asks whether a bound on the number of automorphisms is equivalent to a bound on the numer of color-preserving automorphisms, in every Fraisse class of finite relational structures.
This post discusses equivalence of:
1. existence of the least supports
2. representation theorem