Search for dissertations about: "Proof theorem"

Showing result 1 - 5 of 77 swedish dissertations containing the words Proof theorem.

  2. 1. Space in Proof Complexity

    Author : Marc Vinyals; Jakob Nordström; Yehudayoff Amir; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; proof complexity; resolution; polynomial calculus; cutting planes; space complexity; computational complexity; pebble games; communication complexity; CDCL; Computer Science; Datalogi;

    Abstract : ropositional proof complexity is the study of the resources that are needed to prove formulas in propositional logic. In this thesis we are concerned with the size and space of proofs, and in particular with the latter.Different approaches to reasoning are captured by corresponding proof systems. READ MORE

  4. 2. An ALF proof of Mac Lane's coherence theorem

    Author : Ilya Beylin; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Martin-Löf type theory; coherence theorem; monoidal categories; ALF;

    Abstract : .... READ MORE

  5. 3. The fundamental theorem of calculus : a case study into the didactic transposition of proof

    Author : Anna Klisinska; Uwe Gellert; Luleå tekniska universitet; []
    Keywords : SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Mathematics Education; Matematik och lärande;

    Abstract : The relationship between academic mathematics as practiced by researchers at universities and classroom mathematics (the mathematical practices in classrooms in primary, lower and upper secondary education as well as in undergraduate university education) is a fundamental question in mathematics education. The focus of the study presented here is on how this relationship is seen from the perspective of mathematics education and by researching mathematicians, with a focus on proof. READ MORE

  6. 4. Computational Issues in Calculi of Partial Inductive Definitions

    Author : Per Kreuger; RISE; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Theory of computation; algorithms; logic; proof-theory; partial inductive defi-nitions; definitional reflection; disunification; closure; completion; negation; constructive negation; quantification; logic programming; meta programming; quantification; skolemization; self-reference; program semantics; declarative control; proof-search; theorem-proving.;

    Abstract : We study the properties of a number of algorithms proposed to explore the computational space generated by a very simple and general idea: the notion of a mathematical definition and a number of suggested formal interpretations ofthis idea. Theories of partial inductive definitions (PID) constitute a class of logics based on the notion of an inductive definition. READ MORE

  7. 5. Essays on Strategy-proof Social Choice

    Author : Alexander Reffgen; Nationalekonomiska institutionen; []
    Keywords : SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Strategy-proofness; Social choice functions; Gibbard-Satterthwaite theorem; Restricted preference domains;

    Abstract : This thesis makes a contribution to strategy-proof social choice theory, in which one investigates the conditions under which it is possible to construct social choice functions (i.e. READ MORE