Lindenbaum’s Lemma via Open Induction

DOI10.1007/978-3-319-29198-7_3zbMath1439.03032OpenAlexW2408986766MaRDI QIDQ3305552

Francesco Ciraulo, Davide Rinaldi, Peter M. Schuster

Publication date: 7 August 2020

Published in: Advances in Proof Theory (Search for Journal in Brave)

Full work available at URL: http://www.springer.com/it/book/9783319291963

zbMATH Keywords

complete latticeintuitionistic logicLindenbaum algebracomplete consistent theorystrong primality tests

Mathematics Subject Classification ID

Classical first-order logic (03B10) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (6)

A universal Krull-Lindenbaum theorem ⋮ The Jacobson radical for an inconsistency predicate ⋮ THE JACOBSON RADICAL OF A PROPOSITIONAL THEORY ⋮ Eliminating disjunctions by disjunction elimination ⋮ ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION ⋮ The computational significance of Hausdorff's maximal chain principle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A universal Krull-Lindenbaum theorem
• Intuitionistic completeness of first-order logic
• Proving open properties by induction
• Two applications of Boolean models
• Strongly Noetherian rings and constructive ideal theory
• A Direct Proof of Wiener’s Theorem
• Induction in Algebra: A First Case Study
• CONSERVATIVITY FOR THEORIES OF COMPOSITIONAL TRUTH VIA CUT ELIMINATION
• Construction of Satisfaction Classes for Nonstandard Models
• Constructive topology and combinatorics
• An application of constructive completeness
• Pretopologies and completeness proofs
• ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION
• A constructive semantics for non‐deducibility
• The completeness of the first-order functional calculus

This page was built for publication: Lindenbaum’s Lemma via Open Induction