63 research outputs found
Non-Definability Results for Randomised First-Order Logic
We investigate the expressive power of randomised first-order logic
(BPFO) on restricted classes of structures. While BPFO is
stronger than FO in general, even on structures with a built-in
addition relation, we show that BPFO is not stronger than FO
on structures with a unary vocabulary, nor on the class of
equivalence relations. The same techniques can be applied to show
that evenness of a linear order, and therefore graph connectivity,
can not be defined in BPFO. Finally, we show that there is an
FO[<]-definable query on word structures which can not be
defined in BPFO[+1]
On theories of random variables
We study theories of spaces of random variables: first, we consider random
variables with values in the interval , then with values in an arbitrary
metric structure, generalising Keisler's randomisation of classical structures.
We prove preservation and non-preservation results for model theoretic
properties under this construction: i) The randomisation of a stable structure
is stable. ii) The randomisation of a simple unstable structure is not simple.
We also prove that in the randomised structure, every type is a Lascar type
On continuation-passing transformations and expected cost analysis
We define a continuation-passing style (CPS) translation for a typed \u3bb-calculus with probabilistic choice, unbounded recursion, and a tick operator - for modeling cost. The target language is a (non-probabilistic) \u3bb-calculus, enriched with a type of extended positive reals and a fixpoint operator. We then show that applying the CPS transform of an expression M to the continuation \u3bb v. 0 yields the expected cost of M. We also introduce a formal system for higher-order logic, called EHOL, prove it sound, and show it can derive tight upper bounds on the expected cost of classic examples, including Coupon Collector and Random Walk. Moreover, we relate our translation to Kaminski et al.'s ert-calculus, showing that the latter can be recovered by applying our CPS translation to (a generalization of) the classic embedding of imperative programs into \u3bb-calculus. Finally, we prove that the CPS transform of an expression can also be used to compute pre-expectations and to reason about almost sure termination
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation
Single-round multiway join algorithms first reshuffle data over many servers
and then evaluate the query at hand in a parallel and communication-free way. A
key question is whether a given distribution policy for the reshuffle is
adequate for computing a given query, also referred to as parallel-correctness.
This paper extends the study of the complexity of parallel-correctness and its
constituents, parallel-soundness and parallel-completeness, to unions of
conjunctive queries with and without negation. As a by-product it is shown that
the containment problem for conjunctive queries with negation is
coNEXPTIME-complete
Strengths and limitations of the draft classification of public health interventions in the World Health Organization’s International Classification of Health Interventions: A developmental appraisal
Statistical classifications provide a basis for collecting and analysing data, for building knowledge and communicating information. A classification of public health interventions is being developed as part of the World Health Organization’s International Classification of Health Interventions (ICHI). This is a pioneering development, as there have been no previous efforts to produce a standard classification of public health interventions. A comprehensive developmental appraisal of the draft classification of public health interventions was undertaken to gain an understanding of its strengths and limitations, and to identify what should be done to improve its utility. The classification was used to code three data sets of public health interventions, to identify problems encountered and to assess inter-coder reliability. Views of potential users were elicited through key-informant interviews. An analytical structure was developed, comprising a set of criteria concerning the desired features of a statistical classification and a model representing the main elements that make up a statistical classification. ICHI was found to have some utility for representing data on public health interventions. Limitations identified included coverage gaps, overlap between categories, lack of clarity concerning how the classification axes are operationalised for public health interventions, and difficulty splitting complex interventions into their constituent components for coding. This study makes a significant and timely contribution to the development of the draft classification, by providing specific proposals for improvements to ICHI, explicating some fundamental conceptual issues that should be addressed, and indicating a path forward for the further development and use of ICHI in the field of public health. The analytical structure developed through the conduct of this research represents a novel methodological contribution to the field of classification development
Logic and Automata
Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of Logic and Automata take the occasion of the sixtieth birthday of Wolfgang Thomas to present a tour d'horizon of automata theory and logic. The twenty papers in this volume cover many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, and semigroup theory, as well as discussing current challenges in the field
Logical concepts in cryptography
This thesis is about a breadth-first exploration of logical concepts in cryptography and their linguistic abstraction and model-theoretic combination in a comprehensive logical system, called CPL (for Cryptographic Protocol Logic). We focus on two fundamental aspects of cryptography. Namely, the security of communication (as opposed to security of storage) and cryptographic protocols (as opposed to cryptographic operators). The primary logical concepts explored are the following: the modal concepts of belief, knowledge, norms, provability, space, and time. The distinguishing feature of CPL is that it unifies and refines a variety of existing approaches. This feature is the result of our wholistic conception of property-based (modal logics) and model-based (process algebra) formalisms
- …