Generic Modal Cut Elimination Applied to Conditional Logics

We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide variety of logics outside the realm of normal modal logic. We give extensive example instantiations of our framework to various conditional logics. For these, we obtain fully internalised calculi which are substantially simpler than those known in the literature, along with leaner proofs of cut elimination and complexity. In one case, conditional logic with modus ponens and conditional excluded middle, cut elimination and complexity were explicitly stated as open in the literature

Algorithms for Game Metrics

Simulation and bisimulation metrics for stochastic systems provide a quantitative generalization of the classical simulation and bisimulation relations. These metrics capture the similarity of states with respect to quantitative specifications written in the quantitative {\mu}-calculus and related probabilistic logics. We first show that the metrics provide a bound for the difference in long-run average and discounted average behavior across states, indicating that the metrics can be used both in system verification, and in performance evaluation. For turn-based games and MDPs, we provide a polynomial-time algorithm for the computation of the one-step metric distance between states. The algorithm is based on linear programming; it improves on the previous known exponential-time algorithm based on a reduction to the theory of reals. We then present PSPACE algorithms for both the decision problem and the problem of approximating the metric distance between two states, matching the best known algorithms for Markov chains. For the bisimulation kernel of the metric our algorithm works in time O(n^4) for both turn-based games and MDPs; improving the previously best known O(n^9\cdot log(n)) time algorithm for MDPs. For a concurrent game G, we show that computing the exact distance between states is at least as hard as computing the value of concurrent reachability games and the square-root-sum problem in computational geometry. We show that checking whether the metric distance is bounded by a rational r, can be done via a reduction to the theory of real closed fields, involving a formula with three quantifier alternations, yielding O(|G|^O(|G|^5)) time complexity, improving the previously known reduction, which yielded O(|G|^O(|G|^7)) time complexity. These algorithms can be iterated to approximate the metrics using binary search.Comment: 27 pages. Full version of the paper accepted at FSTTCS 200

Model Checking CTL is Almost Always Inherently Sequential

The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations---restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004). For all these fragments, except for the trivial case without any temporal operator, we systematically prove model checking to be either inherently sequential (P-complete) or very efficiently parallelizable (LOGCFL-complete). For most fragments, however, model checking for CTL is already P-complete. Hence our results indicate that, in cases where the combined complexity is of relevance, approaching CTL model checking by parallelism cannot be expected to result in any significant speedup. We also completely determine the complexity of the model checking problem for all fragments of the extensions ECTL, CTL+, and ECTL+

Spectroscopic binaries in the Solar Twin Planet Search program: from substellar-mass to M dwarf companions

Previous studies on the rotation of Sun-like stars revealed that the rotational rates of young stars converge towards a well-defined evolution that follows a power-law decay. It seems, however, that some binary stars do not obey this relation, often by displaying enhanced rotational rates and activity. In the Solar Twin Planet Search program we observed several solar twin binaries, and found a multiplicity fraction of $42\% \pm 6\%$ in the whole sample; moreover, at least three of these binaries (HIP 19911, HIP 67620 and HIP 103983) clearly exhibit the aforementioned anomalies. We investigated the configuration of the binaries in the program, and discovered new companions for HIP 6407, HIP 54582, HIP 62039 and HIP 30037, of which the latter is orbited by a $0.06$ M$_\odot$ brown dwarf in a 1-month long orbit. We report the orbital parameters of the systems with well-sampled orbits and, in addition, the lower limits of parameters for the companions that only display a curvature in their radial velocities. For the linear trend binaries, we report an estimate of the masses of their companions when their observed separation is available, and a minimum mass otherwise. We conclude that solar twin binaries with low-mass stellar companions at moderate orbital periods do not display signs of a distinct rotational evolution when compared to single stars. We confirm that the three peculiar stars are double-lined binaries, and that their companions are polluting their spectra, which explains the observed anomalies.Comment: 13 pages, 7 figures, accepted for publication in MNRA

Algorithms and Bounds for Very Strong Rainbow Coloring

A well-studied coloring problem is to assign colors to the edges of a graph $G$ so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors. The minimum number of colors necessary in such a coloring is the strong rainbow connection number (\src(G)) of the graph. When proving upper bounds on \src(G), it is natural to prove that a coloring exists where, for \emph{every} shortest path between every pair of vertices in the graph, all edges of the path receive different colors. Therefore, we introduce and formally define this more restricted edge coloring number, which we call \emph{very strong rainbow connection number} (\vsrc(G)). In this paper, we give upper bounds on \vsrc(G) for several graph classes, some of which are tight. These immediately imply new upper bounds on \src(G) for these classes, showing that the study of \vsrc(G) enables meaningful progress on bounding \src(G). Then we study the complexity of the problem to compute \vsrc(G), particularly for graphs of bounded treewidth, and show this is an interesting problem in its own right. We prove that \vsrc(G) can be computed in polynomial time on cactus graphs; in contrast, this question is still open for \src(G). We also observe that deciding whether \vsrc(G) = k is fixed-parameter tractable in $k$ and the treewidth of $G$. Finally, on general graphs, we prove that there is no polynomial-time algorithm to decide whether \vsrc(G) \leq 3 nor to approximate \vsrc(G) within a factor $n^{1-\varepsilon}$, unless P$=$NP

Towards a Proof Theory of G\"odel Modal Logics

Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic. The calculi are used to establish completeness and complexity results for these fragments

Automated Synthesis of Tableau Calculi

This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau inference rules that can then be used to reason within the logic. The method guarantees that the generated rules form a calculus which is sound and constructively complete. If the logic can be shown to admit finite filtration with respect to a well-defined first-order semantics then adding a general blocking mechanism provides a terminating tableau calculus. The process of generating tableau rules can be completely automated and produces, together with the blocking mechanism, an automated procedure for generating tableau decision procedures. For illustration we show the workability of the approach for a description logic with transitive roles and propositional intuitionistic logic.Comment: 32 page

Target company cross-border effects in acquisitions into the UK

We analyse the abnormal returns to target shareholders in crossborder and domestic acquisitions of UK companies. The crossborder effect during the bid month is small (0.84%), although crossborder targets gain significantly more than domestic targets during the months surrounding the bid. We find no evidence for the level of abnormal returns in crossborder acquisitions to be associated with market access or exchange rate effects, and only limited support for an international diversification effect. However, the crossborder effect appears to be associated with significant payment effects, and there is no significant residual crossborder effect once various bid characteristics are controlled for

The Qualified Legal Compliance Committee: Using the Attorney Conduct Rules to Restructure the Board of Directors

The Securities and Exchange Commission introduced a new corporate governance structure, the qualified legal compliance committee, as part of the professional standards of conduct for attorneys mandated by the Sarbanes-Oxley Act of 2002. QLCCs are consistent with the Commission\u27s general approach to improving corporate governance through specialized committees of independent directors. This Article suggests, however, that assessing the benefits and costs of creating QLCCs may be more complex than is initially apparent. Importantly, QLCCs are unlikely to be effective in the absence of incentives for active director monitoring. This Article concludes by considering three ways of increasing these incentives