Narrow your search

Library

KU Leuven (4)

Odisee (3)

Thomas More Kempen (3)

Thomas More Mechelen (3)

UCLL (3)

ULB (3)

ULiège (3)

VIVES (3)

UCLouvain (1)


Resource type

book (4)


Language

English (4)


Year
From To Submit

2020 (1)

2013 (1)

2012 (1)

2006 (1)

Listing 1 - 4 of 4
Sort by

Book
Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs
Author:
Year: 2020 Publisher: New York, New York : Association for Computing Machinery,

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
A Logical Introduction to Proof
Author:
ISBN: 1461436303 1461436311 Year: 2013 Publisher: New York, NY : Springer New York : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

A Logical Introduction to Proof is a unique textbook that uses a logic-first approach to train and guide undergraduates through a transition or “bridge” course  between calculus and advanced mathematics courses.  The author’s approach  prepares the student for the rigors required in future mathematics courses and is appropriate for majors in mathematics, computer science, engineering, as well as other applied mathematical sciences. It may also be beneficial as a supplement for students at the graduate level who need guidance or reference for writing proofs.   Core topics covered are logic, sets, relations, functions, and induction, where logic is the instrument for analyzing the structure of mathematical assertions and is a tool for composing mathematical proofs. Exercises are given at the end of each section within a chapter. Chapter 1 focuses on propositional logic while Chapter 2 is devoted to the logic of quantifiers. Chapter 3 methodically presents the key strategies that are used in mathematical proofs; each presented as a proof diagram. Every proof strategy is carefully illustrated by a variety of mathematical theorems concerning the natural, rational, and real numbers. Chapter 4 focuses on mathematical induction and concludes with a proof of the fundamental theorem of arithmetic. Chapters 5 through 7 introduce students to the essential concepts that appear in all branches of mathematics. Chapter 8 introduces the basic structures of abstract algebra: groups, rings, quotient groups, and quotient rings. Finally, Chapter 9 presents proof strategies that explicitly show students how to deal with the fundamental definitions that they will encounter in real analysis, followed by numerous examples of proofs that use these strategies.  The appendix provides a useful summary of strategies for dealing with proofs.


Book
A proof theory for description logics
Author:
ISBN: 144714001X 1447140028 9786613703453 1280793066 Year: 2012 Publisher: London : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Description Logics (DLs) is a family of formalisms used to represent knowledge of a domain. They are equipped with a formal logic-based semantics. Knowledge representation systems based on description logics provide various inference capabilities that deduce implicit knowledge from the explicitly represented knowledge. A Proof Theory for Description Logics introduces Sequent Calculi and Natural Deduction for some DLs (ALC, ALCQ). Cut-elimination and Normalization are proved for the calculi. The author argues that such systems can improve the extraction of computational content from DLs proofs for explanation purposes.

The seventeen provers of the world
Authors: ---
ISSN: 03029743 ISBN: 9783540307044 3540307044 3540328882 Year: 2006 Volume: 3600 Publisher: Berlin: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Commemorating the 50th anniversary of the first time a mathematical theorem was proven by a computer system, Freek Wiedijk initiated the present book in 2004 by inviting formalizations of a proof of the irrationality of the square root of two from scientists using various theorem proving systems. The 17 systems included in this volume are among the most relevant ones for the formalization of mathematics. The systems are showcased by presentation of the formalized proof and a description in the form of answers to a standard questionnaire. The 17 systems presented are HOL, Mizar, PVS, Coq, Otter/Ivy, Isabelle/Isar, Alfa/Agda, ACL2, PhoX, IMPS, Metamath, Theorema, Leog, Nuprl, Omega, B method, and Minlog.

Listing 1 - 4 of 4
Sort by