Lew Gordeev

Orcid: 0000-0001-6238-7747

Affiliations:
  • Universität Tübingen


According to our database1, Lew Gordeev authored at least 28 papers between 1987 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Proofs of Equalities NP = coNP = PSPACE: Simplification.
CoRR, 2023

2022
On proof theory in computational complexity: overview.
CoRR, 2022

2020
On proof theory in computer science.
CoRR, 2020

Proof Compression and NP Versus PSPACE II: Addendum.
CoRR, 2020

More on NP Versus P.
CoRR, 2020

2019
Proof Compression and NP Versus PSPACE.
Stud Logica, 2019

Proof compression and NP versus PSPACE. Part 2.
CoRR, 2019

Predicative proof theory of PDL and basic applications.
CoRR, 2019

2016
NP vs PSPACE.
CoRR, 2016

2015
On Strong Normalization in Proof-Graphs for Propositional Logic.
Proceedings of the Tenth Workshop on Logical and Semantic Frameworks, with Applications, 2015

2013
Proof-graphs for Minimal Implicational Logic.
Proceedings of the Proceedings 9th International Workshop on Developments in Computational Models, 2013

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

2012
Phase transitions of iterated Higman-style well-partial-orderings.
Arch. Math. Log., 2012

2011
Propositional proof compressions and DNF logic.
Log. J. IGPL, 2011

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

2001
Finite methods in 1-order formalisms.
Ann. Pure Appl. Log., 2001

Proof Theory and Post-turing Analysis.
Proceedings of the Proof Theory in Computer Science, International Seminar, 2001

2000
Combinatorial Principles Relevant to Finite Variable Logic.
Proceedings of the Participants Copies of Fifth International Seminar on Relational Methods in Computer Science, 2000

1999
Variable Compactness in 1-Order Logic.
Log. J. IGPL, 1999

1998
Proof systems in relation algebra.
Proceedings of the Participants Copies for Relational Methods in Logic, 1998

1994
A Modified Sentence Unprovable in PA.
J. Symb. Log., 1994

Cut Free Formalization of Logic with Finitely Many Variables. Part I.
Proceedings of the Computer Science Logic, 8th International Workshop, 1994

1991
Quasi-ordinals and proof theory.
Proceedings of the Graph Structure Theory, 1991

1990
Generalizations of the Kruskal-Friedman Theories.
J. Symb. Log., 1990

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

Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees.
Arch. Math. Log., 1989

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

1987
On cut elimination in the presence of perice rule.
Arch. Math. Log., 1987


  Loading...