On theories with a combinatorial definition of 'equivalence'
From MaRDI portal
Publication:2652528
DOI10.2307/1968867zbMath0060.12501OpenAlexW2323378191WikidataQ56019616 ScholiaQ56019616MaRDI QIDQ2652528
Publication date: 1942
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1968867
Related Items
Graph groups are biautomatic ⋮ Effective codescent morphisms in the varieties determined by convergent term rewriting systems. ⋮ Reductions in tree replacement systems ⋮ Operads from posets and Koszul duality ⋮ Pluriassociative algebras. II: The polydendriform operad and related operads. ⋮ Two families of Newman lattices ⋮ Algebraic simplification and cryptographic motives. ⋮ Synthesized and inherited functions. A new computational model for syntax-directed semantics ⋮ The problems of cyclic equality and conjugacy for finite complete rewriting systems ⋮ Buchberger's algorithm: The term rewriter's point of view ⋮ Termination of rewriting ⋮ Thue systems as rewriting systems ⋮ Diamond lemma for the group graded quasi-algebras ⋮ On deciding the confluence of a finite string-rewriting system on a given congruence class ⋮ History and basic features of the critical-pair/completion procedure ⋮ Word problems and a homological finiteness condition for monoids ⋮ Free products and the word problem ⋮ Explaining Gabriel-Zisman localization to the computer ⋮ Pseudo-natural algorithms for finitely generated presentations of monoids and groups ⋮ Unsolvable algorithmic problems for semigroups, groups and rings ⋮ On the sandpile group of regular trees ⋮ Higher-order subtyping and its decidability ⋮ Series parallel digraphs with loops ⋮ On reductions for the Steiner problem in graphs ⋮ Free products with amalgamation of monoids ⋮ Shirshov composition techniques in Lie superalgebras (noncommutative Gröbner bases) ⋮ Derived semidistributive lattices ⋮ Eliminating partially dead code in explicitly parallel programs ⋮ The mentor of Alan Turing: Max Newman (1897--1984) as a logician ⋮ Applications of normal forms for weighted Leavitt path algebras: simple rings and domains ⋮ A combinatorial proof of associativity of Ore extensions. ⋮ A calculational approach to mathematical induction ⋮ Enumeration of point-determining graphs ⋮ New decision algorithms for finitely presented commutative semigroups ⋮ Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets ⋮ Nambu-Lie 3-algebras on fuzzy 3-manifolds ⋮ Equational completion in order-sorted algebras ⋮ Decision problems for finite special string-rewriting systems that are confluent on some congruence class ⋮ NTS grammars and Church-Rosser systems ⋮ Testing for the Church-Rosser property ⋮ Thue congruences and the Church-Rosser property ⋮ Monadic Thue systems ⋮ Higher-dimensional normalisation strategies for acyclicity ⋮ Efficiency issues in the KBMAG procedure ⋮ A metamodel of access control for distributed environments: applications and properties ⋮ Composition-diamond lemma for associative conformal algebras. ⋮ Prime decomposition of three-dimensional manifolds into boundary connected sum ⋮ Linearity and iterator types for Gödel's system \(\mathcal T\) ⋮ Confluence and convergence modulo equivalence in probabilistically terminating reduction systems ⋮ Sheaves, localizations, and unstable extensions: Some counterexamples ⋮ On decidability of theories of finitely generated quasigroups in \(R\)- varieties of groups ⋮ Interval logics and their decision procedures. I: An interval logic ⋮ Intersection type assignment systems with higher-order algebraic rewriting ⋮ Transformations and confluence for rewrite systems ⋮ Natural termination ⋮ Checking overlaps of nominal rewriting rules ⋮ On proving confluence modulo equivalence for Constraint Handling Rules ⋮ Causal automata ⋮ Quasiautomorphism groups of type \(F_\infty\) ⋮ On weakly confluent monadic string-rewriting systems ⋮ Möbius functions and confluent semi-commutations ⋮ Categories generated by a trivalent vertex ⋮ Gödel's system \(\mathcal T\) revisited ⋮ Classical natural deduction for S4 modal logic ⋮ Importing logics ⋮ How to decide the lark ⋮ Distortion of the Poisson bracket by the noncommutative Planck constants ⋮ The correctness of Newman's typability algorithm and some of its extensions ⋮ Composition-diamond lemma for tensor product of free algebras. ⋮ Matching and alpha-equivalence check for nominal terms ⋮ Actions of picture groups on CAT(0) cubical complexes. ⋮ The diamond lemma for ring theory ⋮ Lambda-calculus with director strings ⋮ Presentations of inverse monoids ⋮ On reduction of asynchronous systems ⋮ De Bruijn's weak diamond property revisited ⋮ Decidability of elementary theories of certain finitely defined algebras ⋮ Gröbner-Shirshov basis for the braid group in the Birman-Ko-Lee generators. ⋮ On graph invariants given by linear recurrence relations ⋮ Diagram techniques for confluence ⋮ Asymmetric Abelian sandpile models ⋮ The generating power of total deterministic tree transducers ⋮ Enumeration of double cosets ⋮ Deciding embeddability of partial groupoids into semigroups ⋮ Investigations on autark assignments ⋮ Coherence and embedding of algebras ⋮ Finite complete rewriting systems and the complexity of word problem ⋮ On finitely presented and free algebras of Cantor varieties ⋮ \({\mathcal M}^\omega\) considered as a programming language ⋮ On free conformal and vertex algebras ⋮ Insertion languages ⋮ Descendants and origins in term rewriting. ⋮ Higher-order substitutions ⋮ Coherence for bicategories and indexed categories ⋮ Rewrite systems on a lattice of types ⋮ Efficient solution of the word problem in slim varieties ⋮ The order dimension of multinomial lattices ⋮ Rewriting systems of Coxeter groups ⋮ Hopf diagrams and quantum invariants ⋮ Confluence by decreasing diagrams ⋮ Rewriting modulo isotopies in pivotal linear \((2,2)\)-categories ⋮ Unnamed Item ⋮ Logical foundations for hybrid type-logical grammars ⋮ Coherent confluence modulo relations and double groupoids ⋮ Nominal rewriting ⋮ Generalized Gröbner bases: Theory and applications. A condensation ⋮ Decidability of confluence and termination of monadic term rewriting systems ⋮ On proving termination by innermost termination ⋮ Higher-order superposition for dependent types ⋮ Unique normal forms for nonlinear term rewriting systems: Root overlaps ⋮ Algebraic coherent confluence and higher globular Kleene algebras ⋮ Standard bases for the universal associative conformal envelopes of Kac-Moody conformal algebras ⋮ Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free ⋮ A new family of infinitely braided Thompson's groups ⋮ Doodles on surfaces ⋮ A note on thue systems with a single defining relation ⋮ Reduction operators and completion of rewriting systems ⋮ On Termination, Confluence and Consistent CHR-based Type Inference ⋮ Unranked second-order anti-unification ⋮ Low-dimensional (co)homology of free Burnside monoids ⋮ Strong convergence and the polygon property of 1-player games ⋮ Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping ⋮ The combinatorial degrees of proofs and equations ⋮ Principal specializations of Schubert polynomials and pattern containment ⋮ Capability-based localization of distributed and heterogeneous queries ⋮ Size-based termination of higher-order rewriting ⋮ Rewriting in higher dimensional linear categories and application to the affine oriented Brauer category ⋮ Dealing with explicit preferences and uncertainty in answer set programming ⋮ Non-size increasing graph rewriting for natural language processing ⋮ From diagrammatic confluence to modularity ⋮ Confluence Modulo Equivalence in Constraint Handling Rules ⋮ Nominal Matching and Alpha-Equivalence ⋮ Positive basis for surface skein algebras ⋮ An abstract Church-Rosser theorem. II: Applications ⋮ Coherent presentations of monoids with a right-Noetherian Garside family ⋮ Finite canonical rewriting systems for congruences generated by concurrency relations ⋮ Knot invariants with multiple skein relations ⋮ Skew metrics valued in Sugihara semigroups ⋮ Iterated elimination procedures ⋮ WORD EQUATIONS OVER GRAPH PRODUCTS ⋮ Linear-algebraic λ-calculus: higher-order, encodings, and confluence. ⋮ Confluence by Decreasing Diagrams ⋮ Unnamed Item ⋮ Connections between abelian sandpile models and the \(K\)-theory of weighted Leavitt path algebras ⋮ Church-Rosser systems with respect to formal languages ⋮ Rewriting modulo isotopies in Khovanov-Lauda-Rouquier's categorification of quantum groups ⋮ Decreasing diagrams with two labels are complete for confluence of countable systems ⋮ From Analytical Mechanics Problems to Rewriting Theory Through M. Janet’s Work ⋮ Noncommutative Gröbner Bases: Applications and Generalizations ⋮ Modularity of termination and confluence in combinations of rewrite systems with λω ⋮ Gröbner-Shirshov bases for some braid groups. ⋮ Factorization in call-by-name and call-by-value calculi via linear logic ⋮ Gröbner-Shirshov bases, conformal algebras, and pseudo-algebras. ⋮ Confluence theory for graphs ⋮ The word problem for one-relation monoids: a survey ⋮ A combinatorial approach to the structure of locally inverse semigroups ⋮ Conditions for a universal mapping of algebras to be a monomorphism ⋮ Rewriting in Varieties of Idempotent Semigroups ⋮ Diagrammatic confluence for Constraint Handling Rules ⋮ Coherence in monoidal track categories ⋮ Conjugacy and dynamics in Thompson's groups. ⋮ Finite complete rewriting systems for groups ⋮ Operads and Phylogenetic Trees ⋮ Embedding theorems for tree-free groups ⋮ The Whitney duals of a graded poset ⋮ Flow-firing processes ⋮ GRÖBNER-SHIRSHOV BASES FOR COXETER GROUPS ⋮ Optimal reduction in replacement systems ⋮ ON THE ZAPPA-SZÉP PRODUCT ⋮ Convergent presentations and polygraphic resolutions of associative algebras ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ Unnamed Item ⋮ Groebner-Shirshov basis of the universal enveloping Rota-Baxter algebra of a Lie algebra ⋮ Confluence up to garbage in graph transformation ⋮ Quotients of the Magmatic Operad: Lattice Structures and Convergent Rewrite Systems ⋮ A New Class of Generalized Thompson's Groups and Their Normal Subgroups ⋮ The conjugacy problem for symmetric Thompson-like groups ⋮ Confluence by critical pair analysis revisited ⋮ Completeness of combinations of constructor systems ⋮ Confluence in labeled chip-firing ⋮ Root system chip-firing. I: Interval-firing ⋮ The adjoint semigroup of a $\Gamma$-semigroup ⋮ Garside combinatorics for Thompson's monoid \(F^+\) and a hybrid with the braid monoid \(B_{\infty }^{+}\) ⋮ Combinatorial \(N_\infty\) operads ⋮ A property of Mal'cev's biquaternary variety ⋮ Factorization of homotopies of nanophrases ⋮ Estimating costs of multi-component enterprise applications ⋮ A note on special thue systems with a single defining relation ⋮ Confluence in probabilistic rewriting ⋮ Discrete Morse theory and graph braid groups. ⋮ Polygraphs of finite derivation type ⋮ On the finiteness property of hyperbolic simplicial actions: the right-angled Artin groups and their extension graphs ⋮ Non-finitely generated maximal subgroups of context-free monoids ⋮ Confluence problems for trace rewriting systems ⋮ A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser ⋮ Iterating transducers ⋮ The Power of Closed Reduction Strategies ⋮ From Hertzsprung's problem to pattern-rewriting systems ⋮ Applying rewriting methods to special monoids ⋮ Confluence up to Garbage ⋮ Over then under tangles ⋮ Regular semigroups weakly generated by idempotents ⋮ Shuffle polygraphic resolutions for operads ⋮ Word problem and parabolic subgroups in Dyer groups ⋮ Regular semigroups weakly generated by one element ⋮ Order independence for rationalizability ⋮ Classifying Levi-spherical Schubert varieties ⋮ Classification of Levi-spherical Schubert varieties ⋮ The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete ⋮ On universal conformal envelopes for quadratic Lie conformal algebras ⋮ Unnamed Item ⋮ Unnamed Item ⋮ MARKOV AND ARTIN NORMAL FORM THEOREM FOR BRAID GROUPS ⋮ AN EPISTEMIC RATIONALE FOR ORDER INDEPENDENCE ⋮ Normal form in Hecke-Kiselman monoids associated with simple oriented graphs ⋮ Gröbner–Shirshov basis and reduced words for affine Weyl group Ãn ⋮ Gröbner–Shirshov bases and their calculation ⋮ A new Composition-Diamond lemma for associative conformal algebras ⋮ Formal analysis of model transformations based on triple graph grammars ⋮ The algebra of strand splitting. I. A braided version of Thompson's group V ⋮ Markov and Artin Normal Form Theorem for Braid Groups∗ ⋮ A real-time interval logic and its decision procedure ⋮ Sorting via chip-firing ⋮ The center of thin Gaussian groups ⋮ Sorting via chip-firing ⋮ Invariant tensors for the spin representation of (7) ⋮ Unnamed Item ⋮ On pot, pans and pudding or how to discover generalised critical Pairs ⋮ LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE ⋮ Gröbner–Shirshov bases for commutative dialgebras ⋮ Some aspects of the SD-world ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Grassmann semialgebras and the Cayley-Hamilton theorem ⋮ A New Composition-Diamond Lemma for Dialgebras ⋮ On reduction and normalization in the computational core ⋮ A rewriting coherence theorem with applications in homotopy type theory
