Undecidable properties of finite sets of equations

DOI10.2307/2272037zbMATH Open0375.02040OpenAlexW4246895997MaRDI QIDQ4154857FDOQ4154857

Authors: George F. McNulty 

Publication date: 1976

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272037

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Applications of computability and recursion theory (03D80)

Cited In (15)

• Title not available (Why is that?)
• Das Entscheidungsproblem der Klasse von Formeln, die höchstens zwei Primformeln enthalten
• The reverse spelling of an FPrt-universal word in two letters
• A field guide to equational logic
• Base-undecidable properties of universal varieties
• An easy test for congruence modularity
• Recursive undecidability of the binding property for finitely presented equational classes
• The combinatorial degrees of proofs and equations
• Covering in the lattice of equational theories and some properties of term finite theories
• Kleine unentscheidbare Klassen der Prädikatenlogik mit Identität und Funktionszeichen
• Structural diversity in the lattice of equational theories
• Thue trees
• When is a term point universal?
• Equations implying congruence \(n\)-permutability and semidistributivity.
• Congruence-distributive varieties of algebras

This page was built for publication: Undecidable properties of finite sets of equations

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