ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION
From MaRDI portal
Publication:5363372
DOI10.1017/bsl.2017.13zbMath1455.03074OpenAlexW2685774512MaRDI QIDQ5363372
Daniel Wessel, Davide Rinaldi, Peter M. Schuster
Publication date: 6 October 2017
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/bsl.2017.13
axiom of choiceHilbert's programmeentailment relationsyntactical conservationdisjunction elimination
Other constructive mathematics (03F65) Proof theory in general (including proof-theoretic semantics) (03F03) Axiom of choice and related propositions (03E25)
Related Items (19)
The Jacobson radical for an inconsistency predicate ⋮ THE JACOBSON RADICAL OF A PROPOSITIONAL THEORY ⋮ A universal algorithm for Krull's theorem ⋮ Eliminating disjunctions by disjunction elimination ⋮ Radical theory of Scott-open filters ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) ⋮ Dynamic evaluation of integrity and the computational content of Krull's lemma ⋮ Lindenbaum’s Lemma via Open Induction ⋮ Constructive Proofs of Negated Statements ⋮ Unnamed Item ⋮ Cut elimination for entailment relations ⋮ The Hahn-Banach theorem by disjunction elimination ⋮ A note on connected reduced rings ⋮ Ordering groups constructively ⋮ Lattice-ordered groups generated by an ordered group and regular systems of ideals ⋮ Maximal ideals in countable rings, constructively ⋮ The computational significance of Hausdorff's maximal chain principle ⋮ Syntax for Semantics: Krull’s Maximal Ideal Theorem
Cites Work
- A universal Krull-Lindenbaum theorem
- Proof-theoretical analysis of order relations
- Simple consequence relations
- Finitary formal topologies and Stone's representation theorem
- Space of valuations
- Proving open properties by induction
- Two applications of Boolean models
- Semantical investigations in Heyting's intuitionistic logic
- A globalization of the Hahn-Banach theorem
- Theory of logical calculi. Basic theory of consequence operations
- A course in constructive algebra
- Logic at work. Essays dedicated to the memory of Helena Rasiowa
- Constructive rereading of Artin-Schreier theory
- Untersuchungen über das logische Schliessen. I
- Untersuchungen über das logische Schliessen. II
- Valuations and Dedekind's Prague theorem
- Non-deterministic inductive definitions
- Minimal from classical proofs
- Remarks on the Scott-Lindenbaum theorem
- 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
- Choice structures and preference relations
- Truth, syntax and modality. Proceedings of the Temple University conference on alternative semantics
- Dynamical algebraic structures, pointfree topological spaces and Hilbert's program. (Structures algébriques dynamiques, espaces topologiques sans points et programme de Hilbert)
- Teilbarkeitstheorie in Bereichen
- Die Erweiterung halbgeordneter Gruppen zu Verbandsgruppen
- Induction in Algebra: a First Case Study
- Induction in Algebra: A First Case Study
- On a conservative extension argument of Dana Scott
- Proof Analysis
- Lindenbaum’s Lemma via Open Induction
- Geometric Hahn-Banach theorem
- A logical approach to abstract algebra
- Continuous domains as formal spaces
- Hidden constructions in abstract algebra. Krull Dimension of distributive lattices and commutative rings
- Non-Deterministic Inductive Definitions and Fullness
- Generalized geometric theories and set-generated classes
- Algebraische und logistische Untersuchungen über freie Verbände
- Algorithms in real algebraic geometry
- Über halbgeordnete Gruppen
- Dynamical method in algebra: Effective Nullstellensätze
- Hidden constructions in abstract algebra. I: Integral dependance.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION
