On the public citation graph
Logic and Combinatorics
0 signed · 66 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_86openalex-snapshot
A survey of ordinal interpretations of type ɛ0 for termination of rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-58450-1_43openalex-snapshot
Weak systems of set theory related to HOL
inferred← citeshttps://doi.org/10.1007/978-1-4020-5764-9_7openalex-snapshot
Combinatorial Cardinal Characteristics of the Continuum
inferred← citeshttps://doi.org/10.1007/978-1-4471-2173-2_26openalex-snapshot
Combinatorial Properties of Sets of Partitions
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_26openalex-snapshot
On the strength of Fraïssé’s conjecture
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_32openalex-snapshot
Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_10openalex-snapshot
Basic Proof Theory with Applications to Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_1openalex-snapshot
Introduction Ramsey Theory Old and New
inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_16openalex-snapshot
Combinatorial Statements Independent of Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-642-76799-9_6openalex-snapshot
Computability — Logical and Recursive Complexity
inferred← citeshttps://doi.org/10.1007/978-3-7091-6597-3_4openalex-snapshot
Turing in the Land of 0(z)
inferred← citeshttps://doi.org/10.1007/978-94-015-8988-8_8openalex-snapshot
An Ordinal Partition from a Scale
inferred← citeshttps://doi.org/10.1007/978-981-13-9949-7_1openalex-snapshot
Introduction and Preliminaries
inferred← citeshttps://doi.org/10.1007/s00493-012-2844-3openalex-snapshot
On a problem of Erdös and Rothschild on edges in triangles
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90346-4openalex-snapshot
Fast growing functions based on Ramsey theorems
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90686-aopenalex-snapshot
Unprovable combinatorial statements
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90092-2openalex-snapshot
Minimal acyclic forbidden minors for the family of graphs with bounded path-width
inferred← citeshttps://doi.org/10.1016/0097-3165(88)90073-8openalex-snapshot
A combinatorially large cell of a partition of N
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90027-dopenalex-snapshot
Ordinal complexity of recursive definitions
inferred← citeshttps://doi.org/10.1016/j.aim.2009.03.017openalex-snapshot
A Hardy field extension of Szemerédi's theorem
inferred← citeshttps://doi.org/10.1016/j.aim.2020.107146openalex-snapshot
Single and multiple recurrence along non-polynomial sequences
inferred← citeshttps://doi.org/10.1016/j.aim.2024.109597openalex-snapshot
Multiple ergodic averages along functions from a Hardy field: Convergence, recurrence and combinatorial applications
inferred← citeshttps://doi.org/10.1016/j.aim.2024.109999openalex-snapshot
Stable ordered-union versus selective ultrafilters
inferred← citeshttps://doi.org/10.1016/j.apal.2005.05.012openalex-snapshot
Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
inferred← citeshttps://doi.org/10.1016/j.apal.2007.07.001openalex-snapshot
Increasing the groupwise density number by c.c.c. forcing
inferred← citeshttps://doi.org/10.1016/j.apal.2008.01.004openalex-snapshot
Programs from proofs using classical dependent choice
inferred← citeshttps://doi.org/10.1016/j.apal.2009.01.007openalex-snapshot
On Fraïssé’s conjecture for linear orders of finite Hausdorff rank
inferred← citeshttps://doi.org/10.1016/j.apal.2011.09.009openalex-snapshot
Towards NP – P via proof complexity and search
inferred← citeshttps://doi.org/10.1016/j.cosrev.2011.09.002openalex-snapshot
Confronting intractability via parameters
inferred← citeshttps://doi.org/10.1016/j.disc.2011.03.006openalex-snapshot
A combinatorial proof of the Dense Hindman’s Theorem
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113324openalex-snapshot
Towards characterizing the 2-Ramsey equations of the form ax + by = p(z)
inferred← citeshttps://doi.org/10.1016/j.ejc.2005.07.003openalex-snapshot
Quickly deciding minor-closed parameters in general graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.07.008openalex-snapshot
Effective computation of immersion obstructions for unions of graph classes
inferred← citeshttps://doi.org/10.1016/j.jnt.2022.05.010openalex-snapshot
The Furstenberg–Sárközy theorem and asymptotic total ergodicity phenomena in modular rings
inferred← citeshttps://doi.org/10.1016/j.topol.2009.04.007openalex-snapshot
WM groups and Ramsey theory
inferred← citeshttps://doi.org/10.1016/j.topol.2009.04.017openalex-snapshot
Homogeneous sets from several ultrafilters
inferred← citeshttps://doi.org/10.1016/j.topol.2012.08.009openalex-snapshot
The semigroup of ultrafilters near an idempotent of a semitopological semigroup
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80018-9openalex-snapshot
Hierarchies of Provably Recursive Functions
inferred← citeshttps://doi.org/10.1016/s0195-6698(88)80016-7openalex-snapshot
Note on a Proof of the Extended Kirby—Paris Theorem on Labeled Finite Trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00332-8openalex-snapshot
A new proof-theoretic proof of the independence of Kirby–Paris’ Hydra Theorem
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.004openalex-snapshot
Brief introduction to unprovability
inferred← citeshttps://doi.org/10.1017/cbo9780511974236.021openalex-snapshot
My Forty Years on His Shoulders
inferred← citeshttps://doi.org/10.1017/jsl.2016.17openalex-snapshot
REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION
inferred← citeshttps://doi.org/10.1090/s0002-9947-1989-0932450-9openalex-snapshot
Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
inferred← citeshttps://doi.org/10.1093/imrn/rny040openalex-snapshot
A Structure Theorem for Level Sets of Multiplicative Functions and Applications
inferred← citeshttps://doi.org/10.1093/philmat/nkab034openalex-snapshot
On the Depth of Gödel’s Incompleteness Theorems
inferred← citeshttps://doi.org/10.1109/lics.1999.782635openalex-snapshot
The higher-order recursive path ordering
inferred← citeshttps://doi.org/10.21146/2074-1472-2013-19-0-33-38openalex-snapshot
The modified Ramsey theorem is not a G_del sentence
inferred← citeshttps://doi.org/10.2178/bsl/1146620058openalex-snapshot
Classifying the Provably Total Functions of PA
inferred← citeshttps://doi.org/10.2178/bsl/1286284559openalex-snapshot
Reverse Mathematics: The Playground of Logic
inferred← citeshttps://doi.org/10.2178/bsl/1309952320openalex-snapshot
Open Questions in Reverse Mathematics
inferred← citeshttps://doi.org/10.2178/jsl/1082418545openalex-snapshot
An incompleteness theorem for βn-models
inferred← citeshttps://doi.org/10.2307/2274585openalex-snapshot
Ordinal numbers and the Hilbert basis theorem
inferred← citeshttps://doi.org/10.2307/2274765openalex-snapshot
Propositional proof systems, the consistency of first order theories and the complexity of computations
inferred← citeshttps://doi.org/10.2307/2275219openalex-snapshot
The Baire category theorem in weak subsystems of second-order arithmetic
inferred← citeshttps://doi.org/10.2307/2275254openalex-snapshot
On the strength of König's duality theorem for countable bipartite graphs
inferred← citeshttps://doi.org/10.2307/2275908openalex-snapshot
A small reflection principle for bounded arithmetic
inferred← citeshttps://doi.org/10.36253/979-12-215-0778-2.11openalex-snapshot
Independent sentences of mathematical character
inferred← citeshttps://doi.org/10.48550/arxiv.2008.13142openalex-snapshot
On the depth of Gödel's incompleteness theorem
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.