Related papers: On termination of minimal model program for log ca…
We prove an effective vanishing theorem for direct images of log pluricanonical bundles of projective semi-log canonical pairs. As an application, we obtain a semipositivity theorem for direct images of relative log pluricanonical bundles…
One of the central aims of the Minimal Model Program is to show that a projective log canonical pair $(X,\Delta)$ with $K_X+\Delta$ pseudoeffective has a good model, i.e.\ a minimal model $(Y,\Delta_Y)$ such that $K_Y+\Delta_Y$ is…
Hassett and Keel predicted that there is a descending sequence of critical $\alpha$ values where the log canonical model for the moduli space of stable curves with respect to $\alpha \delta$ changes. We derive a conjectural formula for the…
This is the second of a series of papers studying real algebraic threefolds using the minimal model program. The main result is the following. Let $X$ be a smooth projective real algebraic 3-fold. Assume that the set of real points is an…
This paper resolves several outstanding questions regarding the Minimal Model Program for klt threefolds in mixed characteristic. Namely termination for pairs which are not pseudo-effective, finiteness of minimal models and the Sarkisov…
We study propositional logical systems arising from the language of Johansson's minimal logic and obtained by weakening the requirements for the negation operator. We present their semantics as a variant of neighbourhood semantics. We use…
We prove that every quasi-projective semi log canonical pair has a quasi-log structure with several good properties. It implies that various vanishing theorems, torsion-free theorem, and the cone and contraction theorem hold for semi log…
The purpose of this article is to give an overview of the construction of moduli spaces of curves from the viewpoint of the log minimal model program for M_g by providing an update of recent developments and discussing future problems. This…
We establish the relative minimal model program with scaling for locally projective morphisms of quasi-excellent algebraic spaces admitting dualizing complexes, quasi-excellent formal schemes admitting dualizing complexes, semianalytic…
We show that given any two minimal models of a generalized lc pair, there exist small birational models which are connected by a sequence of symmetric flops. We also present some applications.
It is widely acknowledged that function symbols are an important feature in answer set programming, as they make modeling easier, increase the expressive power, and allow us to deal with infinite domains. The main issue with their…
Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in the TermiLog system for automatic termination analysis, is…
We present a novel technique for proving program termination which introduces a new dimension of modularity. Existing techniques use the program to incrementally construct a termination proof. While the proof keeps changing, the program…
We prove the existence of log canonical modifications for a log pair. As an application, together with Koll\"ar's gluing theory, we remove the assumption in the first named author's work [Odaka11], which shows that K-semistable polarized…
Let $(X/Z,B+A)$ be a $\Q$-factorial dlt pair where $B,A\ge 0$ are $\Q$-divisors and $K_X+B+A\sim_\Q 0/Z$. We prove that any LMMP$/Z$ on $K_X+B$ with scaling of an ample$/Z$ divisor terminates with a good log minimal model or a Mori fibre…
We study the computational complexity of the Escape Problem for discrete-time linear dynamical systems over compact semialgebraic sets, or equivalently the Termination Problem for affine loops with compact semialgebraic guard sets. Consider…
We present an efficient approach to prove termination of monotone programs with integer variables, an expressive class of loops that is often encountered in computer programs. Our approach is based on a lightweight static analysis method…
This paper is a gentle introduction to the theory of quasi-log varieties by Ambro. We explain the fundamental theorems for the log minimal model program for log canonical pairs. More precisely, we give a proof of the base point free theorem…
The aim of this paper is to propose a strategy to implement the Minimal Model Program in modern computer algebra systems.