View year:

  1. A few little steps beyond Knuth’s Boolean Logic Table with Neutrosophic Logic: A Paradigm Shift in Uncertain Computation.Florentin Smarandache & Victor Christianto - 2023 - Prospects for Applied Mathematics and Data Analysis 2 (2):22-26.
    The present article delves into the extension of Knuth’s fundamental Boolean logic table to accommodate the complexities of indeterminate truth values through the integration of neutrosophic logic (Smarandache & Christianto, 2008). Neutrosophic logic, rooted in Florentin Smarandache’s groundbreaking work on Neutrosophic Logic (cf. Smarandache, 2005, and his other works), introduces an additional truth value, ‘indeterminate,’ enabling a more comprehensive framework to analyze uncertainties inherent in computational systems. By bridging the gap between traditional boolean operations and the indeterminacy present in various (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  2. Beyond Negation and Excluded Middle: An exploration to Embrace the Otherness Beyond Classical Logic System and into Neutrosophic Logic.Florentin Smarandache & Victor Christianto - 2023 - Prospects for Applied Mathematics and Data Analysis 2 (2):34-40.
    As part of our small contribution in dialogue toward better peace development and reconciliation studies, and following Toffler & Toffler’s War and Antiwar (1993), the present article delves into a realm of logic beyond the traditional confines of negation and the excluded middle principle, exploring the nuances of "Otherness" that transcend classical and Nagatomo logics. Departing from the foundational premises of classical Aristotelian logic systems, this exploration ventures into alternative realms of reasoning, specifically examining Neutrosophic Logic and Klein bottle logic (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  3. Neutrosophic Treatment of Duality Linear Models and the Binary Simplex Algorithm.Maissam Jdid & Florentin Smarandache - 2023 - Prospects for Applied Mathematics and Data Analysis 2 (1).
    One of the most important theories in linear programming is the dualistic theory and its basic idea is that for every linear model has dual linear model, so that solving the original linear model gives a solution to the dual model. Therefore, when we solving the linear programming model, we actually obtain solutions for two linear models. In this research, we present a study of the models. The neutrosophic dual and the binary simplex algorithm, which works to find the optimal (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
 Previous issues
  
Next issues