Listing 1 - 10 of 37 | << page >> |
Sort by
|
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
Almost all of the problems studied in this book are motivated by an overriding foundational question: What are the appropriate axioms for mathematics? Through a series of case studies, these axioms are examined to prove particular theorems in core mathematical areas such as algebra, analysis, and topology, focusing on the language of second-order arithmetic, the weakest language rich enough to express and develop the bulk of mathematics. In many cases, if a mathematical theorem is proved from appropriately weak set existence axioms, then the axioms will be logically equivalent to the theorem. Furthermore, only a few specific set existence axioms arise repeatedly in this context, which in turn correspond to classical foundational programs. This is the theme of reverse mathematics, which dominates the first half of the book. The second part focuses on models of these and other subsystems of second-order arithmetic.
Predicate calculus. --- Calculus, Predicate --- Quantification theory --- Logic, Symbolic and mathematical
Choose an application
discrete structures --- Formal methods --- Predicate Calculus --- Software engineering
Choose an application
Mathematical logic --- Predicate calculus. --- 510.6 --- Predicate calculus --- Calculus, Predicate --- Quantification theory --- Logic, Symbolic and mathematical --- 510.6 Mathematical logic
Choose an application
Mathématiques --- Logic, Symbolic and mathematical --- Predicate calculus --- Functor theory --- Mathématiques --- Logic, Symbolic and mathematical --- Predicate calculus --- Functor theory
Choose an application
Predicate Calculus --- Formal System --- Prolog (langage de programmation) --- Artificial intelligence --- Logic
Choose an application
Listing 1 - 10 of 37 | << page >> |
Sort by
|