On the public citation graph
A lower bound for the complexity of Craig's interpolants in sentential logic
0 signed · 53 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.1007/bf00265223openalex-snapshot
The network complexity and the Turing machine complexity of finite functions
inferredcites →https://doi.org/10.1007/bf02318027openalex-snapshot
Interpolation, compactness and JEP in soft model theory
inferredcites →https://doi.org/10.1007/bf02721331openalex-snapshot
Irreversibility, uncertainty, relativity and computer limitations
inferredcites →https://doi.org/10.1016/0001-8708(76)90167-5openalex-snapshot
The complexity of explicit definitions
inferredcites →https://doi.org/10.1016/0003-4843(82)90021-3openalex-snapshot
Compactness, interpolation and Friedman's third problem
inferredcites →https://doi.org/10.1016/0378-4754(79)90115-0openalex-snapshot
The complexity of computing
inferredcites →https://doi.org/10.1016/s0049-237x(08)71822-6openalex-snapshot
NP and Craig's Interpolation Theorem
inferredcites →https://doi.org/10.1090/s0002-9947-1981-0590421-1openalex-snapshot
Robinson's Consistency Theorem in Soft Model Theory
inferredcites →https://doi.org/10.1090/s0002-9947-1982-0642332-1openalex-snapshot
Duality Between Logics and Equivalence Relations
inferredcites →https://doi.org/10.2307/2273702openalex-snapshot
The relative efficiency of propositional proof systems
inferredcites →https://doi.org/10.3233/fi-1982-53-403openalex-snapshot
Complexity of Craig’s Interpolation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1997.2674openalex-snapshot
Some Consequences of Cryptographical Conjectures forS12and EF
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_49openalex-snapshot
A Conditional Superpolynomial Lower Bound for Extended Resolution
inferred← citeshttps://doi.org/10.1007/bf02023011openalex-snapshot
Natural limitations of decision procedures for arithmetic with bounded quantifiers
inferred← citeshttps://doi.org/10.1016/0168-0072(84)90029-0openalex-snapshot
Tautologies with a unique craig interpolant, uniform vs. nonuniform complexity
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71822-6openalex-snapshot
NP and Craig's Interpolation Theorem
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00142-5openalex-snapshot
No feasible monotone interpolation for simple combinatorial reasoning
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.1109/sfcs.1997.646114openalex-snapshot
No feasible interpolation for TC/sup 0/-Frege proofs
inferred← citeshttps://doi.org/10.1137/s0097539798353230openalex-snapshot
On Interpolation and Automatization for Frege Systems
inferred← citeshttps://doi.org/10.2178/bsl/1203350879openalex-snapshot
The Complexity of Propositional Proofs
inferred← citeshttps://doi.org/10.2307/2275541openalex-snapshot
Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
inferred← citeshttps://doi.org/10.4230/dagsemproc.06451.3openalex-snapshot
A note on the size of Craig Interpolants
inferred← citeshttps://doi.org/10.5555/2615731.2615753openalex-snapshot
Norm approximation for imperfect monitors
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.