Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting | Zendy

Martı́n Hötzel Escardó | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting

Author(s) -

Martı́n Hötzel Escardó

Publication year - 2009

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2009.07.092

Subject(s) - decidability , probabilistic logic , type (biology) , computer science , mathematics , infinity , theoretical computer science , calculus (dental) , statistics , medicine , ecology , mathematical analysis , dentistry , biology

We show that, in a fairly general setting including higher-types, may, must and probabilistic testing are semi-decidable. The case of must testing is perhaps surprising, as its mathematical definition involves universal quantification over the infinity of possible outcomes of a non-deterministic program. The other two involve existential quantification and integration. We also perform first steps towards the semi-decidability of similar tests under the simultaneous presence of non-deterministic and probabilistic choice

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research