Switch to: References

Citations of:

A complete negationless system

Studia Logica 32 (1):41 - 49 (1973)

Add citations

You must login to add citations.
  1. Anti-Realism and Anti-Revisionism in Wittgenstein’s Philosophy of Mathematics.Anderson Nakano - 2020 - Grazer Philosophische Studien 97 (3):451-474.
    Since the publication of the Remarks on the Foundations of Mathematics, Wittgenstein’s interpreters have endeavored to reconcile his general constructivist/anti-realist attitude towards mathematics with his confessed anti-revisionary philosophy. In this article, the author revisits the issue and presents a solution. The basic idea consists in exploring the fact that the so-called “non-constructive results” could be interpreted so that they do not appear non-constructive at all. The author substantiates this solution by showing how the translation of mathematical results, given by the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (2 other versions)A Negationless Interpretation Of Intuitionistic Theories.Victor N. Krivtsov - 2000 - Erkenntnis 53 (1-2):155-172.
    In a seriesof papers beginning in 1944, the Dutch mathematician and philosopherGeorge Francois Cornelis Griss proposed that constructivemathematics should be developedwithout the use of the intuitionistic negation1 and,moreover, without any use of a nullpredicate.In the present work, we give formalized versions of intuitionisticarithmetic, analysis,and higher-order arithmetic in the spirit ofGriss' ``negationless intuitionistic mathematics''and then consider their relation to thecurrent formalizations of thesetheories.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (2 other versions)A negationless interpretation of intuitionistic theories. I.Victor N. Krivtsov - 2000 - Studia Logica 64 (3):323-344.
    The present work contains an axiomatic treatment of some parts of the restricted version of intuitionistic mathematics advocated by G. F. C. Griss, also known as negationless intuitionistic mathematics.Formal systems NPC, NA, and FIMN for negationless predicate logic, arithmetic, and analysis are proposed. Our Theorem 4 in Section 2 asserts the translatability of Heyting's arithmetic HAinto NA. The result can in fact be extended to a large class of intuitionistic theories based on HAand their negationless counterparts. For instance, in Section (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations