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 20 of 228 for “"propositional"”.

  1. Models of propositional content

    … and known? One ambition of a theory of propositional content is to point to a class of entities that can be modeled in a way that satisfies the philosophical demands of each of these roles. To this end, I provide a novel theory of propositional content and show that it yields solutions …

    uiuc Repository record for Models of propositional content (opens in a new tab)

  2. Algebraic aspects of propositional logic

    … the connection between abstract algebra and propositional logic. We start by considering the category Bool of Boolean algebras, the algebraic counterpart of classical propositional logic. We provide an algebraic definition of theories and models of classical logic and provide algebraic …

    cape-town Repository record for Algebraic aspects of propositional logic (opens in a new tab)

  3. Power constructs and propositional systems

    Propositional systems are deductively closed sets of sentences phrased in the language of some propositional logic. The set of systems of a given logic is turned into an algebra by endowing it with a number of operations, and into a relational structure by endowing it with a number of relations. …

    cape-town Repository record for Power constructs and propositional systems (opens in a new tab)

  4. Succinct Cryptography via Propositional Proofs

    … In this thesis, we show how to leverage propositional proofs to overcome the non-falsifiability barrier, and make substantial progress in the goal of achieving succinctness in both settings. Our main result is universal construction of both SNARGs and succinct IO for Turing machines from …

    mit Repository record for Succinct Cryptography via Propositional Proofs (opens in a new tab)

  5. Thresholds and Symmetries in Propositional Formulas

    … of algorithms concerning the satisfiability of propositional formulas are investigated. With respect to the first problem, there is great experimental evidence for a phenomenon known as the 'phase transition' of satisfiability, that is there is a sharp threshold, in the limit, between …

    uiuc Repository record for Thresholds and Symmetries in Propositional Formulas (opens in a new tab)

  6. Awareness and Propositional Control in Children

    Made available in DSpace on 2014-12-08T23:01:53Z (GMT). No. of bitstreams: 1 6910790.pdf: 6321926 bytes, checksum: 4578d28cda7cee520e18a9b4741e1c2e (MD5) Previous issue date: 1968

    uiuc Repository record for Awareness and Propositional Control in Children (opens in a new tab)

  7. On the Construction of Propositional Calculi

    Made available in DSpace on 2014-12-04T21:18:18Z (GMT). No. of bitstreams: 1 6400550.pdf: 4133385 bytes, checksum: d0d5e0c080b7d3c72aef69c4aedfd62e (MD5) Previous issue date: 1963

    uiuc Repository record for On the Construction of Propositional Calculi (opens in a new tab)

  8. Propositional proof systems : efficiency and automatizability

    The thesis considers two fundamental questions in propositional proof complexity: lower bounds on the size of the shortest proof and automatizability of propositional proof systems. With respect to the first part, we develop a new paradigm for proving lower bounds in propositional calculus. Our …

    mit Repository record for Propositional proof systems : efficiency and automatizability (opens in a new tab)

  9. Propositional and activity monitoring using qualitative spatial reasoning

    … the combined problem of activity recognition and propositional monitoring. This approach breaks down the problem into smaller sub-tasks. First, the raw sensor input is parsed into simple, easy to understand primitive semantic relationships known as qualitative spatial relations (QSRs). These …

    mit Repository record for Propositional and activity monitoring using qualitative spatial reasoning (opens in a new tab)

  10. Propositional attitudes and indexicality : a cross categorial approach

    … across sortal domains, and develop a theory of propositional attitudes and indexicality that captures these facts, and treats all three categories on a par. First, we extend the notion of 'Sequence' phenomena from tense to person. In Russian, the tense of a direct discourse can be preserved in …

    mit Repository record for Propositional attitudes and indexicality : a cross categorial approach (opens in a new tab)

  11. The validity of the propositional theme in expository preaching

    … dissertation demonstrates the validity of the propositional theme in expository preaching. Chapter 1 examines expository theorists' comprehension and homiletical practice of the propositional theme, and summarizes desired characteristics of the sermon theme. Chapter 2 analyzes the preaching …

    sbts Repository record for The validity of the propositional theme in expository preaching (opens in a new tab)

  12. A Rule Learning Application of the Theory of Propositional Learning

    Made available in DSpace on 2014-12-13T18:21:31Z (GMT). No. of bitstreams: 1 7606682.pdf: 8960941 bytes, checksum: 5d919e7ecaf92185077ee63f9ded789b (MD5) Previous issue date: 1975

    uiuc Repository record for A Rule Learning Application of the Theory of Propositional Learning (opens in a new tab)

  13. Social and Interpersonal Attribution as a Form of Propositional Learning

    Made available in DSpace on 2014-12-10T21:07:48Z (GMT). No. of bitstreams: 1 7412256.pdf: 7797591 bytes, checksum: 2be395127e9f27fa8124a18abd1f27aa (MD5) Previous issue date: 1973

    uiuc Repository record for Social and Interpersonal Attribution as a Form of Propositional Learning (opens in a new tab)

  14. Seeing through opacity : a defense of the Russellian view of propositional attitudes

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1994.

    mit Repository record for Seeing through opacity : a defense of the Russellian view of propositional attitudes (opens in a new tab)

  15. Rank Lower Bounds in Propositional Proof Systems Based on Integer Linear Programming Methods

    The work of this thesis is in the area of proof complexity, an area which looks to uncover the limitations of proof systems. In this thesis we investigate the rank complexity of tautologies for several of the most important proof systems based on integer linear programming methods. The three main …

    durham Repository record for Rank Lower Bounds in Propositional Proof Systems Based on Integer Linear Programming Methods (opens in a new tab)

Page 1 of 12