The Computational Complexity of Quantified Reciprocals (Q3623832): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/978-3-642-00665-4_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2149670146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized quantifiers and natural language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4328560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Henkin quantifiers and complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of the semantics of some natural language constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4332930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metafinite model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary quantifiers on finite models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability of polyadic lifts of generalized quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744910 / rank
 
Normal rank

Latest revision as of 12:50, 1 July 2024

scientific article
Language Label Description Also known as
English
The Computational Complexity of Quantified Reciprocals
scientific article

    Statements

    The Computational Complexity of Quantified Reciprocals (English)
    0 references
    0 references
    24 April 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    reciprocal expressions
    0 references
    computational complexity
    0 references
    generalized quantifiers
    0 references
    Strong Meaning Hypothesis
    0 references
    0 references