Related papers: Quantum logic is undecidable
Existing work on quantum causal structure assumes that one can perform arbitrary operations on the systems of interest. But this condition is often not met. Here, we extend the framework for quantum causal modelling to situations where a…
Linear Temporal Logic (LTL) interpreted on finite traces is a robust specification framework popular in formal verification. However, despite the high interest in the logic in recent years, the topic of their quantitative extensions is not…
We extend results of Videla and Fukuzaki to define algebraic integers in large classes of infinite algebraic extensions of Q and use these definitions for some of the fields to show the first-order undecidability. We also obtain a…
Empirical evidence has confirmed that quantum effects occur frequently also outside the microscopic domain, while quantum structures satisfactorily model various situations in several areas of science, including biological, cognitive and…
The concept of quantum coherence and its possible use as a resource are currently the subject of active researches. Uncertainty and complementarity relations for quantum coherence allow one to study its changes with respect to other…
This paper presents the logic QRC$_1$, which is a strictly positive fragment of quantified modal logic. The intended reading of the diamond modality is that of consistency of a formal theory. Predicate symbols are interpreted as…
We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…
In this paper we present the following two results: we give an explicit description of the space of orderings of the field Q(x) as an inverse limit of finite spaces of orderings and we provide a new, simple proof of the fact that the class…
In this work we prove the undecidability (and $\Sigma^0_1$-completeness) of several theories of semirings with fixed points. The generality of our results stems from recursion theoretic methods, namely the technique of effective…
In this paper, we discuss content and context for quantum properties. We give some examples of why quantum properties are problematic: they depend on the context in a non-trivial way. We then connect this difficulty with properties to the…
The question whether indeterminism in quantum measurement outcomes is fundamental or is there a possibility of constructing a finer theory underlying quantum mechanics that allows no such indeterminism, has been debated for a long time. We…
We define a new class of infinitary logics $\mathscr L^1_{\kappa,\alpha}$ generalizing Shelah's logic $\mathbb L^1_\kappa$ defined in \cite{MR2869022}. If $\kappa=\beth_\kappa$ and $\alpha <\kappa$ is infinite then our logic coincides with…
We solve a well known, long-standing open problem in relational databases theory, showing that the conjunctive query determinacy problem (in its "unrestricted" version) is undecidable.
We establish a connection between measurement-based quantum computation and the field of mathematical logic. We show that the computational power of an important class of quantum states called graph states, representing resources for…
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…
A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
It is well-known that the canonical commutation relation $[x,p]=i$ can be realized only on an infinite-dimensional Hilbert space. While any finite set of experimental data can also be explained in terms of a finite-dimensional Hilbert space…
Query Containment Problem (QCP) is one of the most fundamental decision problems in database query processing and optimization. Complexity of QCP for conjunctive queries (QCP-CQ) has been fully understood since 1970s. But, as Chaudhuri and…
We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…