Ordering by Divisibility in Abstract Algebras

Cited in

(only showing first 100 items - show all)

Characterization of ordered semigroups generating well quasi-orders of words
SMT-based verification of data-aware processes: a model-theoretic approach
Quasi finitely axiomatizable totally categorical theories
Games with unawareness
Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
Noetherianity and Specht problem for varieties of bicommutative algebras
Packing topological minors half‐integrally
What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
Inner palindromic closure
Strong WQO Tree Theorems
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
Another generalization of Higman's well quasi order result on ^*
The algebra of \(2 \times 2\) upper triangular matrices as a commutative algebra: gradings, graded polynomial identities and Specht property
Nilpotency and the Hamiltonian property for cancellative residuated lattices
scientific article; zbMATH DE number 7379291 (Why is no real title available?)
Ideals of identities of representations of nilpotent lie algebras
Path homomorphisms
On well-quasi-ordering finite sequences
Rational Hilbert series of relatively free Jordan algebras
On well quasiordering of finite languages
The maximal linear extension theorem in second order arithmetic
On Shuffle Ideals
T-spaces in associative algebras.
A general version of standard basis and its application to T-ideals.
A well-ordering of dual braid monoids.
Specht property for the graded identities of the pair \((M_2 (D), sl_2 (D))\)
A counterexample regarding labelled well-quasi-ordering
Specht property for some varieties of Jordan algebras of almost polynomial growth
Proof pearl: a formal proof of Higman's lemma in ACL2
Cost Automata, Safe Schemes, and Downward Closures
On the regularity of languages on a binary alphabet generated by copying systems
Well Quasi-orders in Formal Language Theory
Well-quasi-ordering and the Hausdorff quasi-uniformity
Subword conditions and subword histories
Well-quasi-ordering versus clique-width: new results on bigenic classes
Higher Lawrence configurations.
Forward analysis for WSTS, part I: completions
On quasi orders of words and the confluence property
On well quasi orders of free monoids
Unavoidable languages, cuts and innocent sets of words
Forbidden substructures and combinatorial dichotomies: WQO and universality
Unsplittable classes of separable permutations
Branch-well-structured transition systems and extensions
Well-quasi-ordering versus clique-width: new results on bigenic classes
Invariant chains in algebra and discrete geometry
Factorization under local finiteness conditions
Partial well‐ordering of sets of vectors
Well quasi-orders and regular languages
Branch-well-structured transition systems and extensions
Stochastic Games with Lossy Channels
Homomorphic image orders on combinatorial structures.
On well quasi-order of graph classes under homomorphic image orderings
Weak polynomial identities and their applications
Identities for the special linear Lie algebra with the Pauli and Cartan gradings
Varieties of Commutative Semigroups
Varieties
Labelled induced subgraphs and well-quasi-ordering
Equimorphy: the case of chains
Generalized fusible numbers and their ordinals
A characterization of well-founded algebraic lattices
Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
Injective envelopes of transition systems and Ferrers languages
Well-structured graph transformation systems
Nested Petri Nets for Adaptive Process Modeling
Simple permutations: Decidability and unavoidable substructures
The wellordering on positive braids
From monomials to words to graphs.
On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
Finite Gröbner bases in infinite dimensional polynomial rings and applications
Well-quasi-order for permutation graphs omitting a path and a clique
Specht property for the algebra of upper triangular matrices of size two with a Taft’s algebra action
On Von Neumann Regular Rings of Skew Generalized Power Series
Gröbner methods for representations of combinatorial categories
Polynomial identities for the Jordan algebra of \(2 \times 2\) upper triangular matrices
An infinite antichain of planar tanglegrams
A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies
Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
Labelled well-quasi-order for permutation classes
Well-quasi-order of relabel functions
Well, better and in-between
Definability in the structure of words with the inclusion relation
Well-structured transition systems everywhere!
On square-increasing ordered monoids and idempotent semirings
Termination of rewriting
Sur les premeilleurs ordres. (On prémeilleurs orderings)
Minimal universal and dense minor closed classes
Basic formulas and languages. I: The theory
Basic formulas and languages. II: Applications to EOL systems and forms
Well quasi-orders and context-free grammars
An Algebraic Characterization of Strictly Piecewise Languages
On Better-Quasi-Ordering Countable Series-Parallel Orders
On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
Decidability of weak fairness in Petri nets
Graded polynomial identities and Specht property of the Lie algebra \(sl_2\)
On regularity of context-free languages
Recent progress on well-quasi-ordering graphs
Reduction and covering of infinite reachability trees
A few characterizations of topological spaces with no infinite discrete subspace
On codes defined by bio-operations
Well quasi-orders generated by a word-shuffle rewriting

This page was built for publication: Ordering by Divisibility in Abstract Algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5812263)