3 problems
- 0 votes0 replies0 views
Shokurov's log termination conjecture
Log termination conjecture. Every sequence of -flips terminates.
- 0 votes0 replies1 view
Closure of the bar recursive program on fragments of System T
The paper considers a bar recursive program associated with a binary relation and its derivational complexity, with the relevant functionals and moduli defined in fragments of Syst…
- 0 votes0 replies0 views
The conjecture on the strength of SCT soundness
SCT soundness conjecture. SCT soundness should be provable in augmented by well-foundedness of .