相关论文: QRB-Domains and the Probabilistic Powerdomain

Previously, we have introduced a very small number of examples of what we call Ouroboros functions. Using our already established theory of Ouroboros spaces and their functions, we will provide a set of families of Ouroboros functions that…

This work mainly concerns the -- here introduced -- category of $\mathscr Q$-sets and functional morphisms, where $\mathscr Q$ is a commutative semicartesian quantale. We describe, in detail, the limits and colimits of this complete and…

We study mappings satisfying the inverse Poletsky-type inequality in a domain of the Euclidean space. Such inequalities are well known and play an important role in the study of quasiconformal and quasiregular mappings. We consider the case…

Quasi-Gr\"obner categories were introduced by Sam and Snowden to unify treatment of categories in representation stability. We give new examples of quasi-Gr\"obner categories. Most of these categories are operadic categories of Batanin and…

Floyd's Operator Precedence (OP) languages are a deterministic context-free family having many desirable properties. They are locally and parallely parsable, and languages having a compatible structure are closed under Boolean operations,…

We give a domain-theoretic semantics to a statistical programming language, using the plain old category of dcpos, in contrast to some more sophisticated recent proposals. Remarkably, our monad of minimal valuations is commutative, which…

We show that the factorial and Q-factorial loci of algebraic varieties defined over an algebraically closed field are open, that products of locally factorial varieties are still locally factorial, and that this property remains true for…

Morphisms to finite semigroups can be used for recognizing omega-regular languages. The so-called strongly recognizing morphisms can be seen as a deterministic computation model which provides minimal objects (known as the syntactic…

Disjunctive finitary programs are a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties, for example ground queries are decidable while in the general case the stable…

In "Denotational semantics for programming languages, balanced quasi-metrics and fixed points" (International Journal of Computer Mathematics 85 (2008), 623-630), J. Rodr\'{i}guez-L\'{o}pez, S. Romaguera and O. Valero introduced and studied…

We establish a DK-equivalence between the relative category of $\pi$-tribes and the relative category of locally cartesian closed quasicategories. From this follows one of the internal languages conjecture: Martin-L\"of type theory with…

We study theoretically competition between the charge ordering and the superconductivity in two-dimensional organic conductor beta-(meso-DMBEDT-TTF)_2PF_6. We analyze the extended Hubbard model on a weakly-dimerized lattice based on the…

We investigate models of algebraic theories in the category of cocommutative coalgebras over a field. We establish some of their categorical properties, similar to those of algebraic varieties. We introduce a class of categories of…

We study the quantum-classical polynomial hierarchy, QCPH, which is the class of languages solvable by a constant number of alternating classical quantifiers followed by a quantum verifier. Our main result is that QCPH is infinite relative…

We consider orthomodular posets endowed with a symmetric difference. We call them ODPs. Expressed in the quantum logic language, we consider quantum logics with an XOR-type connective. We study three classes of "almost Boolean" ODPs, two of…

Probabilistic B\"uchi automata are a natural generalization of PFA to infinite words, but have been studied in-depth only rather recently and many interesting questions are still open. PBA are known to accept, in general, a class of…

It is known that automorphisms of quasi-circular domains fixing the origin are polynomial mappings. By introducing the so-called resonance order and quasi-resonance order, we provide a uniform upper bound for the degree of such polynomial…

We develop a denotational model for probabilistic and concurrent imperative programs, a class of programs with standard control flow via conditionals and while-loops, as well as probabilistic actions and parallel composition. Whereas…

As composites of constant, (co)product, identity, and powerset functors, Kripke polynomial functors form a relevant class of $\mathsf{Set}$-functors in the theory of coalgebras. The main goal of this paper is to expand the theory of limits…

Closure space has proven to be a useful tool to restructure lattices and various order structures.This paper aims to provide a novel approach to characterizing some important kinds of continuous domains by means of closure spaces. By…