The undecidability of the semi-unification problem
From MaRDI portal
Publication:1207950
DOI10.1006/INCO.1993.1003zbMATH Open0769.68059OpenAlexW1993695344WikidataQ61634982 ScholiaQ61634982MaRDI QIDQ1207950FDOQ1207950
Authors: Assaf Kfoury, Jerzy Tiuryn, Paweł Urzyczyn 
Publication date: 16 May 1993
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1993.1003
Recommendations
Symbolic computation and algebraic computation (68W30) Grammars and rewriting systems (68Q42) Undecidability and degrees of sets of sentences (03D35)
Cited In (34)
- Title not available (Why is that?)
- Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
- On the (un)decidability of a near-unanimity term
- The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types
- Contribution of Warsaw logicians to computational logic
- The role of polymorphism in the characterisation of complexity by soft types
- Constructive many-one reduction from the halting problem to semi-unification
- Title not available (Why is that?)
- The undecidability of the DA-unification problem
- An undecidable fragment of the theory of set constraints
- Undecidable hypotheses in Edward Nelson's internal set theory
- UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES
- Undecidability and intuitionistic incompleteness
- Some undecidability results concerning the property of preserving regularity
- Typability and type checking in System F are equivalent and undecidable
- Title not available (Why is that?)
- Extending the type checker of Standard ML by polymorphic recursion
- Semi-unification of two terms in Abelian groups
- The unification hierarchy is undecidable
- Existential Type Systems with No Types in Terms
- Thue trees
- Type inference with partial types
- On subsumption and semiunification in feature algebras
- On complexity of the anti-unification problem
- The undecidability of entailment and relevant implication
- Kalmár and Péter: Undecidability as a Consequence of Incompleteness
- Title not available (Why is that?)
- Iteration and coiteration schemes for higher-order and nested datatypes
- The undecidability of the unification and matching problem for canonical theories
- A note on a canonical theory with undecidable unification and matching problem
- The undecidability of simultaneous rigid E-unification
- Title not available (Why is that?)
- Fast algorithms for uniform semi-unification
- The undecidability of the definability of principal subcongruences
This page was built for publication: The undecidability of the semi-unification problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207950)
