Maximal elements with minimal logic

DOI10.1016/j.ipl.2023.106403OpenAlexW4367672023MaRDI QIDQ6161463

Daniel Misselbeck-Wessel

Publication date: 5 June 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2023.106403

zbMATH Keywords

constructive mathematicsformal methodsZorn's lemmadomain theory

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A course in constructive algebra
• Constructive domain theory as a branch of intuitionistic pointfree topology
• Krivine's intuitionistic proof of classical completeness (for countable languages)
• Maximal ideals in countable rings, constructively
• Making the use of maximal ideals constructive
• Aspects of general topology in constructive set theory
• A universal algorithm for Krull's theorem
• Radical theory of Scott-open filters
• On Tarski’s fixed point theorem
• Frames and Locales
• Proofs and Computations
• Une Preuve Formelle et Intuitionniste du Théorème de Complétude de la Logique Classique
• A logical approach to abstract algebra
• Spaces of maximal points
• Zorn's lemma and complete Boolean algebras in intuitionistic type theories
• The consistency of classical set theory relative to a set theory with intu1tionistic logic
• Continuous Lattices and Domains
• Syntax for Semantics: Krull’s Maximal Ideal Theorem
• Recursive Functions and Constructive Mathematics
• A remark on method in transfinite algebra
• Logic and structure
• Domain Theory and Realisability over Scott’s D_∞ in Constructive Set Theory