Induction in Algebra: a First Case Study

DOI10.2168/LMCS-9(3:20)2013zbMath1277.03065arXiv1308.2690OpenAlexW2078805352WikidataQ59900912 ScholiaQ59900912MaRDI QIDQ2848365

Peter M. Schuster

Publication date: 26 September 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

open inductionintuitionistic logicZorn's lemmaconstructive algebraHilbert's programme

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Lattice ideals, congruence relations (06B10) Computational aspects of associative rings (general theory) (16Z05) Other constructive mathematics (03F65) Noether lattices (06F10) Axiom of choice and related propositions (03E25)

Related Items (9)

The Jacobson radical for an inconsistency predicate ⋮ A universal algorithm for Krull's theorem ⋮ The basic Zariski topology ⋮ Eliminating disjunctions by disjunction elimination ⋮ ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION ⋮ Dynamic evaluation of integrity and the computational content of Krull's lemma ⋮ Maximal ideals in countable rings, constructively ⋮ The computational significance of Hausdorff's maximal chain principle ⋮ Syntax for Semantics: Krull’s Maximal Ideal Theorem

This page was built for publication: Induction in Algebra: a First Case Study