Все публикации

0:16:16

Math 557 – Defining Computable Functions in Arithmetic

0:13:02

Math 557 – Arithmetic Formulas

0:13:54

Math 557 – Peano Arithmetic

0:11:19

Math 557 – Deciding Theories

0:12:25

Math 557 – Coding Formulas

0:10:10

Math 557 – Recursive Functions

0:07:17

Math 557 – The Ackermann function

0:14:39

Math 557 – Primitive recursive functions

0:21:04

Math 557 – Unsolvable Problems

0:20:48

Math 557 – Enumerating Turing Machines

0:19:50

Math 557 – Turing Machines

0:24:31

Math 557 – Quantifier Elimination for Algebraically Closed Fields

0:27:32

Math 557 – Quantifier Elimination

0:14:44

Math 557 – Elementary Substructures

0:07:52

Math 557 – The Löwenheim-Skolem Theorems

0:10:05

Math 557 - Elementary Equivalence

0:14:16

Math 557 — Proving the Model Existence Theorem

0:17:17

Math 557 – Henkin Theories

0:07:15

Math 557 – Completing Theories

0:14:24

Math 557 – The Completeness Theorem

0:17:16

Math 557 – Validities

0:17:45

Math 557 – Consistency and Completeness

0:18:17

Math 557 – Substitution

0:22:09

Math 557 – Logical Implication and Proof