Related papers: Infinite sequences in the framework of classical l…
We give a procedure for counting the number of different proofs of a formula in various sorts of propositional logic. This number is either an integer (that may be 0 if the formula is not provable) or infinite.
We classify integrable bounded simple weight modules over classical Lie superalgebras at infinity. We also study the categories of such modules, and we prove that for most of the classical Lie superalgebras at infinity the respective…
We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be…
Interpretational problems with quantum mechanics can be phrased precisely by only talking about empirically accessible information. This prompts a mathematical reformulation of quantum mechanics in terms of classical mechanics. We survey…
Several structural properties of a universal algebra can be seen from the higher commutators of its congruences. Even on a finite algebra, the sequence of higher commutator operations is an infinite object. In the present paper, we exhibit…
Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is…
The so-called classical limit of quantum mechanics is generally studied in terms of the decoherence of the state operator that characterizes a system. This is not the only possible approach to decoherence. In previous works we have…
The natural logarithm can be represented by an infinite series that converges for all positive real values of the variable, and which makes concavity patently obvious. Concavity of the natural logarithm is known to imply, among other…
We consider two aspects of quantum game theory: the extent to which the quantum solution solves the original classical game, and to what extent the new solution can be obtained in a classical model.
Rule-based reasoning is an essential part of human intelligence prominently formalized in artificial intelligence research via logic programs. Describing complex objects as the composition of elementary ones is a common strategy in computer…
We review a possible framework for (non)linear quantum theories, into which linear quantum mechanics fits as well, and discuss the notion of ``equivalence'' in this setting. Finally, we draw the attention to persisting severe problems of…
The class of defeasible logics is only vaguely defined -- it is defined by a few exemplars and the general idea of efficient reasoning with defeasible rules. The recent definition of the defeasible logic $DL(\partial_{||})$ introduced new…
We open a new field on how one can define means on infinite sets. We investigate many different ways on how such means can be constructed. One method is based on sequences of ideals, other deals with accumulation points, one uses isolated…
Matrices are very popular and widely used in mathematics and other fields of science. Every mathematician has known the properties of finite-sized matrices since the time of study. In this paper, we consider the basic theory of infnite…
A refinement of the classic equivalence relation among Cauchy sequences yields a useful infinitesimal-enriched number system. Such an approach can be seen as formalizing Cauchy's sentiment that a null sequence "becomes" an infinitesimal. We…
Logic rules and inference are fundamental in computer science and have been studied extensively. However, prior semantics of logic languages can have subtle implications and can disagree significantly, on even very simple programs,…
We have proposed in several recent papers a critical view of some parts of quantum mechanics (QM) that is methodologically unusual because it rests on analysing the language of QM by using some elementary but fundamental tools of…
Ambiguity is shown in the context of the differential calculus of several variables and with the help of the language of category theory, a way to solve it in its most general form is offered. It is also shown that this new definition is…
Actual infinity in its various forms is discussed, searched and not found.
Quantum logic understood as a reconstruction program had real successes and genuine limitations. This paper offers a synopsis of both and suggests a way of seeing quantum logic in a larger, still thriving context.