The most nonelementary theory
DOI10.1016/J.IC.2004.02.002zbMATH Open1064.03029OpenAlexW2129501349MaRDI QIDQ598194FDOQ598194
Authors: Sergei Vorobyov 
Publication date: 6 August 2004
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2004.02.002
Recommendations
- Nonelementary catastrophe theory
- An infinite element theory
- The most irrational rational theories
- Non-totally transcendental unidimensional theories
- scientific article
- scientific article; zbMATH DE number 3141949
- Strongly nonmultidimensional theories
- scientific article; zbMATH DE number 1302871
- scientific article; zbMATH DE number 896756
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Title not available (Why is that?)
- The typed lambda-calculus is not elementary recursive
- Title not available (Why is that?)
- The polynomial-time hierarchy
- Classifying the computational complexity of problems
- The computational complexity of logical theories
- A theory of prepositional types
- A uniform method for proving lower bounds on the computational complexity of logical theories
- Complexity results for classes of quantificational formulas
- A simple proof of a theorem of Statman
- On the expressive power of database queries with intermediate types
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the complexity of queries in the logical data model
Cited In (2)
This page was built for publication: The most nonelementary theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598194)
