In this revolutionary work, the author sets the stage for the science of the 21st Century, pursuing an unprecedented synthesis of fields previously considered unrelated. Beginning with simple classical concepts, he ends with a complex multidisciplinary theory requiring a high level of abstraction. The work progresses across the sciences in several multidisciplinary directions: Mathematical logic, fundamental physics, computer science and the theory of intelligence. Extraordinarily enough, the author breaks new ground in all these fields. In the field of fundamental physics (...) the author reaches the revolutionary conclusion that physics can be viewed and studied as logic in a fundamental sense, as compared with Einstein's view of physics as space-time geometry. This opens new, exciting prospects for the study of fundamental interactions. A formulation of logic in terms of matrix operators and logic vector spaces allows the author to tackle for the first time the intractable problem of cognition in a scientific manner. In the same way as the findings of Heisenberg and Dirac in the 1930s provided a conceptual and mathematical foundation for quantum physics, matrix operator logic supports an important breakthrough in the study of the physics of the mind, which is interpreted as a fractal of quantum mechanics. Introducing a concept of logic quantum numbers, the author concludes that the problem of logic and the intelligence code in general can be effectively formulated as eigenvalue problems similar to those of theoretical physics. With this important leap forward in the study of the mechanism of mind, the author concludes that the latter cannot be fully understood either within classical or quantum notions. A higher-order covariant theory is required to accommodate the fundamental effect of high-level intelligence. The landmark results obtained by the author will have implications and repercussions for the very foundations of science as a whole. Moreover, Stern's Matrix Logic is suitable for a broad spectrum of practical applications in contemporary technologies. (shrink)

In this pioneering work, the author develops a fundamental formulation of logic in terms of theory of matrices and vector spaces. The discovery of matrix logic represents a landmark in the further formalization of logic. For the first time the power of direct mathematical computation is applied to the whole set of logic operations, allowing the derivation of both the classical and modal logics from the same formal base. The new formalism allows the author to enlarge the alphabet (...) of the truth-values with negative logic antivalues and to link matrix logic descriptions with the Dirac formulation of quantum theory - a result having fundamental implications and repercussions for science as a whole. As a unified language which permits a logical examination of the underlying phenomena of quantum field theory and vice versa, matrix logic opens new avenues for the study of fundamental interactions and gives rise to a revolutionary conclusion that physics as such can be viewed and studied as a logic in the fundamental sense. Finally, modelling itself on exact sciences, matrix logic does not refute the classical logic but instead incorporates it as a special deterministic limit. The book requires multidisciplinary knowledge and will be of interest to physicists, mathematicians, computer scientists and engineers. (shrink)

The paper offers a matrix-based logic (relevant matrix quantum physics) for propositions which seems suitable as an underlying logic for empirical sciences and especially for quantum physics. This logic is motivated by two criteria which serve to clean derivations of classical logic from superfluous redundancies and uninformative complexities. It distinguishes those valid derivations (inferences) of classical logic which contain superfluous redundancies and complexities and are in this sense from those which are or in the sense of allowing only (...) the most informative consequences in the derivations. The latter derivations are strictly valid in RMQ, whereas the former are only materially valid. RMQ is a decidable matrix calculus which possesses a semantics and has the finite model property. It is shown in the paper how RMQ by its strictly valid derivations can avoid the difficulties with commensurability, distributivity, and Bell's inequalities when it is applied to quantum physics. (shrink)

The aim of this paper is to define the logical system Sm4 characterised by the degree of truth-preserving consequence relation defined on the ordered set of values of Smiley’s four-element matrix MSm4. The matrix MSm4 has been of considerable importance in the development of relevant logics and it is at the origin of bilattice logics. It will be shown that Sm4 is a most interesting paraconsistent logic which encloses a sound theory of logical necessity similar to (...) that of Anderson and Belnap’s logic of entailment E. Intuitively, Sm4 can be described as a four-valued expansion of the positive fragment of Lewis’ S5 or, alternatively, as a four-valued version of S5. (shrink)

We provide a logical matrix semantics and a Gentzen-style sequent calculus for the first-degree entailments valid in W. T. Parry’s logic of Analytic Implication. We achieve the former by introducing a logical matrix closely related to that inducing paracomplete weak Kleene logic, and the latter by presenting a calculus where the initial sequents and the left and right rules for negation are subject to linguistic constraints.

The aim of this paper is to show that the operations of forming direct products and submatrices suffice to construct exhaustive semantics for all structural strengthenings of the consequence determined by a given class of logical matrices.

The present article shows that there are consistent and decidable manyvalued systems of propositional logic which satisfy two or all the three criteria for non-trivial inconsistent theories by da Costa . The weaker one of these paraconsistent system is also able to avoid a series of paradoxes which come up when classical logic is applied to empirical sciences. These paraconsistent systems are based on a 6-valued system of propositional logic for avoiding difficulties in several domains of empirical science ).

A recent rethinking of the early history of Quantum Mechanics deemed the late 1920s agreement on the equivalence of Matrix Mechanics and Wave Mechanics, prompted by Schrödinger’s 1926 proof, a myth. Schrödinger supposedly failed to achieve the goal of proving isomorphism of the mathematical structures of the two theories, while only later developments in the early 1930s, especially the work of mathematician John von Neumman (1932) provided sound proof of equivalence. The alleged agreement about the Copenhagen Interpretation, predicated to (...) a large extent on this equivalence, was deemed a myth as well. If such analysis is correct, it provides considerable evidence that, in its critical moments, the foundations of scientific practice might not live up to the minimal standards of rigor, as such standards are established in the practice of logic, mathematics, and mathematical physics, thereby prompting one to question the rationality of the practice of physics. In response, I argue that Schrödinger’s proof concerned primarily a domain-specific ontological equivalence, rather than the isomorphism. It stemmed initially from the agreement of the eigenvalues of Wave Mechanics and energy-states of Bohr’s Model that was discovered and published by Schrödinger in his First and Second Communications of 1926. Schrödinger demonstrated in this proof that the laws of motion arrived at by the method of Matrix Mechanics could be derived successfully from eigenfunctions as well (while he only outlined the reversed derivation of eigenfunctions from Matrix Mechanics, which was necessary for the proof of isomorphism of the two theories). This result was intended to demonstrate the domain-specific ontological equivalence of Matrix Mechanics and Wave Mechanics, with respect to the domain of Bohr’s atom. And although the full-fledged mathematico-logical equivalence of the theories did not seem out of the reach of existing theories and methods, Schrödinger never intended to fully explore such a possibility in his proof paper. In a further development of Quantum Mechanics, Bohr’s complementarity and Copenhagen Interpretation captured a more substantial convergence of the subsequently revised (in light of the experimental results) Wave and Matrix Mechanics. I argue that both the equivalence and Copenhagen Interpretation can be deemed myths if one predicates the philosophical and historical analysis on a narrow model of physical theory which disregards its historical context, and focuses exclusively on its formal aspects and the exploration of the logical models supposedly implicit in it. (shrink)

Referential matrix semantics of R. W´ojcicki [5] and [4] is extended to cover the class of all structural propositional calculi.

This work adapts techniques and results first developed by Malinowski and by Marek in the context of referential semantics of sentential logics to the context of logics formalized as π-institutions. More precisely, the notion of a pseudoreferential matrix system is introduced and it is shown how this construct generalizes that of a referential matrix system. It is then shown that every π–institution has a pseudo-referential matrix system semantics. This contrasts with referential matrix system semantics (...) which is only available for self-extensional π-institutions by a previous result of the author obtained as an extension of a classical result of Wójcicki. Finally, it is shown that it is possible to replace an arbitrary pseudoreferential matrix system semantics by a discrete pseudo-referential matrix system semantics. (shrink)

Using matrix iterations of ccc posets, we prove the consistency with ZFC of some cases where the cardinals on the right hand side of Cichon’s diagram take two or three arbitrary values (two regular values, the third one with uncountable cofinality). Also, mixing this with the techniques in J Symb Log 56(3):795–810, 1991, we can prove that it is consistent with ZFC to assign, at the same time, several arbitrary regular values on the left hand side of Cichon’s diagram.

In this paper we define n+1-valued matrix logic Kn+1 whose class of tautologies is non-empty iff n is a prime number. This result amounts to a new definition of a prime number. We prove that if n is prime, then the functional properties of Kn+1 are the same as those of ukasiewicz's n +1-valued matrix logic n+1. In an indirect way, the proof we provide reflects the complexity of the distribution of prime numbers in the natural series. Further, (...) we introduce a generalization K n+1 * of Kn+1 such that the set of tautologies of Kn+1 is not empty iff n is of the form p , where p is prime and is natural. Also in this case we prove the equivalence of functional properties of the introduced logic and those of n+1. In the concluding part, we discuss briefly a partition of the natural series into equivalence classes such that each class contains exactly one prime number. We conjecture that for each prime number the corresponding equivalence class is finite. (shrink)

This paper deals with the axiomatizability problem for the matrix-based logics RMQ − and RMQ *. We present a Hilbert-style axiom system for RMQ −, and a quasi-axiomatization based on it for RMQ *. We further compare these logics to different well-known modal logics, and assess its status as relevance logics.

Motivated by a question of W. Rautenberg, we prove that any matrix that is term-equivalent to the well-known nonfinitely based matrix of A. Wroski is itself also nonfinitely based.

A recent rethinking of the early history of Quantum Mechanics deemed the late 1920s agreement on the equivalence of Matrix Mechanics and Wave Mechanics, prompted by Schrödinger's 1926 proof, a myth. Schrödinger supposedly failed to prove isomorphism, or even a weaker equivalence (“Schrödinger-equivalence”) of the mathematical structures of the two theories; developments in the early 1930s, especially the work of mathematician von Neumann provided sound proof of mathematical equivalence. The alleged agreement about the Copenhagen Interpretation, predicated to a large (...) extent on this equivalence, was deemed a myth as well. In response, I argue that Schrödinger's proof concerned primarily a domain-specific ontological equivalence, rather than the isomorphism or a weaker mathematical equivalence. It stemmed initially from the agreement of the eigenvalues of Wave Mechanics and energy-states of Bohr's Model that was discovered and published by Schrödinger in his first and second communications of 1926. Schrödinger demonstrated in this proof that the laws of motion arrived at by the method of Matrix Mechanics are satisfied by assigning the auxiliary role to eigenfunctions in the derivation of matrices (while he only outlined the reversed derivation of eigenfunctions from Matrix Mechanics, which was necessary for the proof of both isomorphism and Schrödinger-equivalence of the two theories). This result was intended to demonstrate the domain-specific ontological equivalence of Matrix Mechanics and Wave Mechanics, with respect to the domain of Bohr's atom. And although the mathematical equivalence of the theories did not seem out of the reach of existing theories and methods, Schrödinger never intended to fully explore such a possibility in his proof paper. In a further development of Quantum Mechanics, Bohr's complementarity and Copenhagen Interpretation captured a more substantial convergence of the subsequently revised (in light of the experimental results) Wave and Matrix Mechanics. -/- I argue that both the equivalence and Copenhagen Interpretation can be deemed myths if one predicates the philosophical and historical analysis on a narrow model of physical theory which disregards its historical context, and focuses exclusively on its formal aspects and the exploration of the logical models supposedly implicit in it. -/- . (shrink)

We show that short bounded-depth Frege proofs of matrix identities, such as PQ=I⊃QP=I (over the field of two elements), imply short bounded-depth Frege proofs of the pigeonhole principle. Since the latter principle is known to require exponential-size bounded-depth Frege proofs, it follows that the propositional version of the matrix principle also requires bounded-depth Frege proofs of exponential size.

Referential semantics importantly subscribes to the programme of theory of logical calculi. Defined by Wójcicki in [8], it has been subsequently studied in a series of papers of the author, till the full exposition of the framework in [9] and its intuitive characterisation in [10]. The aim of the article is to present several generalizations of referential semantics as compared and related to the matrix semantics for propositional logics. We show, in a uniform way, some own generalizations of (...) referentiality: the first, directed to unrestricted cluster referential semantics, [4], its "discrete" version, a counterpart of algebraic semantics and a many-valued referentiality based on matrices, whose elements are functions from the set of indices to a finite n-element set of values, n≥2, [3]. Next to this we outline pragmatic matrices introduced by Tokarz in [6] as an alternative for cluster referential approach and discuss together all presented versions of referential semantics. (shrink)

“The Matrix is a computer-generated dreamworld built to keep us under control” Morpheus, early in The Matrix. “ In dreaming, you are not only out of control, you don’t even know it…I was completely duped again and again the minute my pons, my amygdala, my perihippocampal cortex, my anterior cingulate, my visual association and parietal opercular cortices were revved up and my dorsolateral prefrontal cortex was muffled” ” J. Allan Hobson, The Dream Drugstore, p.64 The Matrix is (...) an exercise in ambivalence, and at the very heart of that ambivalence lies the Dream. In our dreams, we are not in control. Real dreaming, unlike many popular philosophers’ fictions, is an altered state, closely related to the states induced by chemical manipulations such as the use of (certain) medical or recreational drugs. The dreaming brain is not like the wakeful brain. Normal sensory input is blocked, attentional capacities are impaired or lost, memory is distorted, reasoning and logic are weakened, narratives run wild, self-reflection is dampened or destroyed, emotion and instinct are hyperstimulated, and forms of ‘top-down’ willed control and decision-making diluted and easily overwhelmed. (shrink)

Phenomenology, Sociology, Hermeneutics and Psychoanalysis have accumulated different methods and knowledge on the imaginary. Nevertheless, the crucial connection between the social imagining and communication has not always been truly examined. In this article, we take the imaginary (seen as a symbolic thought of images) and communication (seen as a process of symbolic reproduction) as correlated notions, and work upon a communicational matrix of the imaginary. We emphasize three key elements of the imaginary: by pointing to the verbal-iconic, technical and (...) mediatized dimensions we will be paying special attention to the media imaginary and the effects of its commemorative logic to the propagation of public imaginaries. (shrink)

Vector logic is a mathematical model of the propositional calculus in which the logical variables are represented by vectors and the logical operations by matrices. In this framework, many tautologies of classical logic are intrinsic identities between operators and, consequently, they are valid beyond the bivalued domain. The operators can be expressed as Kronecker polynomials. These polynomials allow us to show that many important tautologies of classical logic are generated from basic operators via the operations called Type I and Type (...) II products. Finally, it is described a matrix version of the Fredkin gate that extends its properties to the many-valued domain, and it is proved that the filtered Fredkin operators are second degree Kronecker polynomials that cannot be generated by Type I or Type II products. (shrink)

This essay compares the fundamental metaphysical principles, the Categoreal Scheme of A. N. Whitehead's Process and Reality with the axiomatic-deductive scheme of Whitehead and Russell's Principia Mathematica to reveal the influence of mathematical logic on Whitehead's metaphysics.

We study some properties of the quotient forcing notions \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${Q_{tr(I)} = \wp(2^{< \omega})/tr(i)}$$\end{document} and PI = B(2ω)/I in two special cases: when I is the σ-ideal of meager sets or the σ-ideal of null sets on 2ω. We show that the remainder forcing RI = Qtr(I)/PI is σ-closed in these cases. We also study the cardinal invariant of the continuum \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathfrak{h}_{\mathbb{Q}}}$$\end{document}, the distributivity (...) number of the quotient \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${Dense(\mathbb{Q})/nwd}$$\end{document}, in order to show that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\wp(\mathbb{Q})/nwd}$$\end{document} collapses \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathfrak{c}}$$\end{document} to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathfrak{h}_{\mathbb{Q}}}$$\end{document}, thus answering a question addressed in Balcar et al. (Fundamenta Mathematicae 183:59–80, 2004). (shrink)

In the first section logics with an algebraic semantics are investigated. Section 2 is devoted to subdirect products of matrices. There, among others we give the matrix counterpart of a theorem of Jónsson from universal algebra. Some positive results concerning logics with, finite degrees of maximality are presented in Section 3.

We motivate and introduce a new method of abduction, Matrix Abduction, and apply it to modelling the use of non-deductive inferences in the Talmud such as Analogy and the rule of Argumentum A Fortiori. Given a matrix $${\mathbb {A}}$$ with entries in {0, 1}, we allow for one or more blank squares in the matrix, say a i,j =?. The method allows us to decide whether to declare a i,j = 0 or a i,j = 1 or (...) a i,j =? undecided. This algorithmic method is then applied to modelling several legal and practical reasoning situations including the Talmudic rule of Kal-Vachomer. We add an Appendix showing that this new rule of Matrix Abduction, arising from the Talmud, can also be applied to the analysis of paradoxes in voting and judgement aggregation. In fact we have here a general method for executing non-deductive inferences. (shrink)

The paper studies the containment companion of a logic \. This consists of the consequence relation \ which satisfies all the inferences of \, where the variables of the conclusion are contained into those of the set of premises, in case this is not inconsistent. In accordance with the work started in [10], we show that a different generalization of the Płonka sum construction, adapted from algebras to logical matrices, allows to provide a matrix-based semantics for containment logics. (...) In particular, we provide an appropriate completeness theorem for a wide family of containment logics, and we show how to produce a complete Hilbert style axiomatization. (shrink)