Induction in Algebra: A First Case Study

DOI10.1109/LICS.2012.68zbMath1364.03086MaRDI QIDQ2986836

Peter M. Schuster

Publication date: 16 May 2017

Published in: 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

zbMATH Keywords

open inductionZorn's lemmaconstructive algebraHilbert's programmeintutionistic logic

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 (11)

A universal Krull-Lindenbaum theorem ⋮ The Jacobson radical for an inconsistency predicate ⋮ A universal algorithm for Krull's theorem ⋮ Eliminating disjunctions by disjunction elimination ⋮ ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION ⋮ A constructive notion of codimension ⋮ Dynamic evaluation of integrity and the computational content of Krull's lemma ⋮ Lindenbaum’s Lemma via Open Induction ⋮ 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