Note on the generalization of calculations

DOI10.1016/S0304-3975(98)00304-1zbMath0930.03008MaRDI QIDQ1960415

Matthias Baaz

Publication date: 12 January 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

unificationFermat numberabstract calculationabstractions of calculation stepscalculation tree

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Mechanization of proofs and logical operations (03B35) Factorization; primality (11A51) Basic properties of first-order languages and structures (03C07) Primality (11Y11) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (3)

Some properties of the factors of Fermat numbers ⋮ Mathematical method and proof ⋮ A Tableaux-Based Decision Procedure for Multi-parameter Propositional Schemata

Cites Work

• Unnamed Item
• Decision-algorithms for the associativity of latin squares
• A Machine-Oriented Logic Based on the Resolution Principle
• An extension to chaos control via Lie derivatives: Fully linearizable systems

This page was built for publication: Note on the generalization of calculations