Switch to: References

Add citations

You must login to add citations.
  1. On Computable Numbers with an Application to the AlanTuringproblem.C. F. Huws & J. C. Finnis - 2017 - Artificial Intelligence and Law 25 (2):181-203.
    This paper explores the question of whether or not the law is a computable number in the sense described by Alan Turing in his 1937 paper ‘On computable numbers with an application to the Entscheidungsproblem.’ Drawing upon the legal, social, and political context of Alan Turing’s own involvement with the law following his arrest in 1952 for the criminal offence of gross indecency, the article explores the parameters of computability within the law and analyses the applicability of Turing’s computability thesis (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Arguments Whose Strength Depends on Continuous Variation.James Franklin - 2013 - Informal Logic 33 (1):33-56.
    Both the traditional Aristotelian and modern symbolic approaches to logic have seen logic in terms of discrete symbol processing. Yet there are several kinds of argument whose validity depends on some topological notion of continuous variation, which is not well captured by discrete symbols. Examples include extrapolation and slippery slope arguments, sorites, fuzzy logic, and those involving closeness of possible worlds. It is argued that the natural first attempts to analyze these notions and explain their relation to reasoning fail, so (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation