| Articolul precedent |
| Articolul urmator |
 |
 66 0 |
 SM ISO690:2012IZBASH, Olga. Non-existence of finite approximation relative to model-completeness in the provability-intuitionistic logic. In: Annual Congress of the American Romanian Academy of Arts and Sciences.: Proceedings of the 35th ARA Congress , Ed. Ediția 35, 6-10 iulie 2011, Timișoara. Montreal; Canada: 2011, Ediția 35, pp. 298-300. ISBN 978-1-935924-01-2. ISSN 978-2-553-01596-0. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Annual Congress of the American Romanian Academy of Arts and Sciences. Ediția 35, 2011 |
||||||
|
Conferința "Annual Congress of the American Romanian Academy of Arts and Sciences" Ediția 35, Timișoara, Romania, 6-10 iulie 2011 | ||||||
|
||||||
| Pag. 298-300 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
A. V. Kuznetsov [1] has introduced into consideration the provability-intuitionistic calculus and its interpretation in terms of Δ − pseudo-boolean algebras. Author has previously established an infinite number of model-pre-complete classes in provability-intuitionistic logic. In the present paper, author has strengthened this result, and proved that this logic is not finitely approximated relative to model-completeness. It is constructed an example of system of formulas which is not model-complete in LCΔ logic, but it is model-complete in any tabular extension of this logic. Keywords: intuitionistic calculus, provability-intuitionistic logic, Δ |
||||||
| Cuvinte-cheie intuitionistic calculus, Provability-intuitionistic logic, Δ − pseudo-boolean algebra, model-complete system, approximated logic |
||||||
|
|
|
|
