Produktbild: Relational and Algebraic Methods in Computer Science
Band 13027

Relational and Algebraic Methods in Computer Science 19th International Conference, RAMiCS 2021, Marseille, France, November 2–5, 2021, Proceedings

74,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

13.10.2021

Abbildungen

XVII, 499 p. 129 illus., 54 illus. in color.

Herausgeber

Uli Fahrenberg + weitere

Verlag

Springer

Seitenzahl

499

Maße (L/B/H)

23,5/15,5/2,8 cm

Gewicht

779 g

Auflage

1st ed. 2021

Sprache

Englisch

ISBN

978-3-030-88700-1

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

13.10.2021

Abbildungen

XVII, 499 p. 129 illus., 54 illus. in color.

Herausgeber

Verlag

Springer

Seitenzahl

499

Maße (L/B/H)

23,5/15,5/2,8 cm

Gewicht

779 g

Auflage

1st ed. 2021

Sprache

Englisch

ISBN

978-3-030-88700-1

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Relational and Algebraic Methods in Computer Science
  • Unary-determined distributive l-magmas and bunched implication algebras.- Effect Algebras, Girard Quantales and Complementation in Separation Logic.- Relational Computation of Sets of Relations.- Experimental Investigation of Su cient Criteria for Relations to Have Kernels.- lr-Multisemigroups, Modal Quantales and the Origin of Locality.- Abstract Strategies and Coherence.- Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm PEARL.- The class of representable semilattice-ordered monoids is not a variety.- Accretive Computation of Global Transformations.- Some modal and temporal translations of generalized basic logic.- Isolated Sublattices and their Application to Counting Closure Operators.- Second-Order Properties of Undirected Graphs.- Relation-algebraic Verification of Bor uvka's Minimum Spanning Tree Algorithm.- Deciding FO-definability of Regular Languages.- Relational Models for the Lambek calculus with Intersection and Unit.- Free Modal Riesz Spaces are Archimedean: a Syntactic Proof.- Polyadic spaces and profinite monoids.- Time Warps, from Algebra to Algorithms.- On Algebra of Program Correctness and Incorrectness.- Computing Least and Greatest Fixed Points in Absorptive Semirings.- A Variety Theorem for Relational Universal Algebra. -On Tools for Completeness of Kleene Algebra with Hypotheses. -Skew metrics valued in Sugihara semigroups.- Computing Aggregated Knowledge as the Greatest Lower Bound of Knowledge.- Relational Sums and Splittings in Categories of L-fuzzy Relations.- Change of Base using Arrow Categories.- Automated Reasoning for Probabilistic Sequential Programs with Theorem Proving.- Domain Range Semigroups and Finite Representations.