A computable Alef0-categorical structure whose theory computes true arithmetic
Login
University Home
→
Library
JavaScript is disabled for your browser. Some features of this site may not work without it.
A computable Alef0-categorical structure whose theory computes true arithmetic
Khoussainov, Bakhadyr
;
Montalban, A
Identifier:
http://hdl.handle.net/2292/17077
Issue Date:
2010
Reference:
Journal of Symbolic Logic 75(2):728-740 2010
Rights:
Copyright: Association for Symbolic Logic
Rights (URI):
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm
Abstract:
We construct a computable ℵ0-categorical structure whose first order theory is computably equivalent to the true first order theory of arithmetic.
Show full item record
Files in this item
Name:
1268917501.pdf
Size:
151.6Kb
Format:
PDF
DOI:
10.2178/jsl/1268917501
This item appears in the following Collection(s)
Journal Articles
[23290]
Share
Search ResearchSpace
Search ResearchSpace
This Collection
Browse
All of ResearchSpace
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
Statistics
View Usage Statistics