Ordering by Divisibility in Abstract Algebras
From MaRDI portal
Publication:5812263
DOI10.1112/PLMS/S3-2.1.326zbMATH Open0047.03402OpenAlexW2076508310WikidataQ29012533 ScholiaQ29012533MaRDI QIDQ5812263FDOQ5812263
Authors: Graham Higman
Publication date: 1952
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-2.1.326
Cited In (only showing first 100 items - show all)
- Stream/block ciphers, difference equations and algebraic attacks
- Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
- Well quasi-orders, unavoidable sets, and derivation systems
- Cayley's and Holland's theorems for idempotent semirings and their applications to residuated lattices
- Well-quasi-ordering \(H\)-contraction-free graphs
- When excluding one matroid prevents infinite antichains
- Wohlquasigeordnete Klassen endlicher Graphen
- The complexity of finding SUBSEQ\((A)\)
- All normal extensions of S5-squared are finitely axiomatizable
- A note on partially ordered tree automata
- Graph minors and parameterized algorithm design
- On upper and lower bounds on the length of alternating towers
- Noetherianity and Specht problem for varieties of bicommutative algebras
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
- On Shuffle Ideals
- A general version of standard basis and its application to T-ideals.
- Subword conditions and subword histories
- Varieties
- Recent progress on well-quasi-ordering graphs
- Laver's results and low-dimensional topology
- On codes defined by bio-operations
- Well quasi-orders generated by a word-shuffle rewriting
- Linearizing well quasi-orders and bounding the length of bad sequences
- Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
- Ensuring completeness of symbolic verification methods for infinite-state systems
- A general finite basis condition for systems of semigroup identities
- Varieties of modular \(p\)-algebras not containing \(M_{3,3}\)
- Images of rigid digraphs
- Automating the Knuth Bendix ordering
- On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems
- When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P.J. Cameron
- Model checking parameterized systems
- Petri nets and regular processes
- On the computational power of BlenX
- A note on division orderings on strings
- On the Specht property and the basic rank of some products of group varieties
- Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
- Model checking of systems with many identical timed processes
- Graphs without \(K_ 4\) and well-quasi-ordering
- Partitionseigenschaft von endlichen Folgen
- A regularity test for dual bordered OS systems
- The length of chains in modular algebraic lattices
- Combinatorial properties of regressive mappings
- Commutative one-counter languages are regular
- On better quasi-ordering countable trees
- Well quasi-ordered sets and ideals in free semigroups and algebras
- Combinatorial theorems on contractive mappings in power sets
- Une généralisation des théorèmes de Higman et de Simon aux mots infinis
- The finite antichain property in Coxeter groups.
- Gröbner bases and gradings for partial difference ideals
- On Specht varieties of right alternative algebras
- Noncommutative invariants of reductive groups
- Finiteness spaces and generalized power series
- The Dyck pattern poset
- Extended letterplace correspondence for nongraded noncommutative ideals and related algorithms.
- Combinatorial generators of the multilinear polynomial identities.
- On the finite embeddability property for residuated ordered groupoids
- The theory of well-quasi-ordering: a frequently discovered concept
- Geometric grid classes of permutations
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Noetherian rings of generalized power series
- Two forbidden induced subgraphs and well-quasi-ordering
- A well-quasi-order for tournaments
- On the number of finite algebraic structures
- Shuffle on trajectories: Syntactic constraints
- On total regulators generated by derivation relations
- Deciding safety properties in infinite-state pi-calculus via behavioural types
- Better quasi-orders for uncountable cardinals
- A basic parameterized complexity primer
- Rao's degree sequence conjecture
- Partial orders on words, minimal elements of regular languages, and state complexity
- Quasi finitely axiomatizable totally categorical theories
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- The maximal linear extension theorem in second order arithmetic
- A well-ordering of dual braid monoids.
- Unavoidable languages, cuts and innocent sets of words
- Partial well‐ordering of sets of vectors
- Proof pearl: a formal proof of Higman's lemma in ACL2
- Well-quasi-ordering and the Hausdorff quasi-uniformity
- Stochastic Games with Lossy Channels
- Higher Lawrence configurations.
- Forbidden substructures and combinatorial dichotomies: WQO and universality
- Varieties of Commutative Semigroups
- Simple permutations: Decidability and unavoidable substructures
- On Von Neumann Regular Rings of Skew Generalized Power Series
- The wellordering on positive braids
- Gröbner methods for representations of combinatorial categories
- Finite Gröbner bases in infinite dimensional polynomial rings and applications
- Labelled well-quasi-order for permutation classes
- Well-structured transition systems everywhere!
- On Better-Quasi-Ordering Countable Series-Parallel Orders
- Sur les premeilleurs ordres. (On prémeilleurs orderings)
- Termination of rewriting
- On regularity of context-free languages
- Title not available (Why is that?)
- Reduction and covering of infinite reachability trees
- The computational power of population protocols
- Noetherian Generalized Power Series Rings
- Construction of fuzzy automata from fuzzy regular expressions
- The size of Higman-Haines sets
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)