Article View: sci.logic
Article #176Axioms for *Skolem* arithmetic
From: Zach R
Date: Thu, 27 Aug 1992 16:23
Date: Thu, 27 Aug 1992 16:23
14 lines
961 bytes
961 bytes
Jamie Andrew's recent request for axioms for Presburger arithmetic started me thinking: What about (natural) axiomatizations of Skolem arithmetic, ie arithmetic with only 0, 1, and multiplication. (Note there is no successor). This theory is decidable as well, but what axioms would you give for times, if you cant define it recursively from plus? If noone has an answer, maybe someone knows the email address of C Ward Henson (currently in Tuebingen, as far as I know), I think he worked on that back in the 70s. (BTW: Pre"sburg (Bratislava) is spelled with a sharp s) Richard Zach
Technical Details
Message-ID:
<5226@sersun1.essex.ac.uk>Path:
arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!sersun1!solb1!zachrShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!sersun1!solb1!zachr From: zachr@solb1.essex.ac.uk (Zach R) Newsgroups: sci.logic Subject: Axioms for *Skolem* arithmetic Message-ID: <5226@sersun1.essex.ac.uk> Date: 27 Aug 92 16:23:48 GMT Sender: news@sersun1.essex.ac.uk Reply-To: zach@csdec1.tuwien.ac.at Organization: University of Essex, Colchester, UK Lines: 14