English
Related papers

Related papers: Residuation in finite posets

200 papers

Quasi-set theory was proposed as a mathematical context to investigate collections of indistinguishable objects. After presenting an outline of this theory, we define an algebra that has most of the standard properties of an orthocomplete…

Quantum Physics · Physics 2009-02-19 Decio Krause , Hercules de Araujo Feitosa

Residuation theory concerns the study of partially ordered algebraic structures, most often monoids, equipped with a weak inverse for the monoidal operator. One of its area of application has been constraint programming, whose key…

Logic in Computer Science · Computer Science 2021-03-12 Fabio Gadducci , Francesco Santini

The present paper deals with complemented lattices where, however, a unary operation of complementation is not explicitly assumed. This means that an element can have several complements. The mapping $^+$ assigning to each element $a$ the…

Logic · Mathematics 2024-06-13 Ivan Chajda , Helmut Länger

It is elementary and well-known that if an element x of a bounded modular lattice L has a complement in L then x has a relative complement in every interval [a,b] containing x. We show that the relatively strong assumption of modularity of…

Combinatorics · Mathematics 2021-07-13 Ivan Chajda , Helmut Länger

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

Logic in Computer Science · Computer Science 2011-07-08 Emmanuel Beffara

Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…

Logic · Mathematics 2024-06-25 Wesley H. Holliday

A sectionally pseudocomplemented poset P is one which has the top element and in which every principal order filter is a pseudocomplemented poset. The sectional pseudocomplements give rise to an implication-like operation on P which…

Logic · Mathematics 2013-01-07 J\{=}anis C\=ırulis

In this paper, we introduce the concept of residuated implications derived from quasi-overlap functions on lattices and prove some related properties. In addition, we formalized the residuation principle for the case of quasi-overlap…

Logic in Computer Science · Computer Science 2020-02-28 Rui Paiva , Benjamín Bedregal , Regivan Santiago

We show that, for every orthogonal lub-complete poset P, we can introduce multiple-valued implications sharing properties with quantum implications presented for orthomodular lattices by Kalmbach. We call them classical implication,…

Logic · Mathematics 2023-11-22 Kadir Emir , Jan Paseka

This paper deals with many-valued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated…

Logic · Mathematics 2009-10-02 Felix Bou , Francesc Esteva , Lluis Godo , Ricardo Rodriguez

The development of logic has largely been through the 'deductive' paradigm: conclusions are inferred from established premisses. However, the use of logic in the context of both human and machine reasoning is typically through the dual…

Logic in Computer Science · Computer Science 2025-04-29 Alexander V. Gheorghiu , David J. Pym

We develop a synthesis of orthomodular logic (projections as propositions) with operator fixed-point theory in Hilbert spaces. First, we introduce an anchored implication connective $A \Rightarrow^{\mathrm{comm}}_{P} B$, defined…

Functional Analysis · Mathematics 2025-08-13 Faruk Alpay , Bugra Kilictas , Taylan Alpay

The foundational character of certain algebraic structures as Boolean algebras and Heyting algebras is rooted in their potential to model classical and constructive logic, respectively. In this paper we discuss the contributions of…

Rings and Algebras · Mathematics 2014-09-16 João Pita Costa , Primož Škraba , Mikael Vejdemo-Johansson

The commutative and homological algebra of modules over posets is developed, as closely parallel as possible to the algebra of finitely generated modules over noetherian commutative rings, in the direction of finite presentations, primary…

Commutative Algebra · Mathematics 2020-08-13 Ezra Miller

The aim of this paper is to introduce a new framework for defining abductive reasoning operators based on a notion of retraction in arbitrary logics defined as satisfaction systems. We show how this framework leads to the design of…

Artificial Intelligence · Computer Science 2018-03-06 Marc Aiguier , Jamal Atif , Isabelle Bloch , Ramón Pino-Pérez

We start from two closure operators defined on the elements of a special kind of partially ordered sets, called causal nets. Causal nets are used to model histories of concurrent processes, recording occurrences of local states and of…

Logic in Computer Science · Computer Science 2014-08-04 Luca Bernardinello , Carlo Ferigato , Lucia Pomello

We show that in quantum logic of closed subspaces of Hilbert space one cannot substitute quantum operations for classical (standard Hilbert space) ones and treat them as primitive operations. We consider two possible ways of such a…

Quantum Physics · Physics 2007-05-23 Norman D. Megill , Mladen Pavicic

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 investigate involutive commutative residuated lattices without unit, which are commutative residuated lattice-ordered semigroups enriched with a unary involutive negation operator. The logic of this structure is discussed and the…

Logic · Mathematics 2023-03-13 Yiheng Wang , Hao Zhan , Yu Peng , Zhe Lin

A binary relation defined on a poset is a weakening relation if the partial order acts as a both-sided compositional identity. This is motivated by the weakening rule in sequent calculi and closely related to models of relevance logic. For…

Logic in Computer Science · Computer Science 2023-01-06 Peter Jipsen , Jaš Šemrl