Expressibility of Higher Order Logics (Q4924534): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4321931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable queries for relational data bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metafinite model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive power of database queries with intermediate types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressibility of Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive characterizations of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank

Revision as of 12:34, 6 July 2024

scientific article; zbMATH DE number 6171449
Language Label Description Also known as
English
Expressibility of Higher Order Logics
scientific article; zbMATH DE number 6171449

    Statements

    Identifiers