On some classes of formulas in S5 which are pre-complete relative to existential expressibility
Existential expressibility for all $k$-valued functions was proposed by A.~V. Kuz\-ne\-tsov and later was investigated in more details by S.~S.~Mar\-chen\-kov. In the present paper, we consider existential expressibility in the case of formulas defined by a logical calculus and find out some conditi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2023-12-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v31-n3/v31-n3-(pp395-408).pdf |
| _version_ | 1797353203739656192 |
|---|---|
| author | Andrei Rusu Elena Rusu |
| author_facet | Andrei Rusu Elena Rusu |
| author_sort | Andrei Rusu |
| collection | DOAJ |
| description | Existential expressibility for all $k$-valued functions was proposed by A.~V. Kuz\-ne\-tsov and later was investigated in more details by S.~S.~Mar\-chen\-kov. In the present paper, we consider existential expressibility in the case of formulas defined by a logical calculus and find out some conditions for a system of formulas to be closed relative to existential expressibility. As a consequence, it has been established some pre-complete as to existential expressibility classes of formulas in some finite extensions of the paraconsistent modal logic $S5$. |
| first_indexed | 2024-03-08T13:27:45Z |
| format | Article |
| id | doaj.art-a5a46cf18f3044db928dc5d2cbe7b760 |
| institution | Directory Open Access Journal |
| issn | 1561-4042 2587-4330 |
| language | English |
| last_indexed | 2024-03-08T13:27:45Z |
| publishDate | 2023-12-01 |
| publisher | Vladimir Andrunachievici Institute of Mathematics and Computer Science |
| record_format | Article |
| series | Computer Science Journal of Moldova |
| spelling | doaj.art-a5a46cf18f3044db928dc5d2cbe7b7602024-01-17T13:02:19ZengVladimir Andrunachievici Institute of Mathematics and Computer ScienceComputer Science Journal of Moldova1561-40422587-43302023-12-01313(93)395408https://doi.org/10.56415/csjm.v31.21On some classes of formulas in S5 which are pre-complete relative to existential expressibilityAndrei Rusu0https://orcid.org/0000-0002-0259-3060Elena Rusu1https://orcid.org/0000-0002-2473-0353Vladimir Andrunavhievici Institute of Mathematics and Computer Science, State University of Moldova; Dep. of Mathematics and Informatics, Ovidius University of ConstantaDep. of Mathematics, Technical University of Moldova 168, Stefan cel Mare bd, Chisinau, Republic of Moldova, MD-2004Existential expressibility for all $k$-valued functions was proposed by A.~V. Kuz\-ne\-tsov and later was investigated in more details by S.~S.~Mar\-chen\-kov. In the present paper, we consider existential expressibility in the case of formulas defined by a logical calculus and find out some conditions for a system of formulas to be closed relative to existential expressibility. As a consequence, it has been established some pre-complete as to existential expressibility classes of formulas in some finite extensions of the paraconsistent modal logic $S5$.http://www.math.md/files/csjm/v31-n3/v31-n3-(pp395-408).pdfparaconsistent logicexistential expressibilitylogical calculi |
| spellingShingle | Andrei Rusu Elena Rusu On some classes of formulas in S5 which are pre-complete relative to existential expressibility Computer Science Journal of Moldova paraconsistent logic existential expressibility logical calculi |
| title | On some classes of formulas in S5 which are pre-complete relative to existential expressibility |
| title_full | On some classes of formulas in S5 which are pre-complete relative to existential expressibility |
| title_fullStr | On some classes of formulas in S5 which are pre-complete relative to existential expressibility |
| title_full_unstemmed | On some classes of formulas in S5 which are pre-complete relative to existential expressibility |
| title_short | On some classes of formulas in S5 which are pre-complete relative to existential expressibility |
| title_sort | on some classes of formulas in s5 which are pre complete relative to existential expressibility |
| topic | paraconsistent logic existential expressibility logical calculi |
| url | http://www.math.md/files/csjm/v31-n3/v31-n3-(pp395-408).pdf |
| work_keys_str_mv | AT andreirusu onsomeclassesofformulasins5whichareprecompleterelativetoexistentialexpressibility AT elenarusu onsomeclassesofformulasins5whichareprecompleterelativetoexistentialexpressibility |