Search

We propose an indexed natural deduction system for the modal logic S5 , ideally following Wansing's previous work in the context of tableaux sequents. The system, given both in the classical and intuitionistic versions (called N 5 c and N 5 i respectively), is designed to match as much as possible the structure and properties of the standard system of natural deduction for first-order logic, exploiting the formal analogy between modalities and quantifiers. We study a (syntactical) normalization theorem for both N 5 c and N 5 i and its main consequences, the sub-formula principle and the consistency theorem. In particular, we propose an intuitionistic encoding of classical S5 (via a suitable extension of the Gödel translation for first-order classical logic). Moreover, via the BHK interpretation of intuitionistic proofs, we propose a suitable Curry–Howard isomorphism for N 5 i . By translation into the natural deduction system given by Galmiche and Salhi in [(2010b). Label-free proof systems for intuitionistic modal logic is5. In E. M. Clarke & A. Voronkov (Eds.), Logic for programming, artificial intelligence, and reasoning (pp. 255–271). Springer Berlin Heidelberg.], we prove the equivalence of N 5 i w.r.t. an Hilbert-style axiomatization of IS5 . However, when considering the sheer provability of labelled formulas, our system is comparable to the one presented by Simpson in [(1993). The proof theory and semantics of intuitionistic modal logic [PhD thesis], University of Edinburgh, UK.]. Nevertheless, it remains uncertain whether it is feasible to establish a translation between the corresponding derivations. [ABSTRACT FROM AUTHOR]

Copyright of Kriminologisches Journal is the property of Julius Beltz GmbH & Co. KG Beltz Juventa and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This special issue of Theory and Practice of Logic Programming (TPLP) contains the regular papers accepted for presentation at the 34-th International Conference on Logic Programming (ICLP 2018), held in Oxford, United Kingdom, from July 14th to July 17th, 2018. [ABSTRACT FROM AUTHOR]

This paper uses Land Tax records to attempt to reconstruct the pattern of urbanization in a Pennine fringe township which formed part of the Lancashire cotton complex during the early industrial revolution. It uses logic programming to articulate rules to develop a longitudinal approach which chains together individual Land Tax records for successive years to identify perduring property objects, which are then located geographically using the pooled descriptors drawn from the returns. It investigates not only house repopulation, but also the character of new property development, of sub-division and amalgamation of holdings and the changing control of housing. It allows a remarkably detailed reconstruction of change in the particular locality, revealing events that have gone unnoticed. Pent-up demand associated with proto-industrialization combined with the self-interest of a major absentee landlord to allow a flurry of small scale construction between 1785 and 1805; property then converted to workers' housing with the onset of industrial urbanism. More generally, it is suggested that a computational approach of this sort allows for a more serious engagement with a source all too often dismissed as unpromising. The paper concludes by drawing out implications of the work for more traditional approaches to interpreting Land Tax returns. [ABSTRACT FROM AUTHOR]