The quantifier complexity of polynomial-size iterated definitions in first-order logic (Q3066290): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Samuel R. Buss / rank
Normal rank
 
Property / author
 
Property / author: Samuel R. Buss / 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.1002/malq.200910111 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2144615401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of logical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:48, 3 July 2024

scientific article
Language Label Description Also known as
English
The quantifier complexity of polynomial-size iterated definitions in first-order logic
scientific article

    Statements

    The quantifier complexity of polynomial-size iterated definitions in first-order logic (English)
    0 references
    0 references
    0 references
    10 January 2011
    0 references
    iterated definition
    0 references
    recursive definition
    0 references
    quantifier complexity
    0 references
    finite quantifier
    0 references

    Identifiers