Related papers: Counting with 3-valued truth tables of bracketed f…
It is shown in the paper that each Hecke symmetry R with the R-symmetric algebra freely generated by 3 commuting elements is determined by a bivector and a symmetric bilinear form on a 3-dimensional vector space. A general formula for such…
Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic…
The unified correspondence theory for distributive lattice expansion logics (DLE-logics) is specialized to strict implication logics. As a consequence of a general semantic consevativity result, a wide range of strict implication logics can…
Conjunctive table algebras are introduced and axiomatically characterized. A conjunctive table algebra is a variant of SPJR algebra (a weaker form of relational algebra), which corresponds to conjunctive queries with equality. The table…
We discuss the complexity of completions of partial combinatory algebras, in particular of Kleene's first model. Various completions of this model exist in the literature, but all of them have high complexity. We show that although there do…
3-Lie algebras have close relationships with many important fields in mathematics and mathematical physics. The paper concerns 3-Lie algebras. The concepts of 3-Lie coalgebras and 3-Lie bialgebras are given. The structures of such…
We derive closed formulas for the number of $k$-coloured partitions and the number of plane partitions of $n$ in terms of the Bell polynomials.
We give a theoretical model of conjunctions $E\wedge F$ and implications $E\implies F$ where $F$ is meaningful only when $E$ is true, a situation which is very often encountered in everyday mathematics, and which was already formalized by…
Bernays introduced a method for proving underivability results in propositional calculi by truth tables. In general, this motivates an investigations of how to find, given a propositional logic, a finite-valued logic which has as few…
We find that the structure constants 4-form of a metric 3-Lie algebra is the sum of the volume forms of orthogonal 4-planes proving a conjecture in math/0211170. In particular, there is no metric 3-Lie algebra associated to a…
On the basis of elementary thinking about language functioning, a solution of truth paradoxes is given and a corresponding semantics of a truth predicate is founded. It is shown that it is precisely the two-valued description of the maximal…
Let A be a class of objects, equipped with an integer size such that for all n the number a(n) of objects of size n is finite. We are interested in the case where the generating fucntion sum_n a(n) t^n is rational, or more generally…
We study the algebra of bilinear multiplications of an $n$-dimensional vector space. In particular, we study the Kantor product of some well-known (associative, Lie, alternative, Novikov and some other) multiplications.
Existential positive formulas form a fragment of first-order logic that includes and is semantically equivalent to unions of conjunctive queries, one of the most important and well-studied classes of queries in database theory. We consider…
We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is sound with respect to the set of…
Weak Kleene logics are three-valued logics characterized by the presence of an infectious truth-value. In their external versions, as they were originally introduced by Bochvar and Hallden, these systems are equipped with an additional…
We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of…
Reactive programs are ubiquitous in modern applications, and so verification is highly desirable. We present a verification strategy for reactive programs with a large or infinite state space utilising algebraic laws for reactive relations.…
Partial combinatory algebras are algebraic structures that serve as generalized models of computation. In this paper, we study embeddings of pcas. In particular, we systematize the embeddings between relativizations of Kleene's models, of…
We consider a randomised version of Kleene's realisability interpretation of intuitionistic arithmetic in which computability is replaced with randomised computability with positive probability. In particular, we show that (i) the set of…