The Jacobson radical for an inconsistency predicate
DOI10.3233/COM-210365MaRDI QIDQ5075520FDOQ5075520
Authors: Daniel Wessel, Peter Schuster
Publication date: 16 May 2022
Published in: Computability (Search for Journal in Brave)
Recommendations
maximal idealaxiom of choiceJacobson radicalmaximal chainconstructive set theoryinductive definitioncomputational contentfinite binary treeconsistent theorysyntactical conservation
Nonclassical and second-order set theories (03E70) Other constructive mathematics (03F65) Axiom of choice and related propositions (03E25)
Cites Work
- Graph theory
- Structural proof theory. With an appendix by Aarne Ranta
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proving open properties by induction
- A course in constructive algebra
- Some points in formal topology.
- A universal Krull-Lindenbaum theorem
- Induction in algebra: a first case study
- Lindenbaum's lemma via open induction
- Title not available (Why is that?)
- Handbook of game theory. Vol. 4
- Glivenko sequent classes in the light of structural proof theory
- Proof Analysis
- The Radical and Semi-Simplicity for Arbitrary Rings
- Title not available (Why is that?)
- Inductively generated formal topologies.
- Krull Implies Zorn
- Glivenko theorems revisited
- A short proof of Glivenko theorems for intermediate predicate logics
- Making the use of maximal ideals constructive
- Aspects of general topology in constructive set theory
- Dynamical method in algebra: Effective Nullstellensätze
- Glivenko theorems for substructural logics over FL
- On the computational content of Zorn's lemma
- A New Proof that “Krull implies Zorn”
- Dimension de Heitmann des treillis distributifs et des anneaux commutatifs
- Commutative algebra: constructive methods. Finite projective modules. Translated from the French by Tania K. Roblot
- Classical propositional logic and decidability of variables in intuitionistic propositional logic
- Constructive commutative algebra. Projective modules over polynomial rings and dynamical Gröbner bases
- The maximality of filters
- Binary refinement implies discrete exponentiation
- Induction in algebra: a first case study
- Convergence in formal topology: a unifying notion
- Eliminating disjunctions by disjunction elimination
- Eliminating disjunctions by disjunction elimination
- More on a curious nucleus
- A curious nucleus
- An algorithmic approach to the existence of ideal objects in commutative algebra
- The origin of Zorn's lemma
- A general extension theorem for directed-complete partial orders
- Some new intuitionistic equivalents of Zorn's Lemma
- On constructive fragments of classical logic
- Cut elimination in sequent calculi with implicit contraction, with a conjecture on the origin of Gentzen's altitude line construction
- Title not available (Why is that?)
- Dynamic evaluation of integrity and the computational content of Krull's lemma
- Resolving finite indeterminacy. A definitive constructive universal prime ideal theorem
- Syntax for semantics: Krull's maximal ideal theorem
- The computational significance of Hausdorff's maximal chain principle
- An algorithmic version of Zariski's lemma
- A Note on Zariski's Lemma
- Embedding classical in minimal implicational logic
- Postponement of $\mathsf {raa}$ and Glivenko's theorem, revisited
- Title not available (Why is that?)
Cited In (2)
Uses Software
This page was built for publication: The Jacobson radical for an inconsistency predicate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075520)