The initial meadows

DOI10.2178/jsl/1278682205zbMath1217.68142arXiv0806.2256OpenAlexW2137723325MaRDI QIDQ4931095

Inge Bethke, P. H. Rodenburg

Publication date: 4 October 2010

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

normal formsword problemdata structuresspecification languagesdecidabilityinitial algebra semanticscomputable algebras

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25)

Related Items (7)

Fracpairs and fractions over a reduced commutative ring ⋮ Transformation of fractions into simple fractions in divisive meadows ⋮ Arithmetical datatypes with true fractions ⋮ Inversive meadows and divisive meadows ⋮ Straight-line instruction sequence completeness for total calculation on cancellation meadows ⋮ Division by zero in non-involutive meadows ⋮ Division by Zero in Common Meadows

Cites Work

• Unnamed Item
• Meadows and the equational specification of division
• Pillars of computer science. Essays dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday
• Initial Algebra Semantics and Continuous Algebras
• Subdirect unions in universal algebra

This page was built for publication: The initial meadows