Note on the generalization of calculations

DOI10.1016/S0304-3975(98)00304-1MaRDI QIDQ1960415zbMATH OpenFDO

Authors Matthias Baaz

Publication date 12 January 2000

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

Full work available at URL https://doi.org/10.1016/S0304-3975(98)00304-1

zbMATH Keywords

abstract calculationabstractions of calculation stepscalculation treeFermat numberunification

Mathematics Subject Classification ID

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

Cites work

• A Machine-Oriented Logic Based on the Resolution Principle
• An extension to chaos control via Lie derivatives: Fully linearizable systems
• Decision-algorithms for the associativity of latin squares
• scientific article; zbMATH DE number 3477242 (Why is no real title available?)

Cited in

(4)

• Note on the (N, T) Replacement Rule
• Some properties of the factors of Fermat numbers
• A tableaux-based decision procedure for multi-parameter propositional schemata
• Mathematical method and proof

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1960415)