Reifying dynamical algebra: maximal ideals in countable rings, constructively
From MaRDI portal
Cites work
- A characterization of non-isometric binary words
- A continuity principle, a version of Baire's theorem and a boundedness principle
- A course in constructive algebra
- A general extension theorem for directed-complete partial orders
- A judgmental reconstruction of modal logic
- A logical approach to abstract algebra
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A map of update constraints in inductive inference
- A New Proof that “Krull implies Zorn”
- A note on connected reduced rings
- A Note on the Algebraic Closure of a Field
- A reconstruction of Steel's multiverse project
- A sheaf model of the algebraic closure
- A solution to Wiehagen's thesis
- A theorem of Gilmer and the canonical universal splitting ring
- A universal Krull-Lindenbaum theorem
- About Goodman's theorem
- Algebraische und logistische Untersuchungen über freie Verbände
- An extension of the Galois theory of Grothendieck
- Asymptotic number of isometric generalized Fibonacci cubes
- Bad pictures: some structural properties related to overlaps
- Cautious limit learning
- Checking whether a word is Hamming-isometric in linear time
- Classical proofs as programs: how, what and why
- Classifying topoi and finite forcing
- Commutative algebra: constructive methods. Finite projective modules. Translated from the French by Tania K. Roblot
- Completeness theorems for first-order logic analysed in constructive type theory
- Constructive Aspects of Noetherian Rings
- Constructive commutative algebra. Projective modules over polynomial rings and dynamical Gröbner bases
- Constructive Sheaf Semantics
- Continuity and geometric logic
- Continuity and nondiscontinuity in constructive mathematics
- Continuity properties in constructive mathematics
- Criteria of language learning
- Cut elimination for entailment relations
- Data types à la carte
- Decidable Kripke models of intuitionistic theories
- Dependent choice, `quote' and the clock
- Der Minimalkalkül, ein reduzierter intuitionistischer Formalismus.
- Do Noetherian modules have Noetherian basis functions?
- Dynamic evaluation of integrity and the computational content of Krull's lemma
- Dynamical method in algebra: Effective Nullstellensätze
- Eliminating disjunctions by disjunction elimination
- Eliminating disjunctions by disjunction elimination
- Exercises in modules and rings.
- Exploring mathematical objects from custom-tailored mathematical universes
- Exploring predicativity
- Extended bar induction in applicative theories
- Fair reactive programming
- Five stages of accepting constructive mathematics
- Forcing and the universe of sets: must we lose insight?
- Forcing for hat inductive definitions in arithmetic
- Forcing for IZF in sheaf toposes
- Forcing for mathematicians
- Forcing in intuitionistic systems without power-set
- Forcing in Proof Theory
- Frames and Locales
- Fun slot machines and transformations of words avoiding factors
- Fundamental concepts of the methodology of the deductive sciences. I.
- Generalized Fibonacci cubes
- Generalized spaces for constructive algebra
- Geometric spaces with no points
- Grothendieck Topology as Geometric Modality
- Handbook of Spatial Logics
- Hidden constructions in abstract algebra. Krull Dimension of distributive lattices and commutative rings
- scientific article; zbMATH DE number 2184445 (Why is no real title available?)
- scientific article; zbMATH DE number 5695342 (Why is no real title available?)
- scientific article; zbMATH DE number 3825806 (Why is no real title available?)
- scientific article; zbMATH DE number 3916267 (Why is no real title available?)
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- scientific article; zbMATH DE number 3984596 (Why is no real title available?)
- scientific article; zbMATH DE number 4068863 (Why is no real title available?)
- scientific article; zbMATH DE number 3664922 (Why is no real title available?)
- scientific article; zbMATH DE number 19039 (Why is no real title available?)
- scientific article; zbMATH DE number 42114 (Why is no real title available?)
- scientific article; zbMATH DE number 3497860 (Why is no real title available?)
- scientific article; zbMATH DE number 3539202 (Why is no real title available?)
- scientific article; zbMATH DE number 3550851 (Why is no real title available?)
- scientific article; zbMATH DE number 3554471 (Why is no real title available?)
- scientific article; zbMATH DE number 3574077 (Why is no real title available?)
- scientific article; zbMATH DE number 3614784 (Why is no real title available?)
- scientific article; zbMATH DE number 408780 (Why is no real title available?)
- scientific article; zbMATH DE number 1201510 (Why is no real title available?)
- scientific article; zbMATH DE number 1226875 (Why is no real title available?)
- scientific article; zbMATH DE number 517033 (Why is no real title available?)
- scientific article; zbMATH DE number 626734 (Why is no real title available?)
- scientific article; zbMATH DE number 194764 (Why is no real title available?)
- scientific article; zbMATH DE number 1840601 (Why is no real title available?)
- scientific article; zbMATH DE number 763370 (Why is no real title available?)
- scientific article; zbMATH DE number 794186 (Why is no real title available?)
- scientific article; zbMATH DE number 1420784 (Why is no real title available?)
- scientific article; zbMATH DE number 1420837 (Why is no real title available?)
- scientific article; zbMATH DE number 6307933 (Why is no real title available?)
- scientific article; zbMATH DE number 6423784 (Why is no real title available?)
- scientific article; zbMATH DE number 3275577 (Why is no real title available?)
- scientific article; zbMATH DE number 2247249 (Why is no real title available?)
- Hypercubes and isometric words based on swap and mismatch distance
- Idealtheorie in Ringen mit Teilkettensatz ohne Endlichkeitsbedingung.
- Incremental learning from positive data
- Induction in algebra: a first case study
- Induction in algebra: a first case study
- Inductive inference of automata, functions and programs
- Inductive inference of formal languages from positive data
- Isometric words based on swap and mismatch distance
- Jewels of Stringology
- Krivine's intuitionistic proof of classical completeness (for countable languages)
- Krull Implies Zorn
- La logique de l'infini.
- Language identification in the limit
- Language learning from texts: Mindchanges, limited memory and monotonicity
- Lazy bases: a minimalist constructive theory of Noetherian rings
- Learning indexed families of recursive languages from positive data: A survey
- Learning languages with decidable hypotheses
- Learning strategies
- Logic and structure
- Lorenzen's reshaping of Krull's Fundamentalsatz for integral domains (1938--1953)
- Making the use of maximal ideals constructive
- Maximal ideals in countable rings, constructively
- Minimal prime ideals and arithmetic comprehension
- Monotonic and dual monotonic language learning
- Monotonic and non-monotonic inductive inference
- Noetherian orders
- Nontrivial Uses of Trivial Rings
- Normal forms in semantic language identification
- On \(k\)-ary \(n\)-cubes and isometric words
- On Krull's separation lemma
- On the Cauchy completeness of the constructive Cauchy reals
- On the computational content of Zorn's lemma
- On the failure of BD-ℕ and BD, and an application to the anti-specker property
- On the necessity of some topological spaces
- On various negative translations
- Optimal language learning from positive data
- Ordering groups constructively
- Polynomials and radical ideals
- Proofs of two conjectures on generalized Fibonacci cubes
- Proper maps of toposes
- Prudence and other conditions on formal language learning
- Quaternary n-cubes and isometric words
- Radical theory of Scott-open filters
- Ramsey's Theorem and the Pigeonhole Principle in Intuitionistic Mathematics
- Realizability. An introduction to its categorical side
- Resolving finite indeterminacy. A definitive constructive universal prime ideal theorem
- Results on memory-limited U-shaped learning
- Revolutions and revelations in computability. 18th conference on computability in Europe, CiE 2022, Swansea, UK, July 11--15, 2022. Proceedings
- Ribenboim's order extension theorem from a constructive point of view
- Separating fragments of WLEM, LPO, and MP
- Separating the fan theorem and its weakenings
- Separating the fan theorem and its weakenings. II
- Set-driven and rearrangement-independent learning of recursive languages
- Sketches for arithmetic universes
- Splitting fields of central simple algebras of exponent two
- Standard bases for general coefficient rings and a new constructive proof of Hilbert's basis theorem
- Strongly Noetherian rings and constructive ideal theory
- Strongly non-U-shaped language learning results by general techniques
- Structure of Fibonacci cubes: a survey
- Syntax for semantics: Krull's maximal ideal theorem
- Systems that learn. An introduction to learning theory for cognitive and computer scientists
- The Ascending Tree Condition: Constructive Algebra Without Countable Choice
- The computational significance of Hausdorff's maximal chain principle
- The consistency of classical set theory relative to a set theory with intu1tionistic logic
- The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis
- The Jacobson radical for an inconsistency predicate
- The Peirce translation and the double negation shift
- The point of pointless topology
- The Power of the Ultrafilter Theorem
- The Russell-Prawitz modality
- The set-theoretic multiverse
- The structures of bad words
- The uses of set theory
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- Topoi. The categorial analysis of logic. Rev. ed
- Toposes without points
- Toward a mathematical theory of inductive inference
- Towards an atlas of computational learning theory
- Typed lambda-calculus in classical Zermelo-Fraenkel set theory
- U-shaped, iterative, and iterative-with-counter learning
- Une Preuve Formelle et Intuitionniste du Théorème de Complétude de la Logique Classique
- What is Noetherian?
- When unlearning helps
This page was built for publication: Reifying dynamical algebra: maximal ideals in countable rings, constructively
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7020824)