Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Preuve (droit pénal) --- Théorie de la démonstration

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

" Emphasizing the creative nature of mathematics, this conversational textbook guides students through the process of discovering a proof. The material revolves around possible strategies to approaching a problem without classifying 'types of proofs' or providing proof templates. Instead, it helps students develop the thinking skills needed to tackle mathematics when there is no clear algorithm or recipe to follow. Beginning by discussing familiar and fundamental topics from a more theoretical perspective, the book moves on to inequalities, induction, relations, cardinality, and elementary number theory. The final supplementary chapters allow students to apply these strategies to the topics they will learn in future courses. With its focus on 'doing mathematics' through 200 worked examples, over 370 problems, illustrations, discussions, and minimal prerequisites, this course will be indispensable to first- and second-year students in mathematics, statistics, and computer science. Instructor resources include solutions to select problems."

Logic, Symbolic and mathematical --- Proof theory. --- Logic, Symbolic and mathematical. --- Théorie de la démonstration --- Logique mathématique --- Théorie de la démonstration. --- Logique mathématique.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

"Proof theory is a central area of mathematical logic of special interest to philosophy . It has its roots in the foundational debate of the 1920s, in particular, in Hilbert's program in the philosophy of mathematics, which called for a formalization of mathematics, as well as for a proof, using philosophically unproblematic, "finitary" means, that these systems are free from contradiction. Structural proof theory investigates the structure and properties of proofs in different formal deductive systems, including axiomatic derivations, natural deduction, and the sequent calculus. Central results in structural proof theory are the normalization theorem for natural deduction, proved here for both intuitionistic and classical logic, and the cut-elimination theorem for the sequent calculus. In formal systems of number theory formulated in the sequent calculus, the induction rule plays a central role. It can be eliminated from proofs of sequents of a certain elementary form: every proof of an atomic sequent can be transformed into a "simple" proof. This is Hilbert's central idea for giving finitary consistency proofs. The proof requires a measure of proof complexity called an ordinal notation. The branch of proof theory dealing with mathematical systems such as arithmetic thus has come to be called ordinal proof theory. The theory of ordinal notations is developed here in purely combinatorial terms, and the consistency proof for arithmetic presented in detail" [Publisher]

Proof theory. --- Logique informatique. --- Théorie de la démonstration. --- Logic, Symbolic and mathematical. --- Logique informatique --- Théorie de la démonstration --- Proof theory --- Logic, Symbolic and mathematical --- Théorie de la démonstration

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Logic, Symbolic and mathematical. --- Proof theory. --- Logique mathématique --- Théorie de la démonstration --- Logique mathématique --- Théorie de la démonstration

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Logica --- Logique --- Curry-Howard isomorphism --- Proof theory --- Lambda calculus --- Type Theory --- Type theory --- Isomorphisme de Curry-Howard --- Théorie de la démonstration --- Lambda-calcul --- Théorie des types --- Isomorphisme de Curry-Howard. --- Théorie de la démonstration. --- Lambda-calcul. --- Théorie des types. --- Théorie de la démonstration. --- Théorie des types.