With Raoult’s Open Induction in place of Zorn’s Lemma, we do a perhaps more perspicuous proof of Lindenbaum’s Lemma for not necessarily countable languages of first-order predicate logic.We generally work for and with classical logic, but say what can be achieved for intuitionistic logic, which prompts the natural generalizations for distributive and complete lattices.
Lindenbaum’s Lemma via Open Induction
CIRAULO, FRANCESCO;
2016
Abstract
With Raoult’s Open Induction in place of Zorn’s Lemma, we do a perhaps more perspicuous proof of Lindenbaum’s Lemma for not necessarily countable languages of first-order predicate logic.We generally work for and with classical logic, but say what can be achieved for intuitionistic logic, which prompts the natural generalizations for distributive and complete lattices.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
CirauloRinaldiSchuster.pdf
accesso aperto
Descrizione: articolo
Tipologia:
Preprint (AM - Author's Manuscript - submitted)
Licenza:
Altro
Dimensione
181.25 kB
Formato
Adobe PDF
|
181.25 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
