Computing queries with higher-order logics (Q2369013): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q55954612, #quickstatements; #temporary_batch_1712260040974
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
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: Q3686043 / 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: Q3758820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressibility of Higher Order Logics / 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: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truth definitions in finite models / 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
Property / cites work
 
Property / cites work: On the expressibility and the computability of untyped queries / rank
 
Normal rank

Revision as of 12:13, 24 June 2024

scientific article
Language Label Description Also known as
English
Computing queries with higher-order logics
scientific article

    Statements

    Computing queries with higher-order logics (English)
    0 references
    0 references
    28 April 2006
    0 references
    Higher-order logics
    0 references
    Descriptive complexity
    0 references
    Complete languages
    0 references

    Identifiers