"A Finite-Model-Theoretic View on Propositional Proof Complexity."

Erich Grädel et al. (2019)

> Home

Details and statistics

DOI: 10.23638/LMCS-15(1:4)2019

access: open

type: Journal Article

metadata version: 2020-06-18

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/lmcs/GradelGPP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/lmcs/GradelGPP19
Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa:
A Finite-Model-Theoretic View on Propositional Proof Complexity. Log. Methods Comput. Sci. 15(1) (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.