Exponential lower bounds on definable fixed points
From MaRDI portal
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- A new proof of the fixed-point theorem of provability logic
- An n! lower bound on formula size
- An effective fixed-point theorem in intuitionistic diagonalizable algebras. (The algebraization of the theories which express Theor. IX.)
- Applications of matrix methods to the theory of lower bounds in computational complexity
- Characters and fixed points in provability logic
- Expressivity and succinctness of order-invariant logics on depth-bounded structures
- scientific article; zbMATH DE number 2184446 (Why is no real title available?)
- scientific article; zbMATH DE number 1003731 (Why is no real title available?)
- scientific article; zbMATH DE number 1170091 (Why is no real title available?)
- scientific article; zbMATH DE number 3085803 (Why is no real title available?)
- Infinitary combinatorics and modal logic
- Modal characterisation theorems over special classes of frames
- Provability interpretations of modal logic
- Some modal aspects of XPath
- The fixed-point theorem for diagonalizable algebras. (The algebraization of the theories which express Theor. III.)
- The succinctness of first-order logic on linear orders
- The Succinctness of First-order Logic over Modal Logic via a Formula Size Game
- The uniqueness of the fixed-point in every diagonalizable algebra. (The algebraization of the theories which express Theor. VIII.)
- The universal tangle for spatial reasoning
This page was built for publication: Exponential lower bounds on definable fixed points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7261433)
