In recent years the study of probabilistic transition systems has shifted to transition relations over distributions to allow for a smooth adaptation of the standard non-probabilistic apparatus. In this paper we study transition relations over probability distributions in a setting with internal actions. We provide new logics that characterize probabilistic strong, weak and branching bisimulati...

We give some sufficient conditions under which any valued field that admits quantifier elimination in the Macintyre language is henselian. Then, without extra assumptions, we prove that if a valued field of characteristic (0, 0) has a Z-group as its value group and admits quantifier elimination in the main sort of the Denef-Pas style language LRRP then it is henselian. In fact the proof of this...

Currently, adaptive educational hypermedia systems (AEHS) are described with nonuniform methods, depending on the specific view on the system, the application, or other parameters. There is no common language for expressing functionality of AEHS, hence these systems are difficult to compare and analyze. In this paper we investigate how a logical description can be employed to characterize adapt...

Statistics is a science that provides precise techniques for collecting and sorting information made easy by tools and methods for further analysis. The object of descriptive statistics, from sample data, is to describe the most important characteristics, by which we refer to those amounts that provide information on the topic of interest which we are studying.

Context-free tree grammars, originally introduced by Rounds ((Rounds, 1970)), are powerful grammar devices for the definition of tree languages. In the present paper, we consider a subclass of the class of context-free tree languages, namely the class of monadic simple context-free tree languages. For this class of context-free tree languages, a faithful rendering of extended TAGs, we show that...