Effective communication shows a positive impact on patient satisfaction, compliance and medical outcomes, at the same time reducing the healthcare costs. Written information for patients needs to correspond to health literacy levels of the intended audiences. Readability formulas correlate well with the reading and comprehension tests but are considered an easier and quicker method to estimate ...

Despite immense variability across languages, people can learn to understand any human language, spoken or signed. What neural mechanisms allow people to comprehend language across sensory modalities? When people listen to speech, electrophysiological oscillations in auditory cortex entrain to slow ([Formula: see text]8 Hz) fluctuations in the acoustic envelope. Entrainment to the speech envelo...

Software architectures and designs "notations" are typically based on bubble-and-arc diagrams. Embellishing these diagrams may increase their information content but does not make a language. A formal language has syntax, semantics, and inference rules, so that reasoning and automatic manipulation are made possible. We describe LePUS, a formal language for describing and reasoning about object ...

We present p-automata, which accept an entire Markovchain as input. Acceptance is determined by solving a se-quence of stochastic weak and weak games. The set oflanguages of Markov chains obtained in this way is closedunder Boolean operations. Language emptiness and con-tainment are equi-solvable, and languages themselves areclosed under bisimulation. A Markov chain (res...

The paper describes a research tool for studying the applicability of bounded model checking techniques to verifying asynchronous software. A simple programming language, PROMELAb, is introduced and an operational semantics for it is defined. The language is basically a subset of PROMELA, the input language of the SPIN model checker. The basic idea is to study techniques for improving the effic...

Software architectures and designs "notations" are typically based on bubble-and-arc diagrams. Embellishing these diagrams may increase their information content but does not make a language. A formal language has syntax, semantics, and inference rules, so that reasoning and automatic manipulation are made possible. We describe LePUS, a formal language for describing and reasoning about object ...

We present the p-adic probability logic LpPP based on the paper [5] by A. Khrennikov et al. The logical language contains formulas such as P=s(α) with the intended meaning “the probability of α is equal to s", where α is a propositional formula. We introduce a class of Kripke-like models that combine properties of the usual Kripke models and finitely additive p-adic probabilities. We propose an...

Proving that one language is more succinct than another becomes harder when the underlying semantics is stronger. We propose to use Formula-Size Games (as put forward by Adler and Immerman, 2003), games that are played on two sets of models, and that directly link the length of play with the size of the formula. Using FSGs, we prove three succinctness results for m-dimensional modal logic: (1) ...