Symbolic Computation: Computer Algebra and Logic-Reference-Cited by-同舟云学术

Symbolic Computation: Computer Algebra and Logic

Published:1996 Issue: Volume: Page:193-219
ISSN:1386-2790
Container-title:Applied Logic Series
language:
Short-container-title:

Author:

Buchberger Bruno

Publisher

Springer Netherlands

Link

http://link.springer.com/content/pdf/10.1007/978-94-009-0349-4_10

Reference9 articles.

1. P.B. Andrews: An Introduction toMathematical Logic and Type Theory: To Truth Through Proof.Academic Press, London 1986.

2. B. Buchberger: Groebner Bases: An Algorithmic Method in Polynomial Ideal Theory. Chapter 6 in:Multidimensional Systems Theory, (N.K. Bose ed.). D. Reidel Publishing Company, Dordrecht, 1985.

3. B. Buchberger: Induction Proofs in Equational Logic: A Case Study Using Mathematica.Internal Technical Report, The RISC Institute, A4232 Schloss Hagenberg, Austria, 1995.

4. Applied Logic Series;G Collins,1975

5. R. Constable:The Nuprl System.Lecture Notes of the Summer School on Logic of Computation, Marktoberndorf 1995. Edited by Institut für Informatik, Technische Universität München, 1995.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Functional Scheme of Hardware Semafore for Parallel Computing;2022 International Russian Automation Conference (RusAutoCon);2022-09-04

2. Generating invariants for non-linear loops by linear algebraic methods;Formal Aspects of Computing;2015-11

3. Automated Reasoning;Hagenberg Research;2010

4. Generating Invariants for Non-linear Hybrid Systems by Linear Algebraic Methods;Static Analysis;2010

5. Theorema;The Seventeen Provers of the World;2006