Previous Page 3

Displaying 41 – 48 of 48

Showing per page

Traced premonoidal categories

Nick Benton, Martin Hyland (2003)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Motivated by some examples from functional programming, we propose a generalization of the notion of trace to symmetric premonoidal categories and of Conway operators to Freyd categories. We show that in a Freyd category, these notions are equivalent, generalizing a well-known theorem relating traces and Conway operators in cartesian categories.

Traced Premonoidal Categories

Nick Benton, Martin Hyland (2010)

RAIRO - Theoretical Informatics and Applications

Motivated by some examples from functional programming, we propose a generalization of the notion of trace to symmetric premonoidal categories and of Conway operators to Freyd categories. We show that in a Freyd category, these notions are equivalent, generalizing a well-known theorem relating traces and Conway operators in Cartesian categories.

Two Axiomatizations of Nelson Algebras

Adam Grabowski (2015)

Formalized Mathematics

Nelson algebras were first studied by Rasiowa and Białynicki- Birula [1] under the name N-lattices or quasi-pseudo-Boolean algebras. Later, in investigations by Monteiro and Brignole [3, 4], and [2] the name “Nelson algebras” was adopted - which is now commonly used to show the correspondence with Nelson’s paper [14] on constructive logic with strong negation. By a Nelson algebra we mean an abstract algebra 〈L, T, -, ¬, →, ⇒, ⊔, ⊓〉 where L is the carrier, − is a quasi-complementation (Rasiowa used...

Currently displaying 41 – 48 of 48

Previous Page 3