The Jacobson radical for an inconsistency predicate
From MaRDI portal
Publication:5075520
DOI10.3233/COM-210365MaRDI QIDQ5075520
Daniel Wessel, Peter M. Schuster
Publication date: 16 May 2022
Published in: Computability (Search for Journal in Brave)
maximal chain; maximal ideal; Jacobson radical; axiom of choice; constructive set theory; inductive definition; computational content; finite binary tree; consistent theory; syntactical conservation
03E70: Nonclassical and second-order set theories
03F65: Other constructive mathematics
03E25: Axiom of choice and related propositions
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A universal Krull-Lindenbaum theorem
- Glivenko sequent classes in the light of structural proof theory
- A short proof of Glivenko theorems for intermediate predicate logics
- Handbook of game theory. Vol. 4
- Binary refinement implies discrete exponentiation
- A curious nucleus
- Glivenko theorems revisited
- Proving open properties by induction
- The maximality of filters
- A course in constructive algebra
- The origin of Zorn's lemma
- Inductively generated formal topologies.
- Some new intuitionistic equivalents of Zorn's Lemma
- Some points in formal topology.
- Eliminating disjunctions by disjunction elimination
- Dynamic evaluation of integrity and the computational content of Krull's lemma
- The computational significance of Hausdorff's maximal chain principle
- An algorithmic version of Zariski's lemma
- An algorithmic approach to the existence of ideal objects in commutative algebra
- More on a curious nucleus
- Commutative algebra: constructive methods. Finite projective modules. Translated from the French by Tania K. Roblot
- Constructive commutative algebra. Projective modules over polynomial rings and dynamical Gröbner bases
- Making the use of maximal ideals constructive
- Aspects of general topology in constructive set theory
- Postponement of $\mathsf {raa}$ and Glivenko's theorem, revisited
- Embedding classical in minimal implicational logic
- Induction in Algebra: a First Case Study
- Classical propositional logic and decidability of variables in intuitionistic propositional logic
- Induction in Algebra: A First Case Study
- Proof Analysis
- Lindenbaum’s Lemma via Open Induction
- Glivenko theorems for substructural logics over FL
- Dimension de Heitmann des treillis distributifs et des anneaux commutatifs
- A Note on Zariski's Lemma
- Krull Implies Zorn
- A New Proof that “Krull implies Zorn”
- A General Extension Theorem for Directed-Complete Partial Orders
- Convergence in formal topology: a unifying notion
- Syntax for Semantics: Krull’s Maximal Ideal Theorem
- On the computational content of Zorn's lemma
- Resolving finite indeterminacy
- 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
- ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION
- The Radical and Semi-Simplicity for Arbitrary Rings
- Dynamical method in algebra: Effective Nullstellensätze
