Switch to: References

Citations of:

Fuzzy Logic and Higher-Order Vagueness

In Petr Cintula, Chris Fermüller, Lluis Godo & Petr Hájek (eds.), Logical Models of Reasoning with Vague Information. pp. 1--19 (2011)

Add citations

You must login to add citations.
  1. Plurivaluationism, supersententialism and the problem of the many languages.Rohan Sud - 2020 - Synthese 197 (4):1697-1723.
    According to the plurivaluationist, our vague discourse doesn’t have a single meaning. Instead, it has many meanings, each of which is precise—and it is this plurality of meanings that is the source of vagueness. I believe plurivaluationist positions are underdeveloped and for this reason unpopular. This paper attempts to correct this situation by offering a particular development of plurivaluationism that I call supersententialism. The supersententialist leverages lessons from another area of research—the Problem of the Many—in service of the plurivaluationist position. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Modeling Gender as a Multidimensional Sorites Paradox.Rory W. Collins - 2021 - Hypatia 36 (2):302–320.
    Gender is both indeterminate and multifaceted: many individuals do not fit neatly into accepted gender categories, and a vast number of characteristics are relevant to determining a person's gender. This article demonstrates how these two features, taken together, enable gender to be modeled as a multidimensional sorites paradox. After discussing the diverse terminology used to describe gender, I extend Helen Daly's research into sex classifications in the Olympics and show how varying testosterone levels can be represented using a sorites argument. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • AI-Completeness: Using Deep Learning to Eliminate the Human Factor.Kristina Šekrst - 2020 - In Sandro Skansi (ed.), Guide to Deep Learning Basics. Springer. pp. 117-130.
    Computational complexity is a discipline of computer science and mathematics which classifies computational problems depending on their inherent difficulty, i.e. categorizes algorithms according to their performance, and relates these classes to each other. P problems are a class of computational problems that can be solved in polynomial time using a deterministic Turing machine while solutions to NP problems can be verified in polynomial time, but we still do not know whether they can be solved in polynomial time as well. A (...)
    $42.30 used   $86.08 new   $94.50 from Amazon    (collection)    View on Amazon.com
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•