The following pages link to L. N. Gordeev (Q1147136):
Displaying 31 items.
- (Q234716) (redirect page) (← links)
- (Q490664) (redirect page) (← links)
- Proof-theoretic conservations of weak weak intuitionistic constructive set theories (Q490665) (← links)
- Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees (Q582289) (← links)
- Phase transitions of iterated Higman-style well-partial-orderings (Q661281) (← links)
- A note on da Costa-Doria ``exotic formalizations'' (Q711567) (← links)
- Proof compressions with circuit-structured substitutions (Q843604) (← links)
- Proof-theoretical analysis: Weak systems of functions and classes (Q911585) (← links)
- A majorizing semantics for hyperarithmetic sentences (Q1147137) (← links)
- An approach to the constructivization of Cantor's set theory (Q1147138) (← links)
- (Q1744418) (redirect page) (← links)
- On strong normalization in proof-graphs for propositional logic (Q1744419) (← links)
- Proof compression and NP versus PSPACE (Q2631644) (← links)
- (Q2959916) (← links)
- (Q3037432) (← links)
- Strong WQO Tree Theorems (Q3295147) (← links)
- Generalizations of the Kruskal-Friedman theorems (Q3491541) (← links)
- On cut elimination in the presence of perice rule (Q3781102) (← links)
- (Q4132504) (← links)
- (Q4135477) (← links)
- (Q4250044) (← links)
- Variable compactness in 1-order logic (Q4255974) (← links)
- (Q4273865) (← links)
- A modified sentence unprovable in <b>PA</b> (Q4323034) (← links)
- (Q4329274) (← links)
- (Q4436031) (← links)
- (Q4474835) (← links)
- (Q4994969) (← links)
- Proof Compression and NP Versus PSPACE II (Q5147748) (← links)
- Generalizations of the one-dimensional version of the Kruskal-Friedman theorems (Q5752568) (← links)
- Finite methods in 1-order formalisms (Q5957909) (← links)
