A finite-model-theoretic view on propositional proof complexity (Q4625692)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7029303
Language Label Description Also known as
default for all languages
No label defined
    English
    A finite-model-theoretic view on propositional proof complexity
    scientific article; zbMATH DE number 7029303

      Statements

      0 references
      0 references
      0 references
      0 references
      25 February 2019
      0 references
      propositional proof systems
      0 references
      fixed-points logics
      0 references
      resolution
      0 references
      polynomial calculus
      0 references
      generalised quantifiers
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references