Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/21582| Tytuł: | Intuitionistic Propositional Calculus in the Extended Framework with Modal Operator. Part I |
| Autorzy: | Inoué, Takao |
| Data wydania: | 2003 |
| Data dodania: | 20-lis-2026 |
| Wydawca: | University of Białystok |
| Źródło: | Formalized Mathematics, Volume 11, Issue 3, Pages 259-266 |
| Abstrakt: | In this paper, we develop intuitionistic propositional calculus IPC in the extended language with single modal operator. The formulation that we adopt in this paper is very useful not only to formalize the calculus but also to do a number of logics with essentially propositional character. In addition, it is much simpler than the past formalization for modal logic. In the first section, we give the mentioned formulation which the author heavily owes to the formalism of Adam Grabowski’s [4]. After the theoretical development of the logic, we prove a number of valid formulas of IPC in the sections 2–4. The last two sections are devoted to present classical propositional calculus and modal calculus S4 in our framework, as a preparation for future study. In the forthcoming Part II of this paper, we shall prove, among others, a number of intuitionistically valid formulas with negation. |
| Afiliacja: | The Iida Technical High School Nagano |
| URI: | http://hdl.handle.net/11320/21582 |
| ISSN: | 1426-2630 |
| e-ISSN: | 1898-9934 |
| Typ Dokumentu: | Article |
| metadata.dc.rights.uri: | https://creativecommons.org/licenses/by-sa/4.0/ |
| Właściciel praw: | © 2003 University of Białystok This work is licensed under the Creative Commons License. |
| Występuje w kolekcji(ach): | Formalized Mathematics, 2003, Volume 11, Issue 3 |
Pliki w tej pozycji:
| Plik | Opis | Rozmiar | Format | |
|---|---|---|---|---|
| Intuitionistic_Propositional_Calculus_in_the_Extended_Framework_with_Modal_Operator_Part_I.pdf | 67,09 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL
