A Finite-Model-Theoretic View on Propositional Proof Complexity

02/26/2018
by   Erich Grädel, et al.
0

We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the polynomial calculus of bounded degree, can be characterised in a precise sense by variants of fixed-point logics that are of fundamental importance in descriptive complexity theory. Our main results are that Horn resolution has the same expressive power as least fixed-point logic, that bounded-width resolution captures existential least fixed-point logic, and that the polynomial calculus with bounded degree over the rationals solves precisely the problems definable in fixed-point logic with counting. By exploring these connections further, we establish finite-model-theoretic tools for proving lower bounds for the polynomial calculus over the rationals and over finite fields.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/05/2018

Fixed-point elimination in the Intuitionistic Propositional Calculus (extended version)

It is a consequence of existing literature that least and greatest fixed...
research
07/14/2020

Nonclassical truth with classical strength. A proof-theoretic analysis of compositional truth over HYPE

Questions concerning the proof-theoretic strength of classical versus no...
research
11/20/2017

Proof Complexity Meets Algebra

We analyse how the standard reductions between constraint satisfaction p...
research
04/24/2023

Pseudorandom Finite Models

We study pseudorandomness and pseudorandom generators from the perspecti...
research
02/17/2021

Predicative Aspects of Order Theory in Univalent Foundations

We investigate predicative aspects of order theory in constructive univa...
research
02/27/2013

An Alternative Proof Method for Possibilistic Logic and its Application to Terminological Logics

Possibilistic logic, an extension of first-order logic, deals with uncer...

Please sign up or login with your details

Forgot password? Click here to reset