Sciweavers

8 search results - page 2 / 2
» A Finitary Model of Peano Arithmetic
Sort
View
APAL
2005
67views more  APAL 2005»
13 years 4 months ago
The minimal e-degree problem in fragments of Peano arithmetic
We study the minimal enumeration degree (e-degree) problem in models of fragments of Peano arithmetic (PA) and prove the following results: In any model M of 2 induction, there is ...
Marat M. Arslanov, Chi Tat Chong, S. Barry Cooper,...
JSYML
2007
58views more  JSYML 2007»
13 years 4 months ago
Bounding homogeneous models
A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model A, i.e., the elementary diagram De (A) has degree d. It follo...
Barbara F. Csima, Valentina S. Harizanov, Denis R....
FUN
2007
Springer
98views Algorithms» more  FUN 2007»
13 years 11 months ago
Die Another Day
The Hydra was a many-headed monster from Greek mythology that would immediately replace a head that was cut off by one or two new heads. It was the ask of Hercules to kill this mon...
Rudolf Fleischer