Related papers: On Logical Extension of Algebraic Division
In decision theory an act is a function from a set of conditions to the set of real numbers. The set of conditions is a partition in some algebra of events. The expected value of an act can be calculated when a probability measure is given.…
We generalize the classical "1089-number trick", which states that a certain combination of addition, subtraction and swapping the digits of a three-digit number will always output 1089. More precisely, we show that any pair of zero…
The halting problem is considered to be an essential part of the theoretical background to computing. That halting is not in general computable has supposedly been proved in many text books and taught on many computer science courses, in…
There are four division algebras over $\mathbb{R}$, namely real numbers, complex numbers, quaternions, and octonions. Lack of commutativity and associativity make it difficult to investigate algebraic and geometric properties of octonions.…
A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…
A logic is said to admit an equational completeness theorem when it can be interpreted into the equational consequence relative to some class of algebras. We characterize logics admitting an equational completeness theorem that are either…
An algebraic $q$-difference equation is considered. A sufficient condition for the existence of a formal power-logarithmic expansion of a solution to such an equation in the neighborhood of zero is proposed. An example of applying this…
We study algebras $A,$ over a field of characteristic zero, satisfying $(x^p, x^q, x^r)=0$ for $p, q, r$ in ${1, 2}.$ The existence of a unit element in such algebras leads to the third power-associativity. If, in addition, $A$ has degree…
The foundational character of certain algebraic structures as Boolean algebras and Heyting algebras is rooted in their potential to model classical and constructive logic, respectively. In this paper we discuss the contributions of…
A proof is one of the most important concepts of mathematics. However, there is a striking difference between how a proof is defined in theory and how it is used in practice. This puts the unique status of mathematics as exact science into…
We study splittings, or lack of them, in lattices of subvarieties of some logic-related varieties. We present a general lemma, the Non-Splitting Lemma, which when combined with some variety-specific constructions, yields each of our…
Any rational number can be factored into a product of several rationals whose sum vanishes. This simple but nontrivial fact was suggested as a problem on a maths olympiad for high-school students. We completely solve similar questions in…
We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension,…
So far, the scope of computer algebra has been needlessly restricted to exact algebraic methods. Its possible extension to approximate analytical methods is discussed. The entangled roles of functional analysis and symbolic programming,…
What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only…
We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…
We show that an arbitrary algebra ${ A}$, (of arbitrary dimension, over an arbitrary base field and any identity is not suppose for the product), is semisimple if and only if it has zero annihilator and admits a semi-division linear basis.…
This paper introduces a dynamic logic extension of separation logic. The assertion language of separation logic is extended with modalities for the five types of the basic instructions of separation logic: simple assignment, look-up,…
The treewidth boundedness problem for a logic asks for the existence of an upper bound on the treewidth of the models of a given formula in that logic. This problem is found to be undecidable for first order logic. We consider a…
We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…