相关论文: QL(C^n) determines n

We consider ontological models of a quantum system, assuming that not all probability distributions over the space $\Lambda$ of ontic states are preparable, only those belonging to a certain set C. We assume further that every POVM with a…

A logical system derived from linear logic and called QMLL is introduced and shown able to capture all unitary quantum circuits. Conversely, any proof is shown to compute, through a concrete GoI interpretation, some quantum circuits. The…

We treat the canonical commutation relations and the conventional calculus based on it as an algebraic syntax of quantum mechanics and establish a geometric semantics of this syntax. This leads us to a geometric model, the space of states…

In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite…

The notion of lacunary infinite numerical sequence is introduced. It is shown that for an arbitrary linear difference operator L with coefficients belonging to the set R of infinite numerical sequences, a criterion (i.e., a necessary and…

This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations…

Quantum computational logics represent a logical abstraction from the circuit-theory in quantum computation. In these logics formulas are supposed to denote pieces of quantum information (qubits, quregisters or mixtures of quregisters),…

The quantum lens spaces form a natural and well-studied class of noncommutative spaces which can be subjected to classification using algebraic invariants by drawing on the fully developed classification theory of unital graph…

We prescribe a choice of 18 variables in all that casts the equations of the fully nonlinear characteristic formulation of general relativity in first--order quasi-linear canonical form. At the analytical level, a formulation of this type…

This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 with varying, increasing, decreasing, and constant domains.…

Closed formulae are constructed for the characters and dimensions of the finite dimensional simple modules of the queer Lie superalgebra q(n). This is achieved by refining Brundan's algorithm for computing simple q(n)-characters.

We use a local scale invariance of a classical Hamiltonian and describe how to construct six different formulations of quantum mechanics in spaces with two time-like dimensions. All these six formulations have the same classical limit…

Computability logic is a formal theory of computational tasks and resources. Its formulas represent interactive computational problems, logical operators stand for operations on computational problems, and validity of a formula is…

We present exact quantum solutions for a noncommutative, multidimensional cosmological model and show that stabilization of extra dimensions sets in with the introduction of noncommutativity between the scale factors. An interpretation is…

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.

In this work we discuss logical structures related to indistinguishable particles. Most of the framework used to develop these structures was presented in [17, 28] and in [20, 14, 15, 16]. We use these structures and constructions to…

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…

For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior…

We derive directly from the N=2 LG superpotential the differential equations that determine the flat coordinates of arbitrary topological CFT's.

The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite "tensorial dimension". Such vector spaces with a finite tensorial dimension permit to…