Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 8 of 8 for “"Proper subset"”.

  1. Gramáticas e linguagens indiciais probabilísticas

    … class of languages generated by indexed grammars properly includes a11 context free languages and is a proper subset of the class of context sensitive languages. The objective in this work is to assign propability to each production of the indexed grammar and study the consistency of the indexed …

    brazil-uerj Repository record for Gramáticas e linguagens indiciais probabilísticas (opens in a new tab)

  2. Multishot Capacity of Adversarial Networks

    … adversary who is restricted to corrupting a proper subset of the network edges. In 2018, Ravagnani and Kschischang established a combinatorial framework for adversarial networks. The study was recently furthered by Beemer, Kilic and Ravagnani, with particular focus on the one-shot capacity: a …

    vt Repository record for Multishot Capacity of Adversarial Networks (opens in a new tab)

  3. Modal logics of provability

    … We show this by first showing that GH is a proper subset of GL and then showing that the theorems missing from GH are properties of the provability predicate. We finally, show that GH is not complete with respect to the class of transitive, reversely well-founded models and hence not sound …

    vt Repository record for Modal logics of provability (opens in a new tab)

  4. A Proof That Every Set Can be Well-Ordered.

    The purpose of this paper is to show that the Well-Ordering Theorem is a consequence of the Axiom of Choice via the Moore-Zermelo Proposition. The work herein is completely my own and is not the result of suggestions made by any other person.

    uab Repository record for A Proof That Every Set Can be Well-Ordered. (opens in a new tab)

  5. A Combinatorial Approach to Nearly Uncoupled Markov Chains

    … xt is the state of the system at time t. A subset E � S is referred to as an almost invariant aggregate if whenever xt 2 E, then with high probability xt+1 2 E, as well. That is, if there is a small positive value � such that if xt 2 E then the probability that xt+1 =2 E is less than or …

    maynooth Repository record for A Combinatorial Approach to Nearly Uncoupled Markov Chains (opens in a new tab)

  6. Three Essays on Networks

    … and it is shown that stable equilibria form a proper subset of the sequential ones, which gives a sharper prediction. The stable equilibria demonstrate star-like graphs, which is similar to the phenomenon "the law of the few" in the literature. Chapter three investigates the trade relationship …

    vt Repository record for Three Essays on Networks (opens in a new tab)

  7. Connections between binary systems and admissible topologies

    … various algebraic systems are examined. If the proper subset I contained in the groupoid G is such that the null set, the set G, and each singleton set of the elements in G-I form the basis for an admissible topology for G, then I is called a generalized ideal in G. Properties of generalized …

    vt Repository record for Connections between binary systems and admissible topologies (opens in a new tab)