On theories with a combinatorial definition of 'equivalence'

DOI10.2307/1968867zbMath0060.12501OpenAlexW2323378191WikidataQ56019616 ScholiaQ56019616MaRDI QIDQ2652528

M. H. A. Newman

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

zbMATH Keywords

set theory

Related Items (only showing first 100 items - show all)

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

This page was built for publication: On theories with a combinatorial definition of 'equivalence'