English
Related papers

Related papers: On ring-like structures of lattice-ordered numeric…

200 papers

We study categories for reversible computing, focussing on reversible forms of event structures. Event structures are a well-established model of true concurrency. There exist a number of forms of event structures, including prime event…

Logic in Computer Science · Computer Science 2017-04-12 Eva Graversen , Iain Phillips , Nobuko Yoshida

We investigate how various forms of bisimulation can be characterised using the technology of logical relations. The approach taken is that each form of bisimulation corresponds to an algebraic structure derived from a transition system,…

Logic in Computer Science · Computer Science 2022-03-14 Claudio Hermida , Uday Reddy , Edmund Robinson , Alessio Santamaria

The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…

Computational Complexity · Computer Science 2026-03-02 Lianna Hambardzumyan , Shachar Lovett , Morgan Shirley

In finite probability theory, events are subsets of the outcome set. Subsets can be represented by 1-dimensional column vectors. By extending the representation of events to two dimensional matrices, we can introduce "superposition events."…

Quantum Physics · Physics 2020-06-18 David Ellerman

John Bell once argued that one ought to select, out of the 'observables' of quantum theory, some subset of 'beables' that can be consistently ascribed determinate values. Moreover, this subset should be selected so as to guarantee (among…

Quantum Physics · Physics 2007-05-23 Rob Clifton

We introduce a framework that can be used to model both mathematics and human reasoning about mathematics. This framework involves {stochastic mathematical systems} (SMSs), which are stochastic processes that generate pairs of questions and…

Logic · Mathematics 2023-03-15 David H. Wolpert , David B. Kinney

The distributive laws of ring theory are fundamental equalities in algebra. However, recently in the study of the Yang-Baxter equation, many algebraic structures with alternative "distributive" laws were defined. In an effort to study these…

Quantum Algebra · Mathematics 2020-02-04 Ilaria Colazzo , Arne Van Antwerpen

We deal with the general structure of (noncommutative) stochastic processes by using the standard techniques of Operator Algebras. Any stochastic process is associated to a state on a universal object, i.e. the free product $C^*$-algebra in…

Probability · Mathematics 2016-10-03 Vitonofrio Crismale , Francesco Fidaleo

Within the Hamiltonian framework, the propositions about a classical physical system are described in the Borel {\sigma}-algebra of a symplectic manifold (the phase space) where logical connectives are the standard set operations.…

Quantum Physics · Physics 2020-12-02 Davide Pastorello

Probabilistic logic programming is increasingly important in artificial intelligence and related fields as a formalism to reason about uncertainty. It generalises logic programming with the possibility of annotating clauses with…

Logic in Computer Science · Computer Science 2023-06-22 Tao Gu , Fabio Zanasi

We propose a special relativistic framework for quantum mechanics. It is based on introducing a Hilbert space for events. Events are taken as primitive notions (as customary in relativity), whereas quantum systems (e.g. fields and…

Quantum Physics · Physics 2024-04-11 Vittorio Giovannetti , Seth Lloyd , Lorenzo Maccone

In ring theory, the lifting idempotent property (LIP) is related to some important classes of rings: clean rings, exchange rings, local and semilocal rings, Gelfand rings,maximal rings, etc. Inspired by LIP, there were defined lifting…

Logic in Computer Science · Computer Science 2019-01-21 Daniela Cheptea , George Georgescu

In this work we build a quantum logic that allows us to refer to physical magnitudes pertaining to different contexts from a fixed one without the contradictions with quantum mechanics expressed in no-go theorems. This logic arises from…

Quantum Physics · Physics 2009-11-13 Graciela Domenech , Hector Freytes

We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and…

Rings and Algebras · Mathematics 2010-06-24 Stijn Vermeeren

Contextuality is widely regarded as a hallmark of quantum information, yet its structural origin is often obscured by probabilistic or operational formulations. In this work, we show that non-distributive orthomodular structure need not be…

Quantum Physics · Physics 2026-03-25 Yukio-Pegio Gunji , Yoshihiko Ohzawa , Yuki Tokuyama , Yu Huang , Kyoko Nakamura

We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…

Combinatorics · Mathematics 2015-09-28 Antoine Genitrini , Bernhard Gittenberger , Veronika Kraus , Cécile Mailler

The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…

Rings and Algebras · Mathematics 2014-02-03 Primož Škraba , João Pita Costa

This essay is a two-step reflection on the question 'Which events (can be said to) occur in quantum phenomena?' The first step regiments the ontological category of "statistical phenomena" and studies the adequacy of "probabilistic event…

History and Philosophy of Physics · Physics 2025-02-14 Sebastian Horvat

In a recent work we have shown how to construct an information algebra of coherent sets of gambles defined on general possibility spaces. Here we analyze the connection of such an algebra with the set algebra of subsets of the possibility…

Logic in Computer Science · Computer Science 2021-05-28 Juerg Kohlas , Arianna Casanova , Marco Zaffalon

We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: Some A are R-related to some B; Some A are R-related to all B; All A are R-related to some B; All A are…

Logic in Computer Science · Computer Science 2015-03-19 Nikolay Ivanov , Dimiter Vakarelov
‹ Prev 1 4 5 6 7 8 10 Next ›