Complexity of Ehrenfeucht models

dc.contributor.author	Gavryushkin, Alexander	en
dc.contributor.editor	Ershov, Yu L	en
dc.date.accessioned	2012-03-29T19:25:24Z	en
dc.date.issued	2006	en
dc.identifier.issn	0002-5232	en
dc.identifier.uri	http://hdl.handle.net/2292/16063	en
dc.description.abstract	We look at examples of Ehrenfeucht theories possessing constructive models and countable models of different complexities, and estimate complexity of the Ehrenfeucht theories having constructive models.	en
dc.language	English	en
dc.publisher	Springer New York	en
dc.relation.ispartofseries	Algebra and Logic	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	constructive model	en
dc.title	Complexity of Ehrenfeucht models	en
dc.type	Journal Article	en
dc.identifier.doi	10.1007/s10469-006-0027-2	en
pubs.issue	5	en
pubs.begin-page	289	en
pubs.volume	45	en
dc.rights.holder	Copyright: Springer New York	en
pubs.end-page	295	en
pubs.publication-status	Published	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/RestrictedAccess	en
pubs.subtype	Article	en
pubs.elements-id	316230	en
pubs.org-id	Science	en
pubs.org-id	School of Computer Science	en
dc.identifier.eissn	1573-8302	en
pubs.record-created-at-source-date	2012-03-09	en

Files in this item

There are no files associated with this item.