A note on well quasi-orderings for powersets
| dc.contributor.author | Jančar, Petr | |
| dc.date.accessioned | 2007-08-01T13:05:26Z | |
| dc.date.available | 2007-08-01T13:05:26Z | |
| dc.date.issued | 1999 | |
| dc.description.abstract-en | This note characterizes those quasi-orderings (A, less than or equal to) for which (P(A), subset of or equal to) are well quasi-orderings, where B-1 subset of or equal to B-2 iff (For All y is an element of B-2)(There Exists x is an element of B-1): x less than or equal to y (for B-1, B-2 subset of or equal to A). It turns out that they are those which do not contain the “Rado structure”, hence are ω2-well quasi-orderings in other words. A motivation for the question has come from the area of verification of infinite-state systems, where the usefulness of well quasi-orderings has already been recognized. This note suggests that finer notions might be useful as well. In particular, ω2-well quasi-orderings illuminate a specific problem related to termination of a reachability algorithm, which has been touched on by Abdulla and Jonsson. | en |
| dc.identifier.citation | Information Processing Letters. 1999, vol. 72, issues 5-6, p. 155-160. | en |
| dc.identifier.doi | 10.1016/S0020-0190(99)00149-0 | |
| dc.identifier.issn | 0020-0190 | |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.identifier.uri | http://hdl.handle.net/10084/61344 | |
| dc.identifier.wos | 000084880400002 | |
| dc.language.iso | en | en |
| dc.publisher | Elsevier | en |
| dc.relation.ispartofseries | Information Processing Letters | en |
| dc.relation.uri | https://doi.org/10.1016/S0020-0190(99)00149-0 | en |
| dc.subject | theory of computation | en |
| dc.subject | well quasi-orderings | en |
| dc.subject | powersets | en |
| dc.title | A note on well quasi-orderings for powersets | en |
| dc.type | article | en |