|
|
|
|
| LEADER |
02257nmm a2200409 u 4500 |
| 001 |
EB000659369 |
| 003 |
EBX01000000000000000512451 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540685227
|
| 100 |
1 |
|
|a McCune, William
|
| 245 |
0 |
0 |
|a Automated Deduction in Equational Logic and Cubic Curves
|h Elektronische Ressource
|c by William McCune, R. Padmanabhan
|
| 250 |
|
|
|a 1st ed. 1996
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1996, 1996
|
| 300 |
|
|
|a X, 238 p
|b online resource
|
| 505 |
0 |
|
|a Otter and MACE -- Algebras over algebraic curves -- Other (gL)-algebras -- Semigroups -- Lattice-like algebras -- Independent self-dual bases -- Miscellaneous topics
|
| 653 |
|
|
|a Computer graphics
|
| 653 |
|
|
|a Compilers (Computer programs)
|
| 653 |
|
|
|a Compilers and Interpreters
|
| 653 |
|
|
|a Mathematics of Computing
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Mathematical logic
|
| 653 |
|
|
|a Computer Graphics
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Artificial intelligence
|
| 653 |
|
|
|a Mathematical Logic and Foundations
|
| 700 |
1 |
|
|a Padmanabhan, R.
|e [author]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Artificial Intelligence
|
| 028 |
5 |
0 |
|a 10.1007/3-540-61398-6
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-61398-6?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 006.3
|
| 520 |
|
|
|a This monograph is the result of the cooperation of a mathematician working in universal algebra and geometry, and a computer scientist working in automated deduction, who succeeded in employing the theorem prover Otter for proving first order theorems from mathematics and then intensified their joint effort. Mathematicians will find many new results from equational logic, universal algebra, and algebraic geometry and benefit from the state-of-the-art outline of the capabilities of automated deduction techniques. Computer scientists will find a large and varied source of theorems and problems that will be useful in designing and evaluation automated theorem proving systems and strategies
|