Fatal Heyting algebras and forcing persistent sentences (Q454370): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
This paper is one of the last papers of late Leo Esakia, written jointly with Benedikt Löwe. It appeared in the volume of Studia Logica dedicated to the memory of Professor Esakia. The main result of the paper shows that a sentence \(\varphi\) in the first-order language of ZFC is forcing persistent if and only if there is a formula \(\psi\) in the language of propositional logic such that \(\varphi=H(T(\psi)\). Here, \(T\) is the Gödel translation of the intuitionistic propositional calculus HC into the modal system S4, and \(H\) is a forcing translation of S4 into ZFC. From this, it is derived that the intermediate logic KC of the weak law of excluded middle is the logic of ZFC-provable forcing persistent sentences. Finally, it is proved that the category of fatal Heyting algebras (the algebras that model the intermediate logic KC) is both a reflective and coreflective subcategory of the category of all Heyting algebras. | |||
Property / review text: This paper is one of the last papers of late Leo Esakia, written jointly with Benedikt Löwe. It appeared in the volume of Studia Logica dedicated to the memory of Professor Esakia. The main result of the paper shows that a sentence \(\varphi\) in the first-order language of ZFC is forcing persistent if and only if there is a formula \(\psi\) in the language of propositional logic such that \(\varphi=H(T(\psi)\). Here, \(T\) is the Gödel translation of the intuitionistic propositional calculus HC into the modal system S4, and \(H\) is a forcing translation of S4 into ZFC. From this, it is derived that the intermediate logic KC of the weak law of excluded middle is the logic of ZFC-provable forcing persistent sentences. Finally, it is proved that the category of fatal Heyting algebras (the algebras that model the intermediate logic KC) is both a reflective and coreflective subcategory of the category of all Heyting algebras. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Guram Bezhanishvili / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03B55 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03E40 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 06D20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03B45 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6088849 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
forcing | |||
Property / zbMATH Keywords: forcing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
intermediate logics | |||
Property / zbMATH Keywords: intermediate logics / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Heyting algebra | |||
Property / zbMATH Keywords: Heyting algebra / rank | |||
Normal rank |
Revision as of 12:14, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fatal Heyting algebras and forcing persistent sentences |
scientific article |
Statements
Fatal Heyting algebras and forcing persistent sentences (English)
0 references
1 October 2012
0 references
This paper is one of the last papers of late Leo Esakia, written jointly with Benedikt Löwe. It appeared in the volume of Studia Logica dedicated to the memory of Professor Esakia. The main result of the paper shows that a sentence \(\varphi\) in the first-order language of ZFC is forcing persistent if and only if there is a formula \(\psi\) in the language of propositional logic such that \(\varphi=H(T(\psi)\). Here, \(T\) is the Gödel translation of the intuitionistic propositional calculus HC into the modal system S4, and \(H\) is a forcing translation of S4 into ZFC. From this, it is derived that the intermediate logic KC of the weak law of excluded middle is the logic of ZFC-provable forcing persistent sentences. Finally, it is proved that the category of fatal Heyting algebras (the algebras that model the intermediate logic KC) is both a reflective and coreflective subcategory of the category of all Heyting algebras.
0 references
forcing
0 references
intermediate logics
0 references
Heyting algebra
0 references