An undecidable problem in finite combinatorics (Q3718693): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.2307/2274138 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013122733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Methods in Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost sure theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of finite relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity of partition functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620608 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:45, 17 June 2024

scientific article
Language Label Description Also known as
English
An undecidable problem in finite combinatorics
scientific article

    Statements

    An undecidable problem in finite combinatorics (English)
    0 references
    0 references
    0 references
    1984
    0 references
    0 references
    asymptotic probability of a sentence
    0 references
    undecidable set of sentences
    0 references
    finitely axiomatizable class
    0 references
    0 references