Completeness Theorem for a Monadic Logic with Both First-order and Probability Quantifiers
Publications de l'Institut Mathématique, _N_S_47 (1990) no. 61, p. 1
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
We prove a completeness theorem for a logic with both
probability and first-order quantifiers in the case when the basic
language contains only unary relation symbols.
Classification :
03C70
@article{PIM_1990_N_S_47_61_a0,
author = {Miodrag Ra\v{s}kovi\'c and Predrag Tanovi\'c},
title = {Completeness {Theorem} for a {Monadic} {Logic} with {Both} {First-order} and {Probability} {Quantifiers}},
journal = {Publications de l'Institut Math\'ematique},
pages = {1 },
year = {1990},
volume = {_N_S_47},
number = {61},
language = {en},
url = {http://geodesic.mathdoc.fr/item/PIM_1990_N_S_47_61_a0/}
}
TY - JOUR AU - Miodrag Rašković AU - Predrag Tanović TI - Completeness Theorem for a Monadic Logic with Both First-order and Probability Quantifiers JO - Publications de l'Institut Mathématique PY - 1990 SP - 1 VL - _N_S_47 IS - 61 UR - http://geodesic.mathdoc.fr/item/PIM_1990_N_S_47_61_a0/ LA - en ID - PIM_1990_N_S_47_61_a0 ER -
%0 Journal Article %A Miodrag Rašković %A Predrag Tanović %T Completeness Theorem for a Monadic Logic with Both First-order and Probability Quantifiers %J Publications de l'Institut Mathématique %D 1990 %P 1 %V _N_S_47 %N 61 %U http://geodesic.mathdoc.fr/item/PIM_1990_N_S_47_61_a0/ %G en %F PIM_1990_N_S_47_61_a0
Miodrag Rašković; Predrag Tanović. Completeness Theorem for a Monadic Logic with Both First-order and Probability Quantifiers. Publications de l'Institut Mathématique, _N_S_47 (1990) no. 61, p. 1 . http://geodesic.mathdoc.fr/item/PIM_1990_N_S_47_61_a0/