EMIS ELibM Electronic Journals PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.)
Vol. 50(64) Preimenovati datoteke, proveriti paginaciju!!!, pp. 7--13 (1991)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

 		 

A completenes theorem for an infinitary intutionistic logic with both ordinary and probability quantifiers

Miodrag Ra{\sh}kovi{\cj}

Prirodno-matematicki fakultet, Kragujevac, Yugoslavia

Abstract: Our main result is a proof of the completeness theorem for an infinitary intuitionistic logic with both ordinary and probability quantifiers with respect to the Kripke semantics.

Classification (MSC2000): 03C70, 03B60

Full text of the article:

Electronic fulltext finalized on: 2 Nov 2001. This page was last modified: 16 Nov 2001.

© 2001 Mathematical Institute of the Serbian Academy of Science and Arts
© 2001 ELibM for the EMIS Electronic Edition