From Hilbert To Dilbert

This book took an unconventional theme because we submit an unorthodox theme too. Karl Popper’s epistemology suggests that when the theory is refuted by observation, then it is time to look for a set of new approaches. In the first chapter, it is shown that Hilbert’s axiomatic program has failed not only by experiment (Mie theory does not agree with experiment) but also in terms of logic (Gödel theorem). Therefore we set out a new approach, starting from an old theory of Isaac Newton. Dilbert cartoon series often offer surprising for old problems, especially in this era of corporatocracy. Now we would call such an out-of-the-box solution to the old Hilbert axiomatic program as Dilbert way (or Dilbertian, if you wish). Readers may ask : but what can physicists learn from Dilbert cartoons? While it seems not obvious at first glance, yes we believe there is a great character of Dilbert cartoon, i.e. to put it in one phrase: “out-of-thebox and brutally honest.” From managers who tend to criticize other folks, only to make him/her looks smart. Or people who often send “FYI emails” only to make him/her looks managing well. We do think that such a brutal honesty is also needed in many fields of physics: from theoretical physics to applied physics, as will be discussed throughout this book.

This eighth volume of Collected Papers includes 75 papers comprising 973 pages on (theoretic and applied) neutrosophics, written between 2010-2022 by the author alone or in collaboration with the following 102 co-authors (alphabetically ordered) from 24 countries: Mohamed Abdel-Basset, Abduallah Gamal, Firoz Ahmad, Ahmad Yusuf Adhami, Ahmed B. Al-Nafee, Ali Hassan, Mumtaz Ali, Akbar Rezaei, Assia Bakali, Ayoub Bahnasse, Azeddine Elhassouny, Durga Banerjee, Romualdas Bausys, Mircea Boșcoianu, Traian Alexandru Buda, Bui Cong Cuong, Emilia Calefariu, Ahmet Çevik, Chang Su Kim, Victor Christianto, Dae Wan Kim, Daud Ahmad, Arindam Dey, Partha Pratim Dey, Mamouni Dhar, H. A. Elagamy, Ahmed K. Essa, Sudipta Gayen, Bibhas C. Giri, Daniela Gîfu, Noel Batista Hernández, Hojjatollah Farahani, Huda E. Khalid, Irfan Deli, Saeid Jafari, Tèmítópé Gbóláhàn Jaíyéolá, Sripati Jha, Sudan Jha, Ilanthenral Kandasamy, W.B. Vasantha Kandasamy, Darjan Karabašević, M. Karthika, Kawther F. Alhasan, Giruta Kazakeviciute-Januskeviciene, Qaisar Khan, Kishore Kumar P K, Prem Kumar Singh, Ranjan Kumar, Maikel Leyva-Vázquez, Mahmoud Ismail, Tahir Mahmood, Hafsa Masood Malik, Mohammad Abobala, Mai Mohamed, Gunasekaran Manogaran, Seema Mehra, Kalyan Mondal, Mohamed Talea, Mullai Murugappan, Muhammad Akram, Muhammad Aslam Malik, Muhammad Khalid Mahmood, Nivetha Martin, Durga Nagarajan, Nguyen Van Dinh, Nguyen Xuan Thao, Lewis Nkenyereya, Jagan M. Obbineni, M. Parimala, S. K. Patro, Peide Liu, Pham Hong Phong, Surapati Pramanik, Gyanendra Prasad Joshi, Quek Shio Gai, R. Radha, A.A. Salama, S. Satham Hussain, Mehmet Șahin, Said Broumi, Ganeshsree Selvachandran, Selvaraj Ganesan, Shahbaz Ali, Shouzhen Zeng, Manjeet Singh, A. Stanis Arul Mary, Dragiša Stanujkić, Yusuf Șubaș, Rui-Pu Tan, Mirela Teodorescu, Selçuk Topal, Zenonas Turskis, Vakkas Uluçay, Norberto Valcárcel Izquierdo, V. Venkateswara Rao, Volkan Duran, Ying Li, Young Bae Jun, Wadei F. Al-Omeri, Jian-qiang Wang, Lihshing Leigh Wang, Edmundas Kazimieras Zavadskas.

In this short communication, we review seven applications of NFL that we have explored in a number of papers: (1) Background: the purpose of this study is to review how neutrosophic logic can be found useful in a number of diverse areas of interest; (2) Methods: we use logical analysis based on NL; (3) Results: some fields of study may be found elevated after analyzed by NL theory; and (4) Conclusions: we can expect NL theory to be applied in many areas of research too, in applied mathematics, economics, and physics. Hopefully the readers will find a continuing line of thoughts in our research from the last few years.

This volume consists of the proceedings of the 22nd International Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002), organized under the auspices of the Indian Association for Research in Computing Science (IARCS). The conference was held at the Indian Institute of Technology, Kanpur during December 12–14, 2002. The conference attracted 108 submissions (of which two were withdrawn). Of these, a total of 26 papers were selected for presentation in the conference. As in the last year, the PC meeting was held electronically (stretching over nearly three weeks in August 2002) and was a great success. In addition to the contributed papers, we had ?ve invited speakers this year: Hendrik Lenstra, Jr., Harry Mairson, Dale Miller, Chih-Hao Luke Ong, and Margus Veanes. We thank them for accepting our invitation and for providing abstracts (or even full papers) for the proceedings. Two workshops were organized in conjunction with the conference – both in Kanpur. A workshop on Parameterized Complexity was held during December 10–11, organized by Mike Fellows and Venkatesh Raman. The second workshop actually consisted of three miniworkshops: on Coding Theory by Madhu Sudan; on Finite Field Algorithms by Hendrik Lenstra, Jr.; and on Sieve Theory by R. Balasubramanian. We wish to thank all the reviewers and PC members who contributed greatly to making the conference a success. We also wish to thank the team at Springer- Verlag for their help in preparing the proceedings.

The Curry-Howard isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found in type theory. For instance,minimal propositional logic corresponds to simply typed lambda-calculus, first-order logic corresponds to dependent types, second-order logic corresponds to polymorphic types, sequent calculus is related to explicit substitution, etc.The isomorphism has many aspects, even at the syntactic level:formulas correspond to types, proofs correspond to terms, provability corresponds to inhabitation, proof normalization corresponds to term reduction, etc.But there is more to the isomorphism than this. For instance, it is an old idea---due to Brouwer, Kolmogorov, and Heyting---that a constructive proof of an implication is a procedure that transformsproofs of the antecedent into proofs of the succedent; the Curry-Howard isomorphism gives syntactic representations of such procedures. The Curry-Howard isomorphism also provides theoretical foundations for many modern proof-assistant systems (e.g. Coq).This book give an introduction to parts of proof theory and related aspects of type theory relevant for the Curry-Howard isomorphism. It can serve as an introduction to any or both of typed lambda-calculus and intuitionistic logic. Key features- The Curry-Howard Isomorphism treated as common theme- Reader-friendly introduction to two complementary subjects: Lambda-calculus and constructive logics- Thorough study of the connection between calculi and logics- Elaborate study of classical logics and control operators- Account of dialogue games for classical and intuitionistic logic- Theoretical foundations of computer-assisted reasoning · The Curry-Howard Isomorphism treated as the common theme.· Reader-friendly introduction to two complementary subjects: lambda-calculus and constructive logics · Thorough study of the connection between calculi and logics.· Elaborate study of classical logics and control operators.· Account of dialogue games for classical and intuitionistic logic.· Theoretical foundations of computer-assisted reasoning

This book constitutes the refereed proceedings of the 19th European Symposium on Programming, ESOP 2010, held in Paphos, Cyprus, in March 2010, as part of ETAPS 2010, the European Joint Conferences on Theory and Practice of Software. The 30 revised full papers, presented together with two invited talks (one abstract and one full), were carefully reviewed and selected from 121 full paper submissions. The topics addressed include programming paradigms and styles, methods and tools to write and specify programs and languages, methods and tools for reasoning about programs, methods and tools for implementation, and concurrency and distribution.

For the better part of a century, attempts to explain what was really going on in the quantum world seemed doomed to failure. But recent technological advances have made the question both practical and urgent. A brilliantly imaginative group of physicists at Oxford University have risen to the challenge. This is their story. At long last, there is a sensible way to think about quantum mechanics. The new view abolishes the need to believe in randomness, long-range spooky forces, or conscious observers with mysterious powers to collapse cats into a state of life or death. But the new understanding comes at a price: we must accept that we live in a multiverse wherein countless versions of reality unfold side-by-side. The philosophical and personal consequences of this are awe-inspiring. The new interpretation has allowed imaginative physicists to conceive of wonderful new technologies: measuring devices that effectively share information between worlds and computers that can borrow the power of other worlds to perform calculations. Step by step, the problems initially associated with the original many-worlds formulation have been addressed and answered so that a clear but startling new picture has emerged. Just as Copenhagen was the centre of quantum discussion a lifetime ago, so Oxford has been the epicenter of the modern debate, with such figures as Roger Penrose and Anton Zeilinger fighting for single-world views, and David Deutsch, Lev Vaidman and a host of others for many-worlds. An independent physicist living in Oxford, Bruce has had a ringside seat to the debate. In his capable hands, we understand why the initially fantastic sounding many-worlds view is not only a useful way to look at things, but logically compelling. Parallel worlds are as real as the distant galaxies detected by the Hubble Space Telescope, even though the evidence for their existence may consist only of a few photons.