CRIS

Permanent URI for this communityhttps://scripta.up.edu.mx/handle/20.500.12552/1

Browse

Settings

Language: search.filters.language.EnglishSubject: search.filters.subject.Computability theory

Search Results

Now showing 1 - 1 of 1
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Inconsistent sets and how to compute them
    (Springer Science and Business Media LLC, 2026)
    Cano-Jorge, Fernando  
    ;
    Weber, Zach
    The idea of a paraconsistent computability theory has been proposed as a way to work effectively with inconsistent sets of numbers. The viability of such a theory, though—the very coherence of the idea of an ‘inconsistent recursive relation’—has been called into doubt, most recently in (Choi, Synthese 200(5):418, 2022). In this paper we remove some doubt, by setting out a simple model of (naïve) set theory in LP, showing how to compute inconsistent sets in terms of extensions and antiextensions, and establishing further representability results. This suggests a way that a longstanding and apparently impossible-to-answer question—how can inconsistency be computed?—can be answered. ©The author ©Springer.