 | | | Algorithmic structural
completeness
and a retrieval system
for proving theorems
in algorithmic theories
[ Algorytmiczna strukturalna zupełność
i system wyszukiwania dowodów twierdzeń
w teoriach algorytmicznych ]
Autor : Andrzej Biela
wyd. 2000 r. , str. 122 , nakład 220 + 50 egz.
UWAGA : pracę wydano w jęz. angielskim !
[SPIS TREŚCI]
Contents
Chapter 1 Introduction
PART I
Chapter 2 Basic definitions
2.1 The language of AL
2.2 Realization of an algorithmic language
2.3 A deductive system of AL
Chapter 3 The substitution rule
3.1 The notion of (e, g)-function and Keg program
3.2 Program-substitution
3.3 Basic properties of program-substitution
3.4 Program-substitution in AL with generalized terms
3.5 Program-substitution in the language L" and L
Chapter 4 Algorithmic structural completeness
4.1 The problem of completeness of CR
4.2 The algorithmic structural completeness of CR
PART II
Chapter 5 Automated theorem proving
5.1 Axioms and Gentzen's rules of inference
5.2 Functions and procedures defined by programs
5.3 Diagram of a formula
5.4 Retrieval algorithm for functional equations and relations
5.5 The data structures and implementation of a retrieval system
5.6 Results of experiments
Chapter 6 Theorem proving by decomposition
6.1 Axiomatization and decomposition
6.2 Decomposing proving system
6.3 M-diagram
6.4 Algorithm for proving theorems
6.5 Examples
Chapter 7 Summary and concluding remarks
7.1 Conclusion
References
Streszczenie
Peзюме
Stan bardzo dobry
Nie wysyłam za pobraniem !
|
| |
| | |
