2000/03/01 by Petr Hájek, J. B. Paris, J. C. Shepherdson · 2 citations
Computer Science · Decision Sciences · #Advanced Algebra and Logic #Multi-Criteria Decision Making #Rough Sets and Fuzzy Logic
paper · doi:10.2307/2586541
openalex publication_date 2000/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/11
Abstract Can one extend crisp Peano arithmetic PA by a possibly many-valued predicate Tr( x ) saying “ x is true” and satisfying the “dequotation schema” for all sentences φ? This problem is investigated in the frame of Łukasiewicz infinitely valued logic.