Decidability of the unification problem for second-order languages with unary functional symbols (Q3885741): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of unification in third order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unification algorithm for typed \(\bar\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complete Mechanization of Second-Order Type Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing \(\omega\)-order type theory through unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5677084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP / rank
 
Normal rank

Latest revision as of 09:14, 13 June 2024

scientific article
Language Label Description Also known as
English
Decidability of the unification problem for second-order languages with unary functional symbols
scientific article

    Statements

    Decidability of the unification problem for second-order languages with unary functional symbols (English)
    0 references
    0 references
    0 references
    1979
    0 references
    unification problem
    0 references
    second-order languages
    0 references

    Identifiers