A note on the Kolmogorov data complexity and nonuniform logical definitions (Q290271): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03C13 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03C80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03D15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q19 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q30 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6588318 / rank
 
Normal rank
Property / zbMATH Keywords
 
finite model theory
Property / zbMATH Keywords: finite model theory / rank
 
Normal rank
Property / zbMATH Keywords
 
descriptive complexity
Property / zbMATH Keywords: descriptive complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
Kolmogorov complexity
Property / zbMATH Keywords: Kolmogorov complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial problems
Property / zbMATH Keywords: combinatorial problems / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal lower bound on the number of variables for graph identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilities on finite models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hierarchy theorem for generalized quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Everywhere Equivalence of Logics in Finite Model Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kolmogorov expression complexity of logics / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00172-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040072426 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:07, 30 July 2024

scientific article
Language Label Description Also known as
English
A note on the Kolmogorov data complexity and nonuniform logical definitions
scientific article

    Statements

    A note on the Kolmogorov data complexity and nonuniform logical definitions (English)
    0 references
    0 references
    1 June 2016
    0 references
    finite model theory
    0 references
    descriptive complexity
    0 references
    Kolmogorov complexity
    0 references
    combinatorial problems
    0 references

    Identifiers

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