Mechanizing \(\omega\)-order type theory through unification (Q1239309): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Resolution in type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5677084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness in the theory of types / 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 \(\overline\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5598318 / 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: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5614672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537599 / rank
 
Normal rank

Latest revision as of 21:44, 12 June 2024

scientific article
Language Label Description Also known as
English
Mechanizing \(\omega\)-order type theory through unification
scientific article

    Statements