𝔖 Bobbio Scriptorium
✦   LIBER   ✦

PROLOG: Arithmetic relations

✍ Scribed by G. Musch; A. Thielemans; D.L. Massart

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
185 KB
Volume
5
Category
Article
ISSN
0165-9936

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Complete, Recursively Enumerable Relatio
Complete, Recursively Enumerable Relations in Arithmetic
✍ Giovanna D'Agostino; Mario Magnago πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 489 KB

## Abstract Using only propositional connectives and the provability predicate of a Ξ£~1~‐sound theory __T__ containing Peano Arithmetic we define recursively enumerable relations that are complete for specific natural classes of relations, as the class of all r. e. relations, and the class of all s

cover
Prolog
✍ Christel Wiinblad πŸ“‚ Fiction πŸ“… 2011 πŸ› Gyldendal, [SΓ¦lges pΓ₯ internettet] 🌐 Danish βš– 56 KB πŸ‘ 1 views
Prolog
Prolog
✍ Hannes FlΓΌhler; Walter Giger; Albert Waldvogel πŸ“‚ Article πŸ“… 1993 πŸ› Springer Netherlands 🌐 English βš– 88 KB

The contributions in this special issue emerged from the WaBoLu-Project which was initiated in 1985 by Wemer Stumm at the Swiss Federal Institute of Technology in Ztirich (ETHZ). The project label "WaBoLu" is an acronym for "water, soil and air", a label we share by coincidence with this journal. It

Arithmetical Semigroups Related to Trees
Arithmetical Semigroups Related to Trees and Polyhedra
✍ A. Knopfmacher; J. Knopfmacher πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 152 KB

With emphasis on some natural asymptotic enumeration questions, a study is made of various arithmetical semigroups associated with isomorphism classes of finite graphs, trees and polyhedra. A suitable ``abstract prime number theorem'' is derived, particularly as an aid to solving the counting questi