dc.contributor.author |
Gavryushkin, Alexander |
en |
dc.contributor.editor |
Gabbay, DM |
en |
dc.date.accessioned |
2012-03-29T19:25:17Z |
en |
dc.date.issued |
2010 |
en |
dc.identifier.issn |
0955-792X |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/16061 |
en |
dc.description.abstract |
It is known that the class of Ehrenfeucht theories admits a syntactical characterization and that a finite (Rudin-Keisler) pre- ordering and a function mapping this pre-ordering to naturals play the role of parameters in this characterization. In the article, we construct for any finite linear ordering L, a hereditary decidable Ehrenfeucht theory T possessing L as its Rudin-Keisler pre-ordering. Also, we discuss decidable and computable models of such theories. |
en |
dc.language |
English |
en |
dc.publisher |
Oxford University Press |
en |
dc.relation.ispartofseries |
Journal of Logic Computation |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.subject |
Ehrenfeucht theory |
en |
dc.subject |
Rudin-Keisler order |
en |
dc.subject |
decidable theory |
en |
dc.subject |
decidable model |
en |
dc.subject |
computable model |
en |
dc.title |
On constructive models of theories with linear Rudin-Keisler ordering |
en |
dc.type |
Journal Article |
en |
dc.identifier.doi |
10.1093/logcom/exq043 |
en |
dc.rights.holder |
Copyright: Oxford University Press |
en |
pubs.publication-status |
Published |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/RestrictedAccess |
en |
pubs.subtype |
Article |
en |
pubs.elements-id |
316240 |
en |
pubs.org-id |
Science |
en |
pubs.org-id |
School of Computer Science |
en |
dc.identifier.eissn |
1465-363X |
en |
pubs.record-created-at-source-date |
2012-03-09 |
en |