Inversive meadows and divisive meadows

DOI10.1016/j.jal.2011.03.001zbMath1251.68144arXiv0907.0540OpenAlexW3103826574MaRDI QIDQ420833

C. A. Middelburg, Jan A. Bergstra

Publication date: 23 May 2012

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0907.0540

zbMATH Keywords

divisive meadowarithmetical meadowimperative meadowinversive meadowpartial meadowrelevant division convention

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (10)

Fracpairs and fractions over a reduced commutative ring ⋮ Transformation of fractions into simple fractions in divisive meadows ⋮ Partial arithmetical data types of rational numbers and their equational specification ⋮ A process calculus with finitary comprehended terms ⋮ Arithmetical datatypes with true fractions ⋮ Inversive meadows and divisive meadows ⋮ The wheel of rational numbers as an abstract data type ⋮ Division by zero in non-involutive meadows ⋮ Instruction sequence processing operators ⋮ Division by Zero in Common Meadows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inversive meadows and divisive meadows
• Straight-line instruction sequence completeness for total calculation on cancellation meadows
• Instruction sequence processing operators
• A logic covering undefinedness in program proofs
• A first order logic for partial functions
• Meadows and the equational specification of division
• Algebraic specifications of computable and semicomputable data types
• Equational theories and universal theories of fields
• Right-divisive groups
• Partial logics reconsidered: A conservative approach
• Program algebra for sequential code
• Completeness in arithmetical algebras
• Module algebra
• The rational numbers as an abstract data type
• Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
• On a three-valued logical calculus and its application to the analysis of the paradoxes of the classical extended functional calculus
• A propositional logic with 4 values: true, false, divergent and meaningless
• The initial meadows
• Inversive semigroups, I
• On notation for ordinal numbers

This page was built for publication: Inversive meadows and divisive meadows