34 search results - page 2 / 7 » Substitutions into propositional tautologies |
CSL
2000
Springer
13 years 9 months ago
2000
Springer
In the ambient logic of classical second order propositional calculus, we solve the specification problem for a family of excluded middle like tautologies. These are shown to be r...
TYPES
2007
Springer
13 years 11 months ago
2007
Springer
We consider propositional formulas built on implication. The size of a formula is the number of occurrences of variables in it. We assume that two formulas which differ only in th...
APAL
2008
13 years 5 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
ECCC
2010
13 years 3 months ago
2010
We initiate the study of the proof complexity of propositional encoding of (weak cases of) concrete independence results. In particular we study the proof complexity of Paris-Harr...
CSL
2004
Springer
13 years 10 months ago
2004
Springer
We present a novel third-order theory W1 1 of bounded arithmetic suitable for reasoning about PSPACE functions. This theory has the advantages of avoiding the smash function symbol...