Standard

Quantifying over events in probability logic: an introduction. / Speranski, Stanislav O.

In: Mathematical Structures in Computer Science, Vol. 27, No. 8, 2017, p. 1581–1600.

Research output: Contribution to journal › Article › peer-review

Harvard

Speranski, SO 2017, 'Quantifying over events in probability logic: an introduction', Mathematical Structures in Computer Science, vol. 27, no. 8, pp. 1581–1600. https://doi.org/10.1017/S0960129516000189

APA

Speranski, S. O. (2017). Quantifying over events in probability logic: an introduction. Mathematical Structures in Computer Science, 27(8), 1581–1600. https://doi.org/10.1017/S0960129516000189

Vancouver

Speranski SO. Quantifying over events in probability logic: an introduction. Mathematical Structures in Computer Science. 2017;27(8):1581–1600. https://doi.org/10.1017/S0960129516000189

Author

Speranski, Stanislav O. / Quantifying over events in probability logic: an introduction. In: Mathematical Structures in Computer Science. 2017 ; Vol. 27, No. 8. pp. 1581–1600.

BibTeX

@article{40144803bb524bfc8557945959467b5b,
title = "Quantifying over events in probability logic: an introduction",
abstract = "In this article we describe a bunch of probability logics with quantifiers over events, and develop primary techniques for proving computational complexity results (in terms of m-degrees) about these logics, mainly over discrete probability spaces. Also the article contains a comparison with some other probability logics and a discussion of interesting analogies with research in the metamathematics of Boolean algebras, demonstrating a number of attractive features and intuitive advantages of the present proposal.",
author = "Speranski, {Stanislav O.}",
year = "2017",
doi = "10.1017/S0960129516000189",
language = "English",
volume = "27",
pages = "1581–1600",
journal = "Mathematical Structures in Computer Science",
issn = "0960-1295",
publisher = "Cambridge University Press",
number = "8",

}

RIS

TY - JOUR

T1 - Quantifying over events in probability logic: an introduction

AU - Speranski, Stanislav O.

PY - 2017

Y1 - 2017

N2 - In this article we describe a bunch of probability logics with quantifiers over events, and develop primary techniques for proving computational complexity results (in terms of m-degrees) about these logics, mainly over discrete probability spaces. Also the article contains a comparison with some other probability logics and a discussion of interesting analogies with research in the metamathematics of Boolean algebras, demonstrating a number of attractive features and intuitive advantages of the present proposal.

AB - In this article we describe a bunch of probability logics with quantifiers over events, and develop primary techniques for proving computational complexity results (in terms of m-degrees) about these logics, mainly over discrete probability spaces. Also the article contains a comparison with some other probability logics and a discussion of interesting analogies with research in the metamathematics of Boolean algebras, demonstrating a number of attractive features and intuitive advantages of the present proposal.

U2 - 10.1017/S0960129516000189

DO - 10.1017/S0960129516000189

M3 - Article

VL - 27

SP - 1581

EP - 1600

JO - Mathematical Structures in Computer Science

JF - Mathematical Structures in Computer Science

SN - 0960-1295

IS - 8

ER -

ID: 10083055