scientific article
From MaRDI portal
Publication:3691785
zbMath0573.06002MaRDI QIDQ3691785
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Ideal Abstractions for Well-Structured Transition Systems ⋮ Reverse mathematical bounds for the termination theorem ⋮ On well quasiordering of finite languages ⋮ Semilattice modes. I: The associated semiring ⋮ The Wadge hierarchy on Zariski topologies ⋮ Une extension d'un théorème de P. Jullien sur les âges de mots ⋮ A proof of the tree alternative conjecture under the topological minor relation ⋮ Fixed points and Noetherian topologies ⋮ The length of an intersection ⋮ Meta-expansion of transseries ⋮ On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders ⋮ A Combinatorial Bound for a Restricted Form of the Termination Theorem ⋮ Well quasi orders in a categorical setting ⋮ The complexity of querying indefinite data about linearly ordered domains ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ From wqo to bqo, via Ellentuck's theorem ⋮ Decidability and complexity of Petri nets with unordered data ⋮ Constantive Mal’cev clones on finite sets are finitely related ⋮ Foundations of BQO Theory ⋮ An infinite natural product ⋮ On Better-Quasi-Ordering Countable Series-Parallel Orders ⋮ Perfect failure detection with very few bits ⋮ Classification problems in continuum theory ⋮ On Scott's thesis for domains of information and well-quasi-orderings ⋮ A syntactic approach to the MacNeille completion of \(\Lambda^\ast\), the free monoid over an ordered alphabet \(\Lambda\) ⋮ Well-quasi-ordering and the Hausdorff quasi-uniformity ⋮ On the Expressiveness of Mobile Synchronizing Petri Nets ⋮ A note on well quasi-orderings for powersets ⋮ Finitely generated equational classes
This page was built for publication:
