Related papers: The higher dimensional propositional calculus
We introduce proper display calculi for basic monotonic modal logic,the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…
While symmetries are well understood for Boolean formulas and successfully exploited in practical SAT solving, less is known about symmetries in quantified Boolean formulas (QBF). There are some works introducing adaptions of propositional…
Binary classifiers are traditionally studied by propositional logic (PL). PL can only represent them as white boxes, under the assumption that the underlying Boolean function is fully known. Binary classifiers used in practical applications…
The article explores the arithmetic of multiplication as a model of many valued projective logic. It is demonstrated that closed numerical intervals within this framework constitute Heyting algebras. The conditions for these algebras to be…
We present a sequent calculus for first-order logic with lambda terms and definite descriptions. The theory formalised by this calculus is essentially Russellian, but avoids some of its well known drawbacks and treats definite description…
The paper is a continuation of the research on a one-to-one correspondence between $n$-dimensional spectral resolutions and $n$-dimensional observables on lexicographic types of quantum structures which started in \cite{DvLa4}. In Part I,…
We study different representation theorems for various reducts of Heyting polyadic algebras. Superamalgamation is proved for several (natural reducts) and our results are compared to the finitizability problem in classical algebraic logic…
This paper presents a formal theory which describes propositional binary logic as a semantically closed formal language, and allows for syntactically and semantically well-formed formulae, formal proofs (demonstrability in Hilbertian…
Coalition Logic studies what coalitions can enforce. Recent work treats inability as simple non-ability: $\neg\Eff{C}\varphi$. This conflates two distinct configurations -- a coalition unable to force $\varphi$ may still force…
We introduce a logic modelling some aspects of the behaviour of the measurement process, in such a way that no direct mention of quantum states is made, thus avoiding the problems associated to this rather evasive notion. We then study some…
It has been proved that almost all $n$-bit Boolean functions have exact classical query complexity $n$. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prove that almost…
We classify Nichols algebras of irreducible Yetter-Drinfeld modules over nonabelian groups satisfying an inequality for the dimension of the homogeneous subspace of degree two. All such Nichols algebras are finite-dimensional, and all known…
A classical (or quantum) superintegrable system on an n-dimensional Riemannian manifold is an integrable Hamiltonian system with potential that admits 2n-1 functionally independent constants of the motion that are polynomial in the momenta,…
We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…
In this note, we investigate the algebraic and topological representation theory of cylindric ortholattices and cylindric Boolean algebras. The first contribution demonstrates that cylindric ortholattices are closed under canonical…
We formulate a Boolean algebra in the set of idempotents of Clifford algebra Cl($R^{n,n}$) and within this frame we examine different formulations of the Boolean Satisfiability Problem in Clifford algebra. Exploiting the isomorphism between…
When a physicist performs a quantic measurement, new information about the system at hand is gathered. This paper studies the logical properties of how this new information is combined with previous information. It presents Quantum Logic as…
Quantified Boolean logic results from adding operators to Boolean logic for existentially and universally quantifying variables. This extends the reach of Boolean logic by enabling a variety of applications that have been explored over the…
The concept of complementarity in combination with a non-Boolean calculus of propositions refers to a pivotal feature of quantum systems which has long been regarded as a key to their distinction from classical systems. But a non-Boolean…
We describe a class calculus that is expressive enough to describe and improve its own learning process. It can design and debug programs that satisfy given input/output constraints, based on its ontology of previously learned programs. It…