Skip to main content

The Quantum Field Theory (QFT) Dual Paradigm in Fundamental Physics and the Semantic Information Content and Measure in Cognitive Sciences

  • Chapter
  • First Online:
Representation and Reality in Humans, Other Living Organisms and Intelligent Machines

Part of the book series: Studies in Applied Philosophy, Epistemology and Rational Ethics ((SAPERE,volume 28))

Abstract

In this paper we explore the possibility of giving a justification of the “semantic information” content and measure, in the framework of the recent coalgebraic approach to quantum systems and quantum computation, extended to QFT systems. In QFT, indeed, any quantum system has to be considered as an “open” system, because it is always interacting with the background fluctuations of the quantum vacuum. Namely, the Hamiltonian in QFT always includes the quantum system and its inseparable thermal bath, formally “entangled” like an algebra with its coalgebra, according to the principle of the “doubling” of the degrees of freedom (DDF) between them. This is the core of the representation theory of cognitive neuroscience based on QFT. Moreover, in QFT, the probabilities of the quantum states follow a Wigner distribution, based on the notion and measure of quasiprobability, where regions integrated under given expectation values do not represent mutually exclusive states. This means that a computing agent, either natural or artificial, in QFT, against the quantum Turing machine paradigm, is able to change dynamically the representation space of its computations. This depends on the possibility of interpreting QFT system computations within the framework of category theory logic and its principle of duality between opposed categories, such as the algebra and coalgebra categories of QFT. This allows us to justify and not only to suppose, like in the “theory of strong semantic information” of L. Floridi, the definition of modal “local truth” and the notion of semantic information as a measure of it, despite both measures being defined on quasiprobability distributions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Notes

  1. 1.

    For the notion of “finitary” computation, as distinguished from “infinitistic” (second-order computation) and “finististic” (Turing-like computation), see [11]. This notion depends on the category theory (CT) interpretation of logic and computation [12], as far as based on Aczel’s non-well founded (NWF) set theory [13], justifying a coalgebraic semantics in quantum computing [14], as far as based on the CT principle of the dual equivalence between a Boolean initial algebra and a final coalgebra [15, 16]. The key notion of the doubling of the degrees of freedom between a q-deformed Hopf algebra and a q-deformed Hopf coalgebra, as representing each quantum system in quantum field theory, perfectly satisfies such a logic, as we see below.

  2. 2.

    It is useful to recall here that the canonical variables (e.g. position and momentum) of a quantum particle do not commute among themselves, like in classical mechanics, because of Heisenberg’s uncertainty principle. The fundamental discovery of D. Hilbert consists in demonstrating that each canonical variable of a quantum particle commutes with the Fourier transform of the other (such a relationship constitutes a CCR), allowing a geometrical representation of all the states of a quantum system in terms of a commuting variety, i.e. the relative “Hilbert space”.

  3. 3.

    We recall that typical example of function composition is a recursive, iterated function: x n+1 = f (x n ).

  4. 4.

    We recall here that by an “ultrafilter” we mean the maximal partially ordered set defined on the power set of a given set ordered by inclusion, and excluding the empty set.

  5. 5.

    Two corollaries of the Lövenheim–Skolem theorem, demonstrated by Skolem himself in 1925, are significant for our aims, i.e. (1) that only complete theories are categorical, and (2) that the cardinality of an algebraic set depends intrinsically by the algebra defined on it. Think, for instance of the principle of induction by recursion for Boolean algebras, allowing a Boolean algebra to construct the sets on which its semantics is justified, blocking however Boolean computability on finite sets. It is evident that Zermelo’s strategy of migrating to second-order set-theoretic semantics grants categoricity to mathematics on an infinitistic basis.

  6. 6.

    Recall that set self-inclusion is not allowed for standard sets because of Cantor’s theorem. This impossibility is the root of all semantic antinomies in standard set theory, from which the necessity of a second-order set-theoretic semantics ultimately derives.

  7. 7.

    This depends on the trivial observation that a coalgebra C = 〈C,γ : C → ΩC 〉, where γ is a transition function characterizing C, over an endofunctor Ω: C → C can be seen also as an algebra in the opposite category C op, i.e. Coalg(Ω) = (Alg(Ω op)op [16, p. 417].

  8. 8.

    The fundamental property of \(\mathcal{V}\) is that it is the counterpart of the power set functor ℘ in the category of the topological spaces (i.e. for continuous functions) such as the Stone space category, Stone. This functor maps a set S to its power set ℘(S) and a function fS → S’ to the image map ℘f given by (℘f) (X) ≔ f [X] (= { f(x) | x ∈ X}). Applied to Kripke’s relational semantics in modal logic, this means that Kripke’s frames and models are nothing but “coalgebras in disguise”. Indeed, a frame is a set of “possible worlds” (subsets, s) of a given “universe” (set, S) and a binary “accessibility” relation R between worlds, R ⊆ S × S. A Kripke’s model is thus a frame with an evaluation function defined on it. Now R can be represented by the function R[•]: S → ℘(S), mapping a point s to the collection R[s] of its successors. In this way, frames in modal logic correspond to coalgebras over the covariant power set functor ℘. For such a reconstruction see [16, p. 391].

  9. 9.

    However, see the fundamental remarks about the limits of decidability and computability in this first-order modal logic semantic approach in [76], in which it is said, just in the conclusion, that one of the most promising research programs in this field is related to the coalgebraic approach to modal logic semantics.

  10. 10.

    This depends on the fact that contravariance in QM algebraic representation theory can have only an indirect justification, as Abramsky elegantly explained in his just quoted paper. QM algebraic formalism is, indeed, intrinsically based on von Neumann’s covariant algebra, so that only Hopf algebras’ self-duality are “naturally” (in the algebraic sense of the allowed functorial transforms) justified in it [62, 80, 81].

  11. 11.

    In this regard, the famous Aristotelian statement synthesizing his “intentional” approach to epistemology—“not the stone is in the mind, but the form of the stone”—has an operational counterpart in the homomorphism algebra coalgebra of QFT neuro dynamics.

  12. 12.

    This result has been recently formally obtained [85]. For an intuitive explanation of this result, see below the two Appendices, Sects. 7.17.2.

  13. 13.

    In parenthesis, in the machine \({\mathbb{M}}\) the general coalgebraic principle of the observational (or behavioral) equivalence among states holds in the following way. Indeed, for every two coalgebras (systems) \({\mathbb{S}}_{1} ,{\mathbb{S}}_{2} \in {\mathbf{Coalg}}\left( {C \times {\mathcal{I}}} \right),\;\left( {!c_{{{\mathbb{S}}_{1} }} = !c_{{{\mathbb{S}}_{2} }} } \right) \Rightarrow \left( {!x_{{{\mathbb{S}}_{1} }} = !x_{{{\mathbb{S}}_{2} }} } \right).\) All scholars agree that this has an immediate meaning for quantum systems logic and mathematics, as a further justification for a coalgebraic interpretation of quantum systems.

  14. 14.

    A condition elegantly satisfied in the QFT formalism by the fractal structure of the systems phase space and, therefore, by the chaotic character of the macroscopic trajectories (phase transitions) defined on it, generally [88], and specifically in dissipative brain dynamics [32].

  15. 15.

    Remember that the transitive rule in the NWF set theory does not hold only for the inclusion operation, i.e. for the superset/subset ordering relation.

References

  1. Patton, C.M., Wheeler, J.A.: Is physics legislated by cosmogony? In: Isham, C.J., Penrose, R., Sciama, D.W. (eds.) Quantum Gravity, pp. 538–605. Clarendon Press, Oxford (1975)

    Google Scholar 

  2. Feynman, R.: Simulating physics with computers. Int. J. Theor. Phys. 21, 467–488 (1982)

    Article  MathSciNet  Google Scholar 

  3. Wheeler, J.A.: Information, physics, quantum: the search for links. In: Zurek, W.H. (eds.) Complexity, Entropy, and the Physics of Information. Addison-Wesley, Redwood City (1990)

    Google Scholar 

  4. Deutsch, D.: Quantum theory, the church-turing principle and the universal quantum computer. Proc. R. Soc. Lond. A 400, 97–117 (1985)

    Article  MathSciNet  Google Scholar 

  5. Rovelli, C.: Relational quantum mechanics. Int. J. Theor. Phys. 35, 1637–1678 (1996)

    Article  MathSciNet  Google Scholar 

  6. Zenil, H. (ed.): A computable universe. Understanding and exploring nature as computation. Foreword by Sir Roger Penrose. World Scientific Publishing, Singapore (2013)

    Google Scholar 

  7. Fields, C.: If physics is an information science, what is an observer? Information 3(1), 92–123 (2012)

    Article  Google Scholar 

  8. Zeh, H.D.: Wave function: ‘it’ or ‘bit’? In: Barrow, J.D., Davies, P.C.W., Harper Jr., C.L. (eds.) Science and Ultimate Reality, pp. 103–120. Cambridge University Press, Cambridge (2004)

    Google Scholar 

  9. Zeh, H.D.: Quantum discreteness is an illusion. Found. Phys. 40, 1476–1493 (2010)

    Article  MathSciNet  Google Scholar 

  10. Tegmark, M.: How unitary cosmology generalizes thermodynamics and solves the inflactionary entropy problem (2011). http://arxiv.org/pdf/1108.3080.pdf. [Accessed 16 March 2012]

  11. Blackburn, P., van Benthem, J.: Modal logic: a semantic perspective. In: Blackburn, P., van Benthem, F.J.F., Wolter, F. (eds.) Handbook of Modal Logic, pp. 2–85. Elsevier, Amsterdam (2007)

    MATH  Google Scholar 

  12. Abramsky, S., Tzevelekos, N.: Introduction to categories and categorical logic. In: Coecke, B. (ed.) New Structures for Physics. Lecture Notes in Physics, vol. 813, pp. 3–94. Springer, Berlin-New York (2011)

    Chapter  Google Scholar 

  13. Forti, M., Honsell, F.: Set theory with free construction principles. Scuola Normale Superiore—Pisa Classe de Scienza. Serie IV, vol. 10, pp. 493–522 (1983)

    Google Scholar 

  14. Abramsky, S.: Coalgebras, Chu spaces, and representations of physical systems. J. Phil. Log. 42(3), 551–574 (2013)

    Article  MathSciNet  Google Scholar 

  15. Aczel, P.: Non-well-founded sets. In: CLSI Lecture Notes, vol. 14 (1988)

    Google Scholar 

  16. Aczel, P., Mendler, N.P.: A final coalgebra theorem. In: Category Theory and Computer Science. London, UK (1989)

    Google Scholar 

  17. Blasone, M., Jizba, P., Vitiello, G.: Quantum field theory and its macroscopic manifestations. Boson condensation, ordered patterns and topological defects. Imperial College Press, London (2011)

    Google Scholar 

  18. Del Giudice, E., Pulselli, R., Tiezzi, E.: Thermodynamics of irreversible processes and quantum field theory: an interplay for understanding of ecosystem dynamics. Ecol. Model. 220, 1874–1879 (2009)

    Google Scholar 

  19. Von Neumann, J.: Mathematical Foundations of Quantum Mechanics. Princeton University Press, Princeton (1955)

    MATH  Google Scholar 

  20. Goldstone, J.: Field theories with superconductor solutions. Nuovo Cimento 19, 154–164 (1961)

    Article  MathSciNet  Google Scholar 

  21. Goldstone, J., Salam, A., Weinberg, S.: Broken symmetries. Phys. Rev. 127, 965–970 (1962)

    Article  MathSciNet  Google Scholar 

  22. Vitiello, G.: Links. Relating different physical systems through the common QFT algebraic structure. Lect. Notes Phys. 718, 165–205 (2007)

    Article  MathSciNet  Google Scholar 

  23. Nambu, Y.: Quasiparticles and gauge invariance in the theory of superconductivity. Phys. Rev. 117, 648–663 (1960)

    Article  MathSciNet  Google Scholar 

  24. Itzykson, C., Zuber, J.: Quantum Field Theory. McGraw-Hill, New York (1980)

    Google Scholar 

  25. Umezawa, H.: Advanced field theory: micro, macro and thermal concepts. American Institute of Physics, New York (1993)

    Google Scholar 

  26. Umezawa, H.: Development in concepts in quantum field theory in half century. Math. Jpn. 41, 109–124 (1995)

    Google Scholar 

  27. Vitiello, G.: The dissipative brain. In: Globus, G.G., Pribram, K.H., Vitiello, G. (eds.) Brain and Being—At the Boundary Between Science, Philosophy, Language and Arts, pp. 317–330. John Benjamins, Amsterdam (2004)

    Google Scholar 

  28. Basti, G.: Intelligence and reference. Formal ontology of the natural computation. In: Dodig-Crnkovic, G., Giovagnoli, R. (eds.) Computing Nature. Turing Centenary Perspective, pp. 139–159. Springer, Berlin-Heidelberg (2013)

    Google Scholar 

  29. Basti, G.: A change of paradigm in cognitive neurosciences comment on: “Dissipation of ‘dark energy’ by cortex in knowledge retrieval” by Capolupo, Freeman and Vitiello. Phys. Life Rev. 5(10), 97–98 (2013)

    Article  Google Scholar 

  30. Freeman, W.J., Vitiello, G.: Nonlinear brain dynamics as macroscopic manifestation of underlying many-body field dynamics. Phys. Life Rev. 3(2), 93–118 (2006)

    Article  Google Scholar 

  31. Freeman, W.J., Vitiello, G.: Dissipation and spontaneous symmetry breaking in brain dynamics. J. Phys. A: Math. Theor. 41(30), 304042 (2008)

    Article  MathSciNet  Google Scholar 

  32. Vitiello, G.: Coherent states, fractals and brain waves. New Math. Nat. Comput. 5(1), 245–264 (2009)

    Article  Google Scholar 

  33. Freeman, W.J.: Origin, structure, and role of background EEG activity. Part 1. Analytic amplitude. Clin. Neurophysiol. 115, 2077–2088 (2004)

    Article  Google Scholar 

  34. Freeman, W.J.: Origin, structure, and role of background EEG activity. Part 2. Analytic phase. Clin. Neurophysiol. 115, 2089–2107 (2004)

    Article  Google Scholar 

  35. Freeman, W.J.: Origin, structure, and role of background EEG activity. Part 3. Neural frame classification. Clin. Neurophysiol. 116, 111–1129 (2005)

    Article  Google Scholar 

  36. Freeman, W.J.: Origin, structure, and role of background EEG activity. Part 4. Neural frame simulation. Clin. Neurophysiol. 117, 572–589 (2006)

    Article  Google Scholar 

  37. Freeman, W.J., Burke, B.C., Holmes, M.D., Vanhatalo, S.: Spatial spectra of scalp EEG and EMG from awake humans. Clin. Neurophysiol. 114, 1055–1060 (2003)

    Article  Google Scholar 

  38. Freeman, W.J., Ga’al, G., Jornten, R.: A neurobiological theory of meaning in perception. Part 3. Multiple cortical areas synchronize without loss of local autonomy. Intern. J. Bifurc. Chaos 13, 2845–2856 (2003)

    Article  Google Scholar 

  39. Freeman, W.J., Rogers, L.J.: A neurobiological theory of meaning in perception. Part 5. Multicortical patterns of phase modulation in gamma EEG. Int. J. Bifurc. Chaos 13, 2867–2887 (2003)

    Article  Google Scholar 

  40. Schrödinger, E.: What is Life. Cambridge University Press, Cambridge (1944)

    Google Scholar 

  41. Szent-György, A.: An Introduction to Sub-molecular Biology. New York (1960)

    Google Scholar 

  42. Frölich, H.: Long range coherence and energy storage in biological systems. Int. J. Quantum Chem. 2, 641ff. (1968)

    Article  Google Scholar 

  43. Frölich, H. (ed.): Biological Coherence and Response to External Stimuli. Springer, Berlin (1988)

    Google Scholar 

  44. Ho, M.W.: What is (Schrödinger’s) negentropy. Modern Trends in BioThermoKinetics, vol. 3, pp. 50–61 (1994)

    Google Scholar 

  45. Szilard, L.: On the decrease of entropy content in a thermodynamical system by the intervention of intelligent beings. Behav. Sci. 9(4), 301–310 (1964)

    Article  Google Scholar 

  46. Brillouin, L.: Science and Information Theory. Academic Press, New York (1962)

    MATH  Google Scholar 

  47. Capolupo, A., Freeman, W.J., Vitiello, G.: Dissipation of dark energy by cortex in knowledge retrieval. Phys. Life Rev. 10(1), 85–94 (2013)

    Article  Google Scholar 

  48. Shannon, C.E.: The mathematical theory of communication. University of Illinois Press, Urbana (1949)

    MATH  Google Scholar 

  49. MacKay, D.M.: Information, Mechanism, and Meaning. MIT Press (1969)

    Google Scholar 

  50. Carnap, R., Bar-Hillel, Y.: An outline of a theory of semantic information. In: Language and Information: Selected Essays on Their Theory and Application, pp. 221–274. Addison-Wesley, Reading (1964)

    Google Scholar 

  51. Barbieri, M.: Semantic Codes. An Introduction to Semantic Biology. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  52. Deacon, T.W.: Incomplete Nature. How Mind Emerged from Matter. Norton, New York (2011)

    Google Scholar 

  53. Atmanspacher, H., Scheingraber, H.: Pragmatic information and dynamical instabilities in multimode continuous-wave dye laser. Can. J. Phys. 68, 728–737 (1990)

    Article  Google Scholar 

  54. Cahill, K.E., Glauber, R.J.: Density operators and quasiprobability distributions. Phys. Rev. 177(5), 1882–1902 (1969)

    Article  Google Scholar 

  55. Kolmogorov, A.N.: Foundations of the Theory of Probability. Second English edition. Chelsea Publishing, New York (1956)

    Google Scholar 

  56. Floridi, L.: Semantic conceptions of information. In: Zalta, E.N. (ed.) Stanford Encyclopedia of Philosophy. Spring 2011 Ed, pp. 1–70 (2011)

    Google Scholar 

  57. Sequoiah-Grayson, S.: The metaphilosophy of information. Mind. Mach. 17(3), 331–344 (2007)

    Article  Google Scholar 

  58. Carnap, R.: Meaning and Necessity: A Study in Semantics and Modal Logic. Chicago University Press, Chicago (1956)

    MATH  Google Scholar 

  59. Basti, G.: From formal logic to formal ontology. The new dual paradigm in natural sciences. In: Proceedings of 1st CLE Colloquium for Philosophy and History of Formal Sciences, Campinas, 21–23 March 2013, Campinas-Rome (2016)

    Google Scholar 

  60. Dodig-Crnkovic, G.: System modelling and information semantics. In: Bubenkojr, J. et al. (ed.) Proceedings of the Fifth Conference for the Promotion of Research in IT. New Universities and University Colleges in Sweden, Lund, Studentlitteratur (2005)

    Google Scholar 

  61. Basti, G.: The Formal Ontology of the Natural Realism. Sociedade Brasileira de Historia de Matematica, Campinas (2014)

    Google Scholar 

  62. Connes, A., Rovelli, C.: Von Neumann algebra automorphisms and time-thermodynamics relation in general covariant quantum theories. Class. Quantum Gravity 11, 2899–2918 (1994)

    Article  MathSciNet  Google Scholar 

  63. Stone, M.H.: The theory of representation for Boolean algebras. Trans. Am. Math. Soc. 40, 37–111 (1936)

    MathSciNet  MATH  Google Scholar 

  64. Abramsky, S.: A Cook’s tour of the finitary non-well-founded sets (original lecture: 1988). In: Artemov, S., Barringer, H., d’Avila, A., Lamb, L.C., Woods, J. (eds.) Essays in Honor of Dov Gabbay, vol. I, pp. 1–18. Imperial College Publication, London (2005)

    Google Scholar 

  65. Venema, Y.: Algebras and co-algebras. In: Blackburn, P., van Benthem, F.J.F., Wolter, F. (eds.) Handbook of Modal Logic, pp. 331–426. Elsevier, Amsterdam (2007)

    Chapter  Google Scholar 

  66. Schröder, E.: Vorlesungen über die Algebra der Logik. (Exakte Logik), vol. 1. B. G. Teubner, Leipzig (1890)

    Google Scholar 

  67. Tarski, A.: The concept of truth in formalized languages. In: Corcoran, J. (ed.) Logic, Semantics, Metamathematics, 2, pp. 152–278. Indianapolis, Hackett (1983)

    Google Scholar 

  68. Gödel, K.: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme, I. Monatshefte für Mathematik und Physik, vol. 38, pp. 173–98 (1931)

    Google Scholar 

  69. Sangiorgi, D.: Origins of bisimulation and coinduction. In: Sangiorgi, D., Rutten, J. (eds.) Advanced Topics in Bisimulation and Coinduction, pp. 1–37. Cambridge University Press, Cambridge (2012)

    Google Scholar 

  70. Rutten, J.J.M.: Universal coalgebra: a theory of systems. Theoret. Comput. Sci. 249(1), 3–80 (2000)

    Article  MathSciNet  Google Scholar 

  71. Van Benthem, J.: Correspondence theory. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic: Vol 2, pp. 167–247. Dordrecht, Reidel (1984)

    Google Scholar 

  72. Moss, L.S.: Coalgebraic logic. Ann. Pure Appl. Logic 96, 277–317 (1999)

    Article  MathSciNet  Google Scholar 

  73. Moss, L.S.: Erratum to “Coalgebraic logic”. [Ann. Pure Appl. Logic 96 (1999) 277-317]. Ann. Pure Appl. Logic 99, 241–259 (1999)

    Article  MathSciNet  Google Scholar 

  74. Kurz, A.: Specifying coalgebras with modal logic. Theoret. Comput. Sci. 210, 119–138 (2001)

    Article  MathSciNet  Google Scholar 

  75. Kupke, C., Kurz, A., Venema, Y.: Stone coalgebras. Theor. Comput. Sci. 327, 109–134 (2004)

    Article  MathSciNet  Google Scholar 

  76. Thomason, S.K.: Reduction of second-order logic to modal logic. Math. Logic Q. 21(1), 107–114 (1975)

    Article  MathSciNet  Google Scholar 

  77. Van Benthem, J.: Modal correspondence theory. Ph.D. thesis, Dept. of Mathematics. Amsterdam University Press, Amsterdam (1976)

    Google Scholar 

  78. Coecke, B. (ed.) New Structures for Physics. Lecture Notes in Physics, vol. 813. Springer, Berlin-New York (2011)

    MATH  Google Scholar 

  79. Basti, G., Capolupo, A., Vitiello, G.: Quantum field theory and coalgebraic logic in theoretical computer science. Progress in Biophysics and Molecular Biology  (preprint) (2017). https://doi.org/10.1016/j.pbiomolbio.2017.04.006

    Article  Google Scholar 

  80. Heller, M.: Algebraic self duality as the ‘ultimate explanation’. Fund. Sci. 9, 369–385 (2004)

    Article  MathSciNet  Google Scholar 

  81. Vitiello, G.: Fractals, coherent states and self-similarity induced noncommutative geometry. Phys. Lett. A 376, 2527 (2012)

    Article  MathSciNet  Google Scholar 

  82. Basti, G.: L’idea di scienza di Maritain fra passato e futuro. Aquinas 58(1–2), 117–165 (2015)

    Google Scholar 

  83. Sakellariadou, M., Stabile, A., Vitiello, G.: Noncommutative spectral geometry, algebra doubling, and the seed of quantization. Phys. Rev. D 84, 045026 (2011)

    Article  Google Scholar 

  84. Hinton, G.E., Osindero, S., Teh, Y.-W.: A fast learning algorithm for deep belief nets. Neural Comput. 18(7), 1527–1554 (2006)

    Article  MathSciNet  Google Scholar 

  85. Majid, S.: Quantum groups primer. Cambridge University Press, Cambridge (2002)

    Book  Google Scholar 

  86. Schröder, L., Pattinson, D.: Coalgebraic correspondence theory. In: Onge, L. (ed.) Foundations of Software and Computational Structures. Lecture Notes in Computer Science, vol. 6014, pp. 328–342. Springer, Berlin-New York (2010)

    Chapter  Google Scholar 

  87. Goranko, V., Otto, M.: Model theory of modal logic. In: Blackburn, P., van Benthem, F.J.F., Wolter, F. (eds.) Handbook of Modal Logic, pp. 252–331. Elsevier, Amsterdam (2007)

    Chapter  Google Scholar 

  88. Bruno, A., Capolupo, A., Kak, S., Raimondo, G., Vitiello, G.: Geometric phase and gauge theory structure in quantum computing. J. Phys. Conf. Ser. 306, 012065 (2011)

    MATH  Google Scholar 

  89. Subrata, G., et al.: Design and construction of a brain-like computer: a new class of frequency-fractal computing using wireless communication in a supramolecular organic, inorganic system. Information 5, 28–100 (2014)

    Article  Google Scholar 

  90. The 2015 Nobel Prize in Physics—Press Release. Nobelprize.org. Nobel Media AB 2014. Web. 13 Dec 2015. http://www.nobelprize.org/nobel_prizes/physics/laureates/2015/press.html, Nobelprize.org, 6 Oct 2015. [Online]. [Accessed 13 Dec 2015]

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gianfranco Basti .

Editor information

Editors and Affiliations

Appendix A

Appendix A

1.1 A.1 Induction and Coinduction as Principles of Set Definition and Proof for Boolean Lattices

The collection of clopen subsets of a Stone space, to which a Boolean algebra is isomorphic, according to the Stone theorem is effectively an ultrafilter U (or the maximal filter F) on the power set, ℘(S), of the set S. Namely, it is the maximal partially ordered set (maximal poset) within ℘(S) ordered by inclusion, i.e. (℘(S), ⊆), with the exclusion of the empty set. Any filter F is dual to an ideal I, simply obtained in set (order) theory by inverting all the relations in F, that is, x ≤ y with y ≤ x, and by substituting intersections with unions. From this derives that each ultrafilter U is dual to a greatest ideal that, in Boolean algebra, is also a prime ideal, because of the so-called prime ideal theorem, effectively a corollary of the Stone theorem, demonstrated by himself. All this, applied to the Stone theorem, means that the collection of partially ordered clopen subsets of the Stone space, to which a Boolean algebra is isomorphic, corresponds to a Boolean logic complete lattice L for a monadic first-order predicate logic. From this, the definition of induction and coinduction as dual principles of set definition and proof is immediate, as soon as we recall that the fixed point of a computation F is given by the equality x = F(x) [68, p. 46]:

Definition 2

(sets inductively/coinductively defined by F). For a complete Boolean lattice L whose points are sets, and for an endofunction F, the sets

$$\begin{array}{*{20}l} {F_{\text{ind}} : = \bigcap {\left\{ {x|F(x) \le x} \right\}} } \hfill \\ {F_{\text{coind}} : = \bigcup {\left\{ {x|x \le F(x)} \right\}} } \hfill \\ \end{array}$$

are, respectively, the sets inductively defined by a recursive F, and coinductively defined by a co-recursive F. They correspond, respectively, to the meet of the pre-fixed point and the join of the post-fixed points in the lattice L, i.e. the least and greatest fixed points, if F is monotone, as required from the definition of the category Pos (see above, Sect. 5.1).

Definition 3

(induction and coinduction proof principles). In the hypothesis of Definition 2, we have:

$$\begin{array}{*{20}l} {if\;F(x) \le x\;then\;F_{\text{ind}} \le x\,} & { ( {\text{induction}}\,{\text{as}}\,{\text{a}}\,{\text{method}}\,{\text{of}}\,{\text{proof)}}} \\ {if\;x \le F(x)\;then\;x \le F_{\text{coind}} } & {({\text{coinduction}}\,{\text{as}}\,{\text{a}}\,{\text{method}}\,{\text{of}}\,{\text{proof)}}} \\ \end{array}$$

These two definitions are the basis for the duality between an initial algebra and its final coalgebra, as a new paradigm of computability, i.e. Abramsky’s finitary one, and henceforth for the duality between the universal algebra and the universal coalgebra [15].

1.2 A.2 Extension of the Coinduction Method to the Definition of a Complete Boolean Lattice of Monadic Predicates

The fundamental result of the above-quoted Goldblatt–Thomason theorem and van Benthem theorem is that a set-tree of NWF sets—effectively a set represented as an oriented graph where nodes are sets, and edges are inclusion relations with subsets governed by Euclidean rule—corresponds to the structure of a Kripke frame of his relational semantics, characterized by a set of “worlds” and by a two-place accessibility relation R between worlds, e.g. the second graph from left below corresponds to the graph of the number 3, with u = 3, v = 2, w = 1. Therefore for understanding intuitively the extension of the coinduction method to the domains of monadic predicates of a Boolean lattice, let us start from (1) the “Euclidean rule (ER)” ‹∀u,v,w ((uRv ∧ uRw)→vRw)› (see the second from left graph below), driving all the NWF set inclusions and that is associated by van Benthem’s correspondence theorem to the modal axiom E (or 5): ‹◊α→⎕◊α›, of the modal propositional calculus, and (2) from the “seriality rule (SR)” ‹∀uv (uRv)› (an example of this axiom is given by the fourth or fifth graph below)—that has an immediate physical sense, because it corresponds to whichever energy conservation principle in physics, e.g. the I Principle of Thermodynamics—and that is associated to the modal axiom D: ‹⎕α → ◊α›. The straightforward first-order calculus, by which it is possible to formally justify the definition/justification by coinduction (tree unfolding) of an equivalence class as the domain of a given monadic predicate, through the application of the two above rules to whichever triple of objects ‹u, v, w›, is the following:

For ER, ‹∀u,v,w ((uRv ∧ uRw) → vRw)›; hence, for seriality, ‹∀u,v (uRv → vRv)›; finally: ‹∀u,v,w [((uRv ∧ uRw) → (vRw ∧ wRv ∧ vRv ∧ wRw)) ↔ ((vw) ⊂ u)]›, I.e. (vw) constitutes an equivalence subclass of u, say Y, because a “generated” transitiveFootnote 15-symmetric-reflexive relation holds among its elements, which are therefore also “descendants” of their common “ascendant”, u. More intuitively, using Kripke’s relational semantics graphs for modal logics, where ‹u, v, w› are also “possible worlds” (models) of a given universe W, and where R is the two-place “accessibility relation” between worlds, the above calculus reads:

The final graph constitutes a Kripke-like representation of the KD45 modal system, also defined in literature as “secondary S5”, since the equivalence relationship among all the possible worlds characterizing S5 here holds only for a subset of them, in our example, the subset of worlds {w, v}.

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Basti, G. (2017). The Quantum Field Theory (QFT) Dual Paradigm in Fundamental Physics and the Semantic Information Content and Measure in Cognitive Sciences. In: Dodig-Crnkovic, G., Giovagnoli, R. (eds) Representation and Reality in Humans, Other Living Organisms and Intelligent Machines. Studies in Applied Philosophy, Epistemology and Rational Ethics, vol 28. Springer, Cham. https://doi.org/10.1007/978-3-319-43784-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-43784-2_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-43782-8

  • Online ISBN: 978-3-319-43784-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics