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+

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

Optimizing infrared to near infrared upconversion quantum yield of β-NaYF₄:Er³⁺ in fluoropolymer matrix for photovoltaic devices

The present study reports for the first time the optimization of the infrared (1523 nm) to near-infrared (980 nm) upconversion quantum yield (UC-QY) of hexagonal trivalent erbium doped sodium yttrium fluoride (β-NaYF4:Er3+) in a perfluorocyclobutane (PFCB) host matrix under monochromatic excitation. Maximum internal and external UC-QYs of 8.4% ± 0.8% and 6.5% ± 0.7%, respectively, have been achieved for 1523 nm excitation of 970 ± 43 Wm−2 for an optimum Er3+ concentration of 25 mol% and a phosphor concentration of 84.9 w/w% in the matrix. These results correspond to normalized internal and external efficiencies of 0.86 ± 0.12 cm2 W−1 and 0.67 ± 0.10 cm2 W−1, respectively. These are the highest values ever reported for β-NaYF4:Er3+ under monochromatic excitation. The special characteristics of both the UC phosphor β-NaYF4:Er3+ and the PFCB matrix give rise to this outstanding property. Detailed power and time dependent luminescence measurements reveal energy transfer upconversion as the dominant UC mechanism

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

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

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

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

Association of the AFF3 gene and IL2/IL21 gene region with juvenile idiopathic arthritis

Recent genetic studies have led to identification of numerous loci that are associated with susceptibility to autoimmune diseases. The strategy of using information from these studies has facilitated the identification of novel juvenile idiopathic arthritis (JIA) susceptibility loci, specifically, PTPN22 and IL2RA. Several novel autoimmune susceptibility loci have recently been identified, and we hypothesise that single-nucleotide polymorphisms (SNPs) within these genes may also be JIA susceptibility loci. Five SNPs within the genes AFF3, IL2/IL21, IL7R, CTLA4 and CD226, previously associated with multiple autoimmune diseases were genotyped, in a large data set of Caucasian JIA patients and controls, and tested for association with JIA. We identified two susceptibility loci for JIA, AFF3 and the IL2/IL21 region and additional weak evidence supporting an association with the CTLA4 and IL7R genes, which warrant further investigation. All results require validation in independent JIA data sets. Further characterisation of the specific causal variants will be required before functional studies can be performed

Problematising parent–professional partnerships in education

The value of, and need for, parent–professional partnerships is an unchallenged mantra within policy relating to ‘special educational needs’. In spite of this, partnerships continue to be experienced as problematic by both parents and professionals. This paper brings together the different perspectives of two disability researchers: one a parent of a disabled child while the other was a teacher for 20 years of children with the label autism. The paper deconstructs the concept of partnership and then, drawing on the expertise of parents, suggests how enabling and empowering parent–professional relationships might be achieved

Problematising parent–professional partnerships in education

The value of, and need for, parent–professional partnerships is an unchallenged mantra within policy relating to ‘special educational needs’. In spite of this, partnerships continue to be experienced as problematic by both parents and professionals. This paper brings together the different perspectives of two disability researchers: one a parent of a disabled child while the other was a teacher for 20 years of children with the label autism. The paper deconstructs the concept of partnership and then, drawing on the expertise of parents, suggests how enabling and empowering parent–professional relationships might be achieved