default search action
Lew Gordeev
Person information
- affiliation: Universität Tübingen
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i8]Lev Gordeev, Edward Hermann Haeusler:
Proofs of Equalities NP = coNP = PSPACE: Simplification. CoRR abs/2311.17939 (2023) - 2022
- [i7]Lew Gordeev, Edward Hermann Haeusler:
On proof theory in computational complexity: overview. CoRR abs/2201.04118 (2022) - 2020
- [i6]Lev Gordeev:
More on NP Versus P. CoRR abs/2005.00809 (2020) - [i5]Lew Gordeev, Edward Hermann Haeusler:
Proof Compression and NP Versus PSPACE II: Addendum. CoRR abs/2011.09262 (2020) - [i4]Lew Gordeev, Edward Hermann Haeusler:
On proof theory in computer science. CoRR abs/2012.04437 (2020)
2010 – 2019
- 2019
- [j13]Lev Gordeev
, Edward Hermann Haeusler:
Proof Compression and NP Versus PSPACE. Stud Logica 107(1): 53-83 (2019) - [i3]Lev Gordeev:
Predicative proof theory of PDL and basic applications. CoRR abs/1904.05131 (2019) - [i2]Lev Gordeev:
Proof compression and NP versus PSPACE. Part 2. CoRR abs/1907.03858 (2019) - 2016
- [i1]Lew Gordeev, Edward Hermann Haeusler:
NP vs PSPACE. CoRR abs/1609.09562 (2016) - 2015
- [c7]Marcela Quispe-Cruz
On Strong Normalization in Proof-Graphs for Propositional Logic. LSFA 2015: 181-196 - 2013
- [j12]Lew Gordeev:
Proof-theoretic conservations of weak weak intuitionistic constructive set theories. Ann. Pure Appl. Log. 164(12): 1274-1292 (2013) - [c6]Marcela Quispe-Cruz
Proof-graphs for Minimal Implicational Logic. DCM 2013: 16-29 - 2012
- [j11]Lew Gordeev, Andreas Weiermann
Phase transitions of iterated Higman-style well-partial-orderings. Arch. Math. Log. 51(1-2): 127-161 (2012) - 2011
- [j10]Lew Gordeev, Edward Hermann Haeusler, Luiz Carlos Pereira:
Propositional proof compressions and DNF logic. Log. J. IGPL 19(1): 62-86 (2011) - 2010
- [j9]Lew Gordeev:
A note on da Costa-Doria "exotic formalizations". Arch. Math. Log. 49(7-8): 813-821 (2010)
2000 – 2009
- 2001
- [j8]Lew Gordeev:
Finite methods in 1-order formalisms. Ann. Pure Appl. Log. 113(1-3): 121-151 (2001) - [c5]Lew Gordeev:
Proof Theory and Post-turing Analysis. Proof Theory in Computer Science 2001: 130-152 - 2000
- [c4]Lew Gordeev:
Combinatorial Principles Relevant to Finite Variable Logic. RelMiCS 2000: 95-111
1990 – 1999
- 1999
- [j7]Lew Gordeev:
Variable Compactness in 1-Order Logic. Log. J. IGPL 7(3): 327-357 (1999) - 1998
- [c3]Lew Gordeev:
Proof systems in relation algebra. RelMiCS 1998: 80-85 - 1994
- [j6]Lew Gordeev:
A Modified Sentence Unprovable in PA. J. Symb. Log. 59(4): 1154-1157 (1994) - [c2]Lew Gordeev:
Cut Free Formalization of Logic with Finitely Many Variables. Part I. CSL 1994: 136-150 - 1991
- [c1]Lew Gordeev:
Quasi-ordinals and proof theory. Graph Structure Theory 1991: 485-494 - 1990
- [j5]Lew Gordeev:
Generalizations of the Kruskal-Friedman Theories. J. Symb. Log. 55(1): 157-181 (1990)
1980 – 1989
- 1989
- [j4]Lev Gordeev:
Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees. Arch. Math. Log. 29(1): 29-46 (1989) - [j3]Lew Gordeev:
Generalizations of the One-Dimensional Version of the Kruskal-Friedman Theorems. J. Symb. Log. 54(1): 100-121 (1989) - 1988
- [j2]Lev Gordeev:
Proof-theoretical analysis: weak systems of functions and classes. Ann. Pure Appl. Log. 38(1): 1-121 (1988) - 1987
- [j1]Lew Gordeev:
On cut elimination in the presence of perice rule. Arch. Math. Log. 26(1): 147-164 (1987)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: