Pages that link to "Item:Q2652528"

The following pages link to On theories with a combinatorial definition of 'equivalence' (Q2652528):

Displaying 50 items.

• Effective codescent morphisms in the varieties determined by convergent term rewriting systems. (Q278228) (← links)
• Operads from posets and Koszul duality (Q281925) (← links)
• Pluriassociative algebras. II: The polydendriform operad and related operads. (Q285913) (← links)
• Algebraic simplification and cryptographic motives. (Q291221) (← links)
• Diamond lemma for the group graded quasi-algebras (Q321223) (← links)
• Series parallel digraphs with loops (Q372966) (← links)
• The mentor of Alan Turing: Max Newman (1897--1984) as a logician (Q384416) (← links)
• A combinatorial proof of associativity of Ore extensions. (Q394213) (← links)
• Nambu-Lie 3-algebras on fuzzy 3-manifolds (Q440532) (← links)
• Higher-dimensional normalisation strategies for acyclicity (Q456807) (← links)
• A metamodel of access control for distributed environments: applications and properties (Q462495) (← links)
• Prime decomposition of three-dimensional manifolds into boundary connected sum (Q469954) (← links)
• On proving confluence modulo equivalence for Constraint Handling Rules (Q511019) (← links)
• Categories generated by a trivalent vertex (Q522650) (← links)
• Distortion of the Poisson bracket by the noncommutative Planck constants (Q543357) (← links)
• The correctness of Newman's typability algorithm and some of its extensions (Q549191) (← links)
• Presentations of inverse monoids (Q582399) (← links)
• Higher-order subtyping and its decidability (Q598199) (← links)
• Derived semidistributive lattices (Q607453) (← links)
• Enumeration of point-determining graphs (Q618313) (← links)
• Efficiency issues in the KBMAG procedure (Q649584) (← links)
• Linearity and iterator types for Gödel's system \(\mathcal T\) (Q656851) (← links)
• Interval logics and their decision procedures. I: An interval logic (Q671639) (← links)
• Intersection type assignment systems with higher-order algebraic rewriting (Q672048) (← links)
• Transformations and confluence for rewrite systems (Q672232) (← links)
• Natural termination (Q673622) (← links)
• On weakly confluent monadic string-rewriting systems (Q685433) (← links)
• Möbius functions and confluent semi-commutations (Q685454) (← links)
• Importing logics (Q694499) (← links)
• De Bruijn's weak diamond property revisited (Q740482) (← links)
• Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
• Insertion languages (Q796994) (← links)
• Hopf diagrams and quantum invariants (Q813183) (← links)
• Explaining Gabriel-Zisman localization to the computer (Q861700) (← links)
• On the sandpile group of regular trees (Q872040) (← links)
• On reductions for the Steiner problem in graphs (Q876697) (← links)
• Equational completion in order-sorted algebras (Q912606) (← links)
• Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
• Gödel's system \(\mathcal T\) revisited (Q960861) (← links)
• Composition-diamond lemma for tensor product of free algebras. (Q974391) (← links)
• Matching and alpha-equivalence check for nominal terms (Q980937) (← links)
• Gröbner-Shirshov basis for the braid group in the Birman-Ko-Lee generators. (Q1012560) (← links)
• Coherence for bicategories and indexed categories (Q1059704) (← links)
• Rewrite systems on a lattice of types (Q1064065) (← links)
• Reductions in tree replacement systems (Q1082092) (← links)
• The problems of cyclic equality and conjugacy for finite complete rewriting systems (Q1089798) (← links)
• Termination of rewriting (Q1098624) (← links)
• Thue systems as rewriting systems (Q1099642) (← links)
• On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
• History and basic features of the critical-pair/completion procedure (Q1103414) (← links)