On the public citation graph
Some remarks on lengths of propositional proofs
0 signed · 62 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/rsa.3240070103openalex-snapshot
An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle
inferredcites →https://doi.org/10.1007/978-1-4612-2566-9_4openalex-snapshot
On Gödel’s Theorems on Lengths of Proofs II: Lower Bounds for Recognizing k Symbol Provability
inferredcites →https://doi.org/10.1007/bf01200117openalex-snapshot
Exponential lower bounds for the pigeonhole principle
inferredcites →https://doi.org/10.1016/0168-0072(89)90012-2openalex-snapshot
On the number of steps in proofs
inferredcites →https://doi.org/10.1016/0168-0072(91)90059-uopenalex-snapshot
The undecidability of k-provability
inferredcites →https://doi.org/10.1016/s0049-237x(09)70442-2openalex-snapshot
Complexity of Derivations from Quantifier-Free Horn Formulae, Mechanical Introduction of Explicit Definitions, and Refinement of Completeness Theorems
inferredcites →https://doi.org/10.1093/oso/9780198536901.003.0004openalex-snapshot
Number of Symbols in Frege Proofs with and without the Deduction Rule
inferredcites →https://doi.org/10.2307/2273702openalex-snapshot
The relative efficiency of propositional proof systems
inferredcites →https://doi.org/10.2307/2273826openalex-snapshot
Polynomial size proofs of the propositional pigeonhole principle
inferredcites →https://doi.org/10.2307/2274765openalex-snapshot
Propositional proof systems, the consistency of first order theories and the complexity of computations
inferredcites →https://doi.org/10.2307/2275228openalex-snapshot
The deduction rule and linear and near-linear proof simulations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1521-3870(200111)47:4<461::aid-malq461>3.0.co;2-bopenalex-snapshot
Monotone Proofs of the Pigeon Hole Principle
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_13openalex-snapshot
Monotone Proofs of the Pigeon Hole Principle
inferred← citeshttps://doi.org/10.1007/978-3-030-71430-7_17openalex-snapshot
Substitution and Propositional Proof Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_9openalex-snapshot
Some Definitorial Suggestions for Parameterized Proof Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_5openalex-snapshot
Propositional Proof Complexity an Introduction
inferred← citeshttps://doi.org/10.1007/bf01294258openalex-snapshot
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
inferred← citeshttps://doi.org/10.1007/bfb0028010openalex-snapshot
Linear lower bounds and simulations in frege systems with substitutions
inferred← citeshttps://doi.org/10.1007/bfb0055766openalex-snapshot
Minimum propositional proof length is NP-hard to linearly approximate
inferred← citeshttps://doi.org/10.1007/s00153-014-0398-3openalex-snapshot
Partially definable forcing and bounded arithmetic
inferred← citeshttps://doi.org/10.1007/s001530050078openalex-snapshot
The number of lines in Frege proofs with substitution
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00186-8openalex-snapshot
Tractability of Cut-free Gentzen-type propositional calculus with permutation inference II
inferred← citeshttps://doi.org/10.1017/9781108242066.006openalex-snapshot
Quantified Propositional Calculus
inferred← citeshttps://doi.org/10.1017/9781108242066.008openalex-snapshot
Algebraic and Geometric Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.010openalex-snapshot
Basic Example of the Correspondence between Theories and Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.011openalex-snapshot
The Two Worlds of Bounded Arithmetic
inferred← citeshttps://doi.org/10.1017/9781108242066.012openalex-snapshot
Up to EF via the 〈. . .〉 Translation
inferred← citeshttps://doi.org/10.1017/9781108242066.013openalex-snapshot
Examples of Upper Bounds and p-Simulations
inferred← citeshttps://doi.org/10.1017/9781108242066.014openalex-snapshot
Beyond EF via the || . . . || Translation
inferred← citeshttps://doi.org/10.1017/9781108242066.016openalex-snapshot
LKd+1/2 and Combinatorial Restrictions
inferred← citeshttps://doi.org/10.1017/9781108242066.017openalex-snapshot
Fd and Logical Restrictions
inferred← citeshttps://doi.org/10.1017/9781108242066.018openalex-snapshot
Algebraic and Geometric Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.019openalex-snapshot
Feasible Interpolation: A Framework
inferred← citeshttps://doi.org/10.1017/9781108242066.020openalex-snapshot
Feasible Interpolation: Applications
inferred← citeshttps://doi.org/10.1017/9781108242066.022openalex-snapshot
Model Theory and Lower Bounds
inferred← citeshttps://doi.org/10.1017/9781108242066.024openalex-snapshot
The Nature of Proof Complexity
inferred← citeshttps://doi.org/10.1017/s1079898600004807openalex-snapshot
2002 Annual Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzq052openalex-snapshot
Towards automated first-order abduction: the cut-based approach
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00052openalex-snapshot
Tradeoffs for small-depth Frege proofs
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00021openalex-snapshot
Proof Compression via Subatomic Logic and Guarded Substitutions
inferred← citeshttps://doi.org/10.11648/j.pamj.20130203.13openalex-snapshot
Refutation Of Hard-Determinable Formulas In The System “Resolution Over Linear Equations” And Its Generalization
inferred← citeshttps://doi.org/10.12691/ajmo-2-1-5openalex-snapshot
Polynomial Simulation and Refutation of Complex Formulas of Resolution over Linear Equations in Propositional Proof System
inferred← citeshttps://doi.org/10.2178/jsl/1190150028openalex-snapshot
The cost of a cycle is a square
inferred← citeshttps://doi.org/10.2307/2694916openalex-snapshot
Minimum propositional proof length is NP-hard to linearly approximate
inferred← citeshttps://doi.org/10.3233/fun-2007-791-205openalex-snapshot
A Propositional Proof System with Quantification Over Permutations
inferred← citeshttps://doi.org/10.48550/arxiv.1609.04218openalex-snapshot
The complexity of propositional proofs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.