Complexity Results for Modal Dependence Logic

Modal dependence logic was introduced recently by V\"a\"an\"anen. It enhances the basic modal language by an operator =(). For propositional variables p_1,...,p_n, =(p_1,...,p_(n-1);p_n) intuitively states that the value of p_n is determined by those of p_1,...,p_(n-1). Sevenster (J. Logic and Computation, 2009) showed that satisfiability for modal dependence logic is complete for nondeterministic exponential time. In this paper we consider fragments of modal dependence logic obtained by restricting the set of allowed propositional connectives. We show that satisfibility for poor man's dependence logic, the language consisting of formulas built from literals and dependence atoms using conjunction, necessity and possibility (i.e., disallowing disjunction), remains NEXPTIME-complete. If we only allow monotone formulas (without negation, but with disjunction), the complexity drops to PSPACE-completeness. We also extend V\"a\"an\"anen's language by allowing classical disjunction besides dependence disjunction and show that the satisfiability problem remains NEXPTIME-complete. If we then disallow both negation and dependence disjunction, satistiability is complete for the second level of the polynomial hierarchy. In this way we completely classify the computational complexity of the satisfiability problem for all restrictions of propositional and dependence operators considered by V\"a\"an\"anen and Sevenster.Comment: 22 pages, full version of CSL 2010 pape

Ludics and its Applications to natural Language Semantics

Proofs, in Ludics, have an interpretation provided by their counter-proofs, that is the objects they interact with. We follow the same idea by proposing that sentence meanings are given by the counter-meanings they are opposed to in a dialectical interaction. The conception is at the intersection of a proof-theoretic and a game-theoretic accounts of semantics, but it enlarges them by allowing to deal with possibly infinite processes

A New Approach to Epistemic Logic

A new language for epistemic logic is introduced in which the epis- temic operators are of the form j x : x1 : : : xnj with the intended read- ing \x knows of x1 : : : xn that ...". Analogously we can express \t knows of t1 : : : tn that ... ", where t; t1 : : : tn are terms. An advantage of this approach is that we can quantify on the agents, \every y knows of x1 : : : xn that A" or \some expert knows of t1 : : : tn that A" can easily be expressed. The semantics we present for this language is a generalization of the transition semantics, called epistemic transition semantics in which the possible worlds are states of affairs compatible with the epistemic state of some agent. A calculus is presented and shown to be complete with respect to epistemic transition semantics

Safety, the Preface Paradox and Possible Worlds Semantics

This paper contains an argument to the effect that possible worlds semantics renders semantic knowledge impossible, no matter what ontological interpretation is given to possible worlds. The essential contention made is that possible worlds semantic knowledge is unsafe and this is shown by a parallel with the preface paradox

Singularities in the Kerr-Newman and charged δ=2\delta=2 Tomimatsu-Sato spacetimes endowed with negative mass

The Kerr-Newman solution with negative mass is shown to develop a massless ring singularity off the symmetry axis. The singularity is located inside the region with closed timelike curves which has topology of a torus and lies outside the ergoregion. These characteristics are also shared by the charged Tomimatsu-Sato delta=2 solution with negative total mass to which in particular a simple form in terms of four polynomials is provided.Comment: 10 pages, 7 figures; hyperextreme case included, one reference adde

Approaching Proof in the Classroom Through the Logic of Inquiry

The paper analyses a basic gap, highlighted by most of the literature concerning the teaching of proofs, namely, the distance between students' argumentative and proving processes. The analysis is developed from both epistemological and cognitive standpoints: it critiques the Toulmin model of reasoning and introduces a new model, the Logic of Inquiry of Hintikka, more suitable for bridging this gap. An example of didactical activity within Dynamic Geometry Environments is sketched in order to present a concrete illustration of this approach and to show the pedagogical effectiveness of the model

Achieving while maintaining:A logic of knowing how with intermediate constraints

In this paper, we propose a ternary knowing how operator to express that the agent knows how to achieve $\phi$ given $\psi$ while maintaining $\chi$ in-between. It generalizes the logic of goal-directed knowing how proposed by Yanjing Wang 2015 'A logic of knowing how'. We give a sound and complete axiomatization of this logic.Comment: appear in Proceedings of ICLA 201

Analgesic purchases among older adults - a population-based study

Background: Pain is a frequent and inevitable factor affecting the quality of life among older people. Several studies have highlighted the ineffectiveness of treating chronic pain among the aged population, and little is known about the prevalence of analgesics administration among community-dwelling older adults. The objective was to examine older adults' prescription analgesic purchases in relation to SF-36 pain in a population-based setting. Methods: One thousand four hundred twenty community-dwelling citizens aged 62-86 years self-reported SF-36 bodily pain (pain intensity and pain-related interference) scores for the previous 4 weeks. The Social Insurance Institution of Finland register data on analgesic purchases for 6 months prior to and 6 months after the questionnaire data collection were considered. Special interest was focused on factors related to opioid purchases. Results: Of all participants, 84% had purchased prescription analgesics during 1 year. NSAIDs were most frequently purchased (77%), while 41% had purchased paracetamol, 32% opioids, 17% gabapentinoids, and 7% tricyclic antidepressants. Age made no marked difference in purchasing prevalence. The number of morbidities was independently associated with analgesic purchases in all subjects and metabolic syndrome also with opioid purchases in subjects who had not reported any pain. Discussion: Substantial NSAID and opioid purchases emerged. The importance of proper pain assessment and individual deliberation in terms of analgesic contraindications and pain quality, as well as non-pharmacological pain management, need to be highlighted in order to optimize older adults' pain management.Peer reviewe