Eliminating disjunctions by disjunction elimination

DOI10.1017/BSL.2017.13zbMATH Open1455.03074OpenAlexW2685774512MaRDI QIDQ5363372FDOQ5363372

Authors: Davide Rinaldi, Daniel Wessel, Peter 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

Recommendations

• Eliminating disjunctions by disjunction elimination
• The Hahn-Banach theorem by disjunction elimination
• Proof-theoretical analysis of order relations
• The disjunction and related properties for constructive Zermelo-Fraenkel set theory
• Further applications of ultra-conservative ω-rules

zbMATH Keywords

axiom of choiceHilbert's programmeentailment relationsyntactical conservationdisjunction elimination

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) Other constructive mathematics (03F65) Axiom of choice and related propositions (03E25)

Cites Work

• Untersuchungen über das logische Schliessen. I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A globalization of the Hahn-Banach theorem
• Theory of logical calculi. Basic theory of consequence operations
• Untersuchungen über das logische Schliessen. II
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms in real algebraic geometry
• Space of valuations
• Proving open properties by induction
• Semantical investigations in Heyting's intuitionistic logic
• A course in constructive algebra
• Valuations and Dedekind's Prague theorem
• Remarks on the Scott-Lindenbaum theorem
• A universal Krull-Lindenbaum theorem
• Induction in algebra: a first case study
• Lindenbaum's lemma via open induction
• A logical approach to abstract algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hidden constructions in abstract algebra. Krull Dimension of distributive lattices and commutative rings
• Hidden constructions in abstract algebra. I: Integral dependance.
• Minimal from classical proofs
• Proof Analysis
• Continuous domains as formal spaces
• Simple consequence relations
• Choice structures and preference relations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dynamical algebraic structures, pointfree topological spaces and Hilbert's program. (Structures algébriques dynamiques, espaces topologiques sans points et programme de Hilbert)
• Dynamical method in algebra: Effective Nullstellensätze
• Truth, syntax and modality. Proceedings of the Temple University conference on alternative semantics
• Non-deterministic inductive definitions and fullness
• Finitary formal topologies and Stone's representation theorem
• Proof-theoretical analysis of order relations
• Algebraische und logistische Untersuchungen über freie Verbände
• Commutative algebra: constructive methods. Finite projective modules. Translated from the French by Tania K. Roblot
• Über halbgeordnete Gruppen
• Constructive commutative algebra. Projective modules over polynomial rings and dynamical Gröbner bases
• Teilbarkeitstheorie in Bereichen
• Title not available (Why is that?)
• Logic at work. Essays dedicated to the memory of Helena Rasiowa
• Induction in algebra: a first case study
• Two applications of Boolean models
• Constructive rereading of Artin-Schreier theory
• Title not available (Why is that?)
• Geometric Hahn-Banach theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-deterministic inductive definitions
• Die Erweiterung halbgeordneter Gruppen zu Verbandsgruppen
• On a conservative extension argument of Dana Scott
• Dana Scott's work with generalized consequence relations
• Generalized geometric theories and set-generated classes

Cited In (26)

• Maximal ideals in countable rings, constructively
• The computational significance of Hausdorff's maximal chain principle
• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
• Extension by conservation. Sikorski's theorem
• A universal algorithm for Krull's theorem
• Title not available (Why is that?)
• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
• Computationally Equivalent Elimination of Conditions
• Ordering groups constructively
• A general Glivenko-Gödel theorem for nuclei
• Lindenbaum's lemma via open induction
• Eliminating disjunctions of leads-to properties
• Constructive proofs of negated statements
• The Jacobson radical for an inconsistency predicate
• THE JACOBSON RADICAL OF A PROPOSITIONAL THEORY
• Radical theory of Scott-open filters
• Searching by elimination
• A note on connected reduced rings
• The Hahn-Banach theorem by disjunction elimination
• The disjunctive procedure and blocker duality
• Cut elimination for entailment relations
• Lattice-ordered groups generated by an ordered group and regular systems of ideals
• Eliminating disjunctions by disjunction elimination
• Dynamic evaluation of integrity and the computational content of Krull's lemma
• The Monotonous Elimination of Predicate Variables
• Syntax for semantics: Krull's maximal ideal theorem

This page was built for publication: Eliminating disjunctions by disjunction elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363372)