|
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2007, Number 1, Pages 66–72
(Mi basm51)
|
|
|
|
Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic
A. Rusu Universitatea "Ovidius" Constanţa, România
Abstract:
We consider the propositional provability intuitionistic logic $I^\Delta$, introduced by A. V. Kuznetsov [2]. We prove that there are infinitely many classes of formulas in the calculus of $I^\Delta$, which are pre-complete with respect to functional expressibility in $I^\Delta$. This result is stronger than an ealier one stated by the author in [1].
Keywords and phrases:
Provability-intuitionistic logic, functional expressibility, pre-complete classes of formulas.
Received: 17.10.2006
Citation:
A. Rusu, “Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2007, no. 1, 66–72
Linking options:
https://www.mathnet.ru/eng/basm51 https://www.mathnet.ru/eng/basm/y2007/i1/p66
|
Statistics & downloads: |
Abstract page: | 137 | Full-text PDF : | 48 | References: | 29 |
|