相关论文: Hilbert-Post completeness for the state and the ex…
We study the computational complexity of reachability, coverability and inclusion for extensions of context-free commutative grammars with integer counters and reset operations on them. Those grammars can alternatively be viewed as an…
In this paper, we define a realizability semantics for the simply typed $\lambda\mu$-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the…
In this paper, we study the property of hereditary completeness of vector systems $\{x_k\}_{k=1}^\infty$ in a Hilbert space. A criterion of hereditary completeness is obtained in terms of projectors on closed linear spans of systems of the…
We describe $\sigma$-additive states on effect-tribes by integrals. Effect-tribes are monotone $\sigma$-complete effect algebras of functions where operations are defined by points. Then we show that every state on an effect algebra is an…
A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with…
In this report, we introduce observation algebras, constructed by considering the downclosed subsets of a coherence space ordered by reverse inclusion. These may be interpreted as specifications of sets of events via some predicates with…
We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…
This is a study of S. Kripke's notion of fulfilment. Motivated by Paris-Harrington statement, Kripke was looking for a proof of G\"odel's Incompleteness Theorem which was model-theoretic, natural (without self-reference), and easy.…
We revisit the problem of discriminating orthogonal quantum states within the local quantum operation and classical communication (LOCC) paradigm. Our particular focus is on the asymptotic situation where the parties have infinite resources…
We study the role of context, complex of physical conditions, in quantum as well as classical experiments. It is shown that by taking into account contextual dependence of experimental probabilities we can derive the quantum rule for the…
Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…
We use classes of Hilbert lattice equations for an alternative representation of Hilbert lattices and Hilbert spaces of arbitrary quantum systems that might enable a direct introduction of the states of the systems into quantum computers.…
A central goal of modern causal inference is estimating heterogeneous treatment effects to answer questions like "how does an intervention affect each unit," rather than only on average. We study this problem with panel-data where we…
The maximality property was introduced in in orthomodular posets as a common generalization of orthomodular lattices and orthocomplete orthomodular posets. We show that various conditions used in the theory of effect algebras are stronger…
We address the problem of predicting edit completions based on a learned model that was trained on past edits. Given a code snippet that is partially edited, our goal is to predict a completion of the edit for the rest of the snippet. We…
I present a formal connection between algebraic effects and game semantics, two important lines of work in programming languages semantics with applications in compositional software verification. Specifically, the algebraic signature…
We study when a programming language can emulate programs written in that same language without delegating the guest program back to the host evaluator or compiler. We call this property emulation-completeness. The central observation is…
The scattering theory of Lax and Phillips, originally developed to describe resonances associated with classical wave equations, has been recently extended to apply as well to the case of the Schroedinger equation in the case that the wave…
Exception handling is provided by most modern programming languages. It allows to deal with anomalous or exceptional events which require special processing. In computer algebra, exception handling is an efficient way to implement the…
The canonical coherent states are expressed as infinite series in powers of a complex number $z$ in their infinite series version. In this article we present classes of coherent states by replacing this complex number $z$ by other choices,…