Implicit definability and infinitary logic in finite model theory (Q4645216): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q58215765 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-60084-1_110 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2134463605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3204028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixpoint logics, relational machines, and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Moschovakis closure ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and complexity of relational queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitary logic and inductive definability over finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite rigid structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for first order expressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational queries computable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3830533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitary logics and 0-1 laws / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitary logic for computer science / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of fixed-point queries on binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative complexity of checking and evaluating / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:28, 17 July 2024

scientific article; zbMATH DE number 6999468
Language Label Description Also known as
English
Implicit definability and infinitary logic in finite model theory
scientific article; zbMATH DE number 6999468

    Statements

    Implicit definability and infinitary logic in finite model theory (English)
    0 references
    0 references
    0 references
    0 references
    10 January 2019
    0 references
    linear order
    0 references
    expressive power
    0 references
    relation symbol
    0 references
    relational query
    0 references
    implicit definition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references