Asymptotic normalization coefficients for mirror virtual nucleon decays in a microscopic cluster model

It has been suggested recently (Phys. Rev. Lett. 91, 232501 (2003)) that charge symmetry of nucleon-nucleon interactions relates the Asymptotic Normalization Coefficients (ANCs) of proton and neutron virtual decays of mirror nuclei. This relation is given by a simple analytical formula which involves proton and neutron separation energies, charges of residual nuclei and the range of their strong interaction with the last nucleon. Relation between mirror ANCs, if understood properly, can be used to predict astrophysically relevant direct proton capture cross sections using neutron ANCs measured with stable beams. In this work, we calculate one-nucleon ANCs for several light mirror pairs, using microscopic two-, three- and four-cluster models, and compare the ratio of mirror ANCs to the predictions of the simple analytic formula. We also investigate mirror symmetry between other characteristics of mirror one-nucleon overlap integrals, namely, spectroscopic factors and single-particle ANCs.Comment: 12 pages, submitted to Phys. Rev.

NEXP-completeness and Universal Hardness Results for Justification Logic

We provide a lower complexity bound for the satisfiability problem of a multi-agent justification logic, establishing that the general NEXP upper bound from our previous work is tight. We then use a simple modification of the corresponding reduction to prove that satisfiability for all multi-agent justification logics from there is hard for the Sigma 2 p class of the second level of the polynomial hierarchy - given certain reasonable conditions. Our methods improve on these required conditions for the same lower bound for the single-agent justification logics, proven by Buss and Kuznets in 2009, thus answering one of their open questions.Comment: Shorter version has been accepted for publication by CSR 201

Explicit Evidence Systems with Common Knowledge

Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a Kripke-style semantics that is similar to Fitting's semantics for the Logic of Proofs LP. We show the soundness, completeness, and finite model property of our multi-agent justification logic with respect to this Kripke-style semantics. We demonstrate that our logic is a conservative extension of Yavorskaya's minimal bimodal explicit evidence logic, which is a two-agent version of LP. We discuss the relationship of our logic to the multi-agent modal logic S4 with common knowledge. Finally, we give a brief analysis of the coordinated attack problem in the newly developed language of our logic

Existence of Optimal Control for a Nonlinear-Viscous Fluid Model

We consider the optimal control problem for a mathematical model describing steady flows of a nonlinear-viscous incompressible fluid in a bounded three-dimensional (or a two-dimensional) domain with impermeable solid walls. The control parameter is the surface force at a given part of the flow domain boundary. For a given bounded set of admissible controls, we construct generalized (weak) solutions that minimize a given cost functional

Modal Logics with Hard Diamond-free Fragments

We investigate the complexity of modal satisfiability for certain combinations of modal logics. In particular we examine four examples of multimodal logics with dependencies and demonstrate that even if we restrict our inputs to diamond-free formulas (in negation normal form), these logics still have a high complexity. This result illustrates that having D as one or more of the combined logics, as well as the interdependencies among logics can be important sources of complexity even in the absence of diamonds and even when at the same time in our formulas we allow only one propositional variable. We then further investigate and characterize the complexity of the diamond-free, 1-variable fragments of multimodal logics in a general setting.Comment: New version: improvements and corrections according to reviewers' comments. Accepted at LFCS 201

TR-2014003: On the Complexity of Two-Agent Justification Logic

We investigate the complexity of derivability for two-agent Justification Logic. For this purpose we revisit Yavorskaya’s two-agent LP with interactions (2008), we simplify the syntax and provide natural extensions. We consider two-agent versions of other justification logics as well as ways to combine two justification logics. For most of these cases we prove that the upper complexity bound established for the single-agent cases are maintained: these logics ’ derivability problem is in the second step of the polynomial hierarchy. For certain logics, though, we discover a complex-ity jump to PSPACE-completeness, which is a new phenomenon for Justification Logic

On stress/strain state in a rotating disk

In the framework of mechanics of continuum bodies, the problem of stress/strain state in a high-speed rotating disk of constant thickness has been considered. The material of the disk is assumed to be homogeneous, elastic/perfectly-plastic. In the plastic zone, the stresses and plastic strains are related by some associated law similar to the one employed in deformation theory of plasticity. The general algorithm of the solution covers any smooth plasticity function. At some steps of the algorithm, it is possible to get analytical expressions, particularly, for the quadratic Mises yield criterion. For the given model, the notion of control parameters (external and internal) has been introduced. The allowable boundaries of external parameters have been defined as well. For some states of the disk, the coherent values of external parameters have been obtained. The results are represented graphically to show various states of the disk. The usage of piecewise plasticity functions has been briefly discussed. The results obtained can be used in preliminary engineering design and related numerical codes.info:eu-repo/semantics/publishedVersio