On the public citation graph
On Independence of Variants of the Weak Pigeonhole Principle
0 signed · 64 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.1006/inco.1997.2674openalex-snapshot
Some Consequences of Cryptographical Conjectures forS12and EF
inferredcites →https://doi.org/10.1006/jcss.2002.1830openalex-snapshot
A New Proof of the Weak Pigeonhole Principle
inferredcites →https://doi.org/10.1007/3-540-60178-3_86openalex-snapshot
Some consequences of cryptographical conjectures for S 2 1 and EF
inferredcites →https://doi.org/10.1007/978-1-4612-2822-6_11openalex-snapshot
No Counter-Example Interpretation and Interactive Computation
inferredcites →https://doi.org/10.1016/0168-0072(91)90043-lopenalex-snapshot
Bounded arithmetic and the polynomial hierarchy
inferredcites →https://doi.org/10.1016/0168-0072(91)90096-5openalex-snapshot
Combinatorial principles in elementary number theory
inferredcites →https://doi.org/10.1016/j.apal.2003.12.003openalex-snapshot
Dual weak pigeonhole principle, Boolean complexity, and derandomization
inferredcites →https://doi.org/10.1016/j.apal.2005.04.005openalex-snapshot
Structures interpretable in models of bounded arithmetic
inferredcites →https://doi.org/10.1016/s0049-237x(98)80017-7openalex-snapshot
First-Order Proof Theory of Arithmetic
inferredcites →https://doi.org/10.1016/s0168-0072(02)00038-6openalex-snapshot
A model-theoretic characterization of the weak pigeonhole principle
inferredcites →https://doi.org/10.1017/cbo9780511529948openalex-snapshot
Bounded Arithmetic, Propositional Logic and Complexity Theory
inferredcites →https://doi.org/10.1017/s0022481200028061openalex-snapshot
Provability of the pigeonhole principle and the existence of infinitely many primes
inferredcites →https://doi.org/10.1093/oso/9780198536901.003.0014openalex-snapshot
Making infinite structures finite in models of second order Bounded Arithmetic
inferredcites →https://doi.org/10.1145/1166109.1166114openalex-snapshot
The strength of replacement in weak arithmetic
inferredcites →https://doi.org/10.1145/1183278.1183283openalex-snapshot
The strength of replacement in weak arithmetic
inferredcites →https://doi.org/10.1145/335305.335348openalex-snapshot
A new proof of the weak pigeonhole principle
inferredcites →https://doi.org/10.1145/800116.803756openalex-snapshot
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
inferredcites →https://doi.org/10.2307/2269958openalex-snapshot
Existence and feasibility in arithmetic
inferredcites →https://doi.org/10.2307/2270886openalex-snapshot
Alan Cobham. The intrinsic computational difficulty of functions. Logic, methodology and philosophy of science, Proceedings of the 1964 International Congress, edited by Yehoshua Bar-Hillel, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1965, pp.…
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.200810043openalex-snapshot
A note on the Σ1collection scheme and fragments of bounded arithmetic
inferred← citeshttps://doi.org/10.1002/malq.200910009openalex-snapshot
Abelian groups and quadratic residues in weak arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-319-43669-2_10openalex-snapshot
Complexity Barriers as Independence
inferred← citeshttps://doi.org/10.1007/s00037-019-00182-7openalex-snapshot
Random resolution refutations
inferred← citeshttps://doi.org/10.1016/j.apal.2019.102735openalex-snapshot
Feasibly constructive proofs of succinct weak circuit lower bounds
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102930openalex-snapshot
Typical forcings, NP search problems and an extension of a theorem of Riis
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.08.001openalex-snapshot
Integer factoring and modular square roots
inferred← citeshttps://doi.org/10.1016/j.procs.2021.11.021openalex-snapshot
Automating Tree-Like Resolution in Time n(log ) Is ETH-Hard
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/jsl.2013.37openalex-snapshot
FRAGMENTS OF APPROXIMATE COUNTING
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00040openalex-snapshot
Reverse Mathematics of Complexity Lower Bounds
inferred← citeshttps://doi.org/10.1145/2629555openalex-snapshot
The Ordering Principle in a Fragment of Approximate Counting
inferred← citeshttps://doi.org/10.1145/3406325.3451080openalex-snapshot
Automating algebraic proof systems is NP-hard
inferred← citeshttps://doi.org/10.1145/3564246.3585187openalex-snapshot
Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic
inferred← citeshttps://doi.org/10.1145/3798129.3800780openalex-snapshot
Kolmogorov’s Approach to P vs. NP: Chain Rules for Time-Bounded Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1145/3798129.3800842openalex-snapshot
A Theory for Probabilistic Polynomial-Time Reasoning
inferred← citeshttps://doi.org/10.2168/lmcs-11(2:8)2015openalex-snapshot
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic
inferred← citeshttps://doi.org/10.2178/jsl/1208359061openalex-snapshot
The polynomial and linear hierarchies in models where the weak pigeonhole principle fails
inferred← citeshttps://doi.org/10.2178/jsl/1245158087openalex-snapshot
Approximate counting by hashing in bounded arithmetic
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.