Logical Closure Properties of Propositional Proof Systems

Abstract

In this paper we define and investigate basic logical closure properties of propositional proof systems such as closure of arbitrary proof systems under modus ponens or substitutions. As our main result we obtain a purely logical characterization of the degrees of schematic extensions of EF in terms of a simple combination of these properties. This result… (More)
DOI: 10.1007/978-3-540-79228-4_28

Topics

  • Presentations referencing similar topics