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 7 of 7 for “"sequent calculus"”.

  1. Linear Logic and Noncommutativity in the Calculus of Structures

    … All systems will be designed within the calculus of structures, which is a proof theoretical formalism for specifying logical systems, in the tradition of Hilbert's formalism, natural deduction, and the sequent calculus. Systems in the calculus of structures are based on two simple …

    qucosa-diss

  2. Sequent calculi with an efficient loop-check for BDI logics /

    Sequent calculi for BDI logics is a research object of the thesis. BDI logics are widely used for agent system description and implementation. Agents are autonomous systems, those acts in some environment and aspire to achieve preassigned goals. Implementation of the decision making is the main and …

    vilnius Repository record for Sequent calculi with an efficient loop-check for BDI logics / (opens in a new tab)

  3. Propositional proof systems : efficiency and automatizability

    … for proving lower bounds in propositional calculus. Our method is based on the purely computational concept of pseudorandom generator. Namely, we call a pseudorandom generator Gn: [0, 1 ] - [0, 1]m hard for a propositional proof system P if P cannot efficiently prove the (properly encoded) …

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

  4. A Possible and Necessary Consistency Proof

    … of Heyting arithmetic is shown both in a sequent calculus notation and in natural deduction. The former proof includes a cut elimination theorem for the calculus and a syntactical study of the purely arithmetical part of the system. The latter consistency proof in standard natural …

    helsinki Repository record for A Possible and Necessary Consistency Proof (opens in a new tab)

  5. Automatic inductive theorem proving and program construction methods using program transformation

    … with respect to a logical proof system using sequent calculus. We show that the constructed programs are correct with respect to their specification. The main contributions of this thesis can be summarised as follows. First, we present fully automatic, and efficient inductive theorem proving …

    dcu Repository record for Automatic inductive theorem proving and program construction methods using program transformation (opens in a new tab)

  6. Substructurality and residuation in logic and algebra

    … natural way of introducing a logic is by using a sequent calculus, or Gentzen system. These systems are determined by specifying a set of axioms and a set of rules. Axioms are then starting points from which we can derive new consequences by using the rules. Hilbert systems consist also on a set …

    cagliari Repository record for Substructurality and residuation in logic and algebra (opens in a new tab)

  7. Verovatnosni računi sekvenata i klasifikacija neklasičnih logika zasnovana na entropiji

    Posle kratkog uvodnog pregleda, rad je podeljen na dva dela. Prvi deo se bavi prisustvom verovatnoće u logici (v. [16], [17], [18], [19], [22], [23] i [24]), a drugi je posvećen primeni entropije u klasifikaciji polivalentnih logika (v. [14], [15], [20], [21] i [25]). Osnovna ideja koja dominira …

    belgrade Repository record for Verovatnosni računi sekvenata i klasifikacija neklasičnih logika zasnovana na entropiji (opens in a new tab)