Related papers: QL(C^n) determines n
We take the view that physical quantities are values generated by processes in measurement, not pre-existent objective quantities, and that a measurement result is strictly a product of the apparatus and the subject of the measurement. We…
We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over Z is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g., the existential and positive fragments and EF.
We show that there exists an atomic representable polyadic equality algebra of finite dimension n\geq 3, such that the cylindric reduct of its completion is not in SNr_n\CA_{n+4}, hence the result in the title. This solves an open problem…
For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $\alpha$, there…
We describe quantization schemes for scalar field cosmology in the metric variables with fundamental discreteness imposed with a lattice. The variables chosen for quantization determine the lattice, and each lattice produces distinct…
In this paper, we consider iterative propositional calculi, which are finite sets of propositional formulas together with the rules of modus ponens and weak substitution (when formula being substituted must be already inferred). We…
Quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister, a system of qubits, representing a…
The following paper proposes a new approach to determine whether a logical (CNF) formula is satisfiable or not using probability theory methods. Furthermore, we will introduce an algorithm that speeds up the standard solution for (CNF-SAT)…
In this paper we consider propositional calculi, which are finitely axiomatizable extensions of intuitionistic implicational propositional calculus together with the rules of modus ponens and substitution. We give a proof of undecidability…
It is shown that quantum mechanics on noncommutative (NC) spaces can be obtained by canonical quantization of some underlying constrained systems. Noncommutative geometry arises after taking into account the second class constraints…
A review of recent developments in the quantum differential calculus. The quantum group $GL_q(n)$ is treated by considering it as a particular quantum space. Functions on $SL_q(n)$ are defined as a subclass of functions on $GL_q(n)$. The…
It is shown that propositional calculuses of both quantum and classical logics are non-categorical. We find that quantum logic is in addition to an orthomodular lattice also modeled by a weakly orthomodular lattice and that classical logic…
As defined by Dunn, Moss, and Wang, an universal test set in an ortholattice $L$ is a subset $T$ such that each term takes value $1$, only, if it does so under all substitutions from $T$. Generalizing their result for ortholattices of…
We propose a semantic representation of the standard quantum logic QL within a classical, normal modal logic, and this via a lattice-embedding of orthomodular lattices into Boolean algebras with one modal operator. Thus our classical logic…
A method is proposed for defining an arbitrary number of differential calculi over a given noncommutative associative algebra. As an example the generalized quantum plane is studied. It is found that there is a strong correlation, but not a…
The logic of a physical theory reflects the structure of the propositions referring to the behaviour of a physical system in the domain of the relevant theory. It is argued in relation to classical mechanics that the propositional structure…
Orthogonal projections in ${\mathbb C}^n \otimes {\mathbb C}^n$ of rank one and rank two that give rise to unitary tensor space representations of the Temperley-Lieb algebra $TL_N(Q)$ are considered. In the rank one case, a complete…
We show that a separation between the class of all problems that can efficiently be solved on a quantum computer and those solvable using probabilistic classical algorithms in polynomial time implies the generalized contextuality of quantum…
We change the definition of the vertex representations. As a result the vertex representations has one parameter.
This note announces the proof of a conjecture of H. Verlinde, according to which the spaces of Liouville conformal blocks and the Hilbert spaces from the quantization of the Teichm\"uller spaces of Riemann surfaces carry equivalent…