Syntacticness, cycle-syntacticness and shallow theories

DOI10.1006/inco.1994.1043zbMath0807.68062OpenAlexW2005822708MaRDI QIDQ1327397

Hubert Comon, Jean-Pierre Jouannaud, Marianne Haberstrau

Publication date: 1 March 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1994.1043

zbMATH Keywords

cycle-syntacticshallow theoriessyntactic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)

Related Items (16)

Uniqueness of Normal Forms for Shallow Term Rewrite Systems ⋮ Non-disjoint combined unification and closure by equational paramodulation ⋮ Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent ⋮ “Syntactic” AC-unification ⋮ The unification problem for confluent right-ground term rewriting systems. ⋮ Unification and Matching in Hierarchical Combinations of Syntactic Theories ⋮ Modular proof systems for partial functions with Evans equality ⋮ Computing knowledge in equational extensions of subterm convergent theories ⋮ Grid structures and undecidable constraint theories ⋮ Set constraints with intersection ⋮ Set constraints in some equational theories ⋮ Decidability and complexity analysis by basic paramodulation ⋮ Termination of narrowing revisited ⋮ Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols ⋮ Induction = I-axiomatization + first-order consistency. ⋮ Terminating non-disjoint combined unification

This page was built for publication: Syntacticness, cycle-syntacticness and shallow theories