On cut elimination in the presence of perice rule. - Lew Gordeev (Arch. Math. Log., 1987)

Proof-theoretical analysis: weak systems of functions and classes. - Lev Gordeev (Ann. Pure Appl. Log., 1988)

Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees. - Lev Gordeev (Arch. Math. Log., 1989)

Generalizations of the One-Dimensional Version of the Kruskal-Friedman Theorems. - Lew Gordeev (J. Symb. Log., 1989)

Generalizations of the Kruskal-Friedman Theories. - Lew Gordeev (J. Symb. Log., 1990)

Quasi-ordinals and proof theory. - Lew Gordeev (Graph Structure Theory, 1991)

Cut Free Formalization of Logic with Finitely Many Variables. Part I. - Lew Gordeev (CSL, 1994)

A Modified Sentence Unprovable in PA. - Lew Gordeev (J. Symb. Log., 1994)

Proof systems in relation algebra. - Lew Gordeev (RelMiCS, 1998)

Variable Compactness in 1-Order Logic. - Lew Gordeev (Log. J. IGPL, 1999)

Combinatorial Principles Relevant to Finite Variable Logic. - Lew Gordeev (RelMiCS, 2000)

Proof Theory and Post-turing Analysis. - Lew Gordeev (Proof Theory in Computer Science, 2001)

Finite methods in 1-order formalisms. - Lew Gordeev (Ann. Pure Appl. Log., 2001)

A note on da Costa-Doria "exotic formalizations". - Lew Gordeev (Arch. Math. Log., 2010)

Propositional proof compressions and DNF logic. - Lew Gordeev; Edward Hermann Haeusler; Luiz Carlos Pereira (Log. J. IGPL, 2011)

Phase transitions of iterated Higman-style well-partial-orderings. - Lew Gordeev; Andreas Weiermann (Arch. Math. Log., 2012)

Proof-theoretic conservations of weak weak intuitionistic constructive set theories. - Lew Gordeev (Ann. Pure Appl. Log., 2013)

Proof-graphs for Minimal Implicational Logic. - Marcela Quispe-Cruz; Edward Hermann Haeusler; Lew Gordeev (DCM, 2013)

On Strong Normalization in Proof-Graphs for Propositional Logic. - Marcela Quispe-Cruz; Edward Hermann Haeusler; Lew Gordeev (LSFA, 2015)

NP vs PSPACE. - Lew Gordeev; Edward Hermann Haeusler (CoRR, 2016)

Predicative proof theory of PDL and basic applications. - Lev Gordeev (CoRR, 2019)

Proof compression and NP versus PSPACE. Part 2. - Lev Gordeev (CoRR, 2019)

Proof Compression and NP Versus PSPACE. - Lev Gordeev; Edward Hermann Haeusler (Stud Logica, 2019)

More on NP Versus P. - Lev Gordeev (CoRR, 2020)

Proof Compression and NP Versus PSPACE II: Addendum. - Lew Gordeev; Edward Hermann Haeusler (CoRR, 2020)

On proof theory in computer science. - Lew Gordeev; Edward Hermann Haeusler (CoRR, 2020)

On proof theory in computational complexity: overview. - Lew Gordeev; Edward Hermann Haeusler (CoRR, 2022)

Proofs of Equalities NP = coNP = PSPACE: Simplification. - Lev Gordeev; Edward Hermann Haeusler (CoRR, 2023)