On some classes of formulas in S5 which are pre-complete relative to existential expressibility

DOI10.56415/CSJM.V31.21MaRDI QIDQ6546349zbMATH OpenFDO

Authors Andrei Rusu, Elena Rusu

Publication date 29 May 2024

Published in Computer Science Journal of Moldova (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.56415/CSJM.V31.21

zbMATH Keywords

existential expressibilitylogical calculiparaconsistent logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Paraconsistent logics (03B53)

Cites work

• Existential Definability in Arithmetic
• Extensions of the Lewis system S5
• scientific article; zbMATH DE number 3863173 (Why is no real title available?)
• scientific article; zbMATH DE number 4085569 (Why is no real title available?)
• scientific article; zbMATH DE number 3751028 (Why is no real title available?)
• scientific article; zbMATH DE number 107724 (Why is no real title available?)
• scientific article; zbMATH DE number 2020147 (Why is no real title available?)
• scientific article; zbMATH DE number 3231913 (Why is no real title available?)
• scientific article; zbMATH DE number 3378895 (Why is no real title available?)
• Introduction to a general theory of elementary propositions.

This page was built for publication: On some classes of formulas in S5 which are pre-complete relative to existential expressibility

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