Classification theory and 0
We characterize the classifiability of a countable first-order theory T in terms of the solvability (in the sense of [2]) of the potential-isomorphism problem for models of T.
Gespeichert in:
| Veröffentlicht in: | The Journal of symbolic logic 2003-06, Vol.68 (2), p.580-588 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 588 |
|---|---|
| container_issue | 2 |
| container_start_page | 580 |
| container_title | The Journal of symbolic logic |
| container_volume | 68 |
| creator | Friedman, Sy D. Hyttinen, Tapani Rautila, Mika |
| description | We characterize the classifiability of a countable first-order theory T in terms of the solvability (in the sense of [2]) of the potential-isomorphism problem for models of T. |
| doi_str_mv | 10.2178/jsl/1052669064 |
| format | Article |
| fullrecord | <record><control><sourceid>jstor_proje</sourceid><recordid>TN_cdi_projecteuclid_primary_oai_CULeuclid_euclid_jsl_1052669064</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>4147697</jstor_id><sourcerecordid>4147697</sourcerecordid><originalsourceid>FETCH-LOGICAL-c308t-6f4930795c78d9f7e737d8d8dc3accf578ff6913d727d220b9417d2f3686d7243</originalsourceid><addsrcrecordid>eNplUE1LAzEUDKJgrV696KF_YNuXj83HTd1qFSoiWPAWYjbBrGu3JCvYf29kSz3IO8xj5s3APITOMUwJFnLWpHaGoSScK-DsAI2wYrQopeSHaARASMEkJsfoJKUGAErF5AhdVK1JKfhgTR-69aR_d13cTsy6nsApOvKmTe5sh2O0urt9qe6L5dPiobpeFpaC7AvumaIgVGmFrJUXTlBRyzyWGmt9KaT3XGFaCyJqQuBNMZwXT7nkmWN0jK6G3E3sGmd792XbUOtNDJ8mbnVngq5Wyx27g1xW_5XNEdMhwsYupej83o1B_37nv-FyMDSp7-L-mmEmuBJZLgY5pN5972UTPzTP9UrNF8-aVGT--ngjNaM_uwNvKg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Classification theory and 0</title><source>JSTOR Mathematics & Statistics</source><source>JSTOR Archive Collection A-Z Listing</source><creator>Friedman, Sy D. ; Hyttinen, Tapani ; Rautila, Mika</creator><creatorcontrib>Friedman, Sy D. ; Hyttinen, Tapani ; Rautila, Mika</creatorcontrib><description>We characterize the classifiability of a countable first-order theory T in terms of the solvability (in the sense of [2]) of the potential-isomorphism problem for models of T.</description><identifier>ISSN: 0022-4812</identifier><identifier>EISSN: 1943-5886</identifier><identifier>DOI: 10.2178/jsl/1052669064</identifier><language>eng</language><publisher>New York, USA: Cambridge University Press</publisher><subject>Automorphisms ; Classification theory ; First order theories ; Logical theorems ; Mathematical functions ; Mathematical logic ; Mathematical theorems ; Model theory ; Solvability</subject><ispartof>The Journal of symbolic logic, 2003-06, Vol.68 (2), p.580-588</ispartof><rights>Copyright 2003 Association for Symbolic Logic</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c308t-6f4930795c78d9f7e737d8d8dc3accf578ff6913d727d220b9417d2f3686d7243</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/4147697$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://www.jstor.org/stable/4147697$$EHTML$$P50$$Gjstor$$H</linktohtml><link.rule.ids>230,314,780,784,803,832,885,27924,27925,58017,58021,58250,58254</link.rule.ids></links><search><creatorcontrib>Friedman, Sy D.</creatorcontrib><creatorcontrib>Hyttinen, Tapani</creatorcontrib><creatorcontrib>Rautila, Mika</creatorcontrib><title>Classification theory and 0</title><title>The Journal of symbolic logic</title><description>We characterize the classifiability of a countable first-order theory T in terms of the solvability (in the sense of [2]) of the potential-isomorphism problem for models of T.</description><subject>Automorphisms</subject><subject>Classification theory</subject><subject>First order theories</subject><subject>Logical theorems</subject><subject>Mathematical functions</subject><subject>Mathematical logic</subject><subject>Mathematical theorems</subject><subject>Model theory</subject><subject>Solvability</subject><issn>0022-4812</issn><issn>1943-5886</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><recordid>eNplUE1LAzEUDKJgrV696KF_YNuXj83HTd1qFSoiWPAWYjbBrGu3JCvYf29kSz3IO8xj5s3APITOMUwJFnLWpHaGoSScK-DsAI2wYrQopeSHaARASMEkJsfoJKUGAErF5AhdVK1JKfhgTR-69aR_d13cTsy6nsApOvKmTe5sh2O0urt9qe6L5dPiobpeFpaC7AvumaIgVGmFrJUXTlBRyzyWGmt9KaT3XGFaCyJqQuBNMZwXT7nkmWN0jK6G3E3sGmd792XbUOtNDJ8mbnVngq5Wyx27g1xW_5XNEdMhwsYupej83o1B_37nv-FyMDSp7-L-mmEmuBJZLgY5pN5972UTPzTP9UrNF8-aVGT--ngjNaM_uwNvKg</recordid><startdate>20030601</startdate><enddate>20030601</enddate><creator>Friedman, Sy D.</creator><creator>Hyttinen, Tapani</creator><creator>Rautila, Mika</creator><general>Cambridge University Press</general><general>The Association for Symbolic Logic, Inc</general><general>Association for Symbolic Logic</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20030601</creationdate><title>Classification theory and 0</title><author>Friedman, Sy D. ; Hyttinen, Tapani ; Rautila, Mika</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c308t-6f4930795c78d9f7e737d8d8dc3accf578ff6913d727d220b9417d2f3686d7243</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Automorphisms</topic><topic>Classification theory</topic><topic>First order theories</topic><topic>Logical theorems</topic><topic>Mathematical functions</topic><topic>Mathematical logic</topic><topic>Mathematical theorems</topic><topic>Model theory</topic><topic>Solvability</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Friedman, Sy D.</creatorcontrib><creatorcontrib>Hyttinen, Tapani</creatorcontrib><creatorcontrib>Rautila, Mika</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><jtitle>The Journal of symbolic logic</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Friedman, Sy D.</au><au>Hyttinen, Tapani</au><au>Rautila, Mika</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Classification theory and 0</atitle><jtitle>The Journal of symbolic logic</jtitle><date>2003-06-01</date><risdate>2003</risdate><volume>68</volume><issue>2</issue><spage>580</spage><epage>588</epage><pages>580-588</pages><issn>0022-4812</issn><eissn>1943-5886</eissn><abstract>We characterize the classifiability of a countable first-order theory T in terms of the solvability (in the sense of [2]) of the potential-isomorphism problem for models of T.</abstract><cop>New York, USA</cop><pub>Cambridge University Press</pub><doi>10.2178/jsl/1052669064</doi><tpages>9</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0022-4812 |
| ispartof | The Journal of symbolic logic, 2003-06, Vol.68 (2), p.580-588 |
| issn | 0022-4812 1943-5886 |
| language | eng |
| recordid | cdi_projecteuclid_primary_oai_CULeuclid_euclid_jsl_1052669064 |
| source | JSTOR Mathematics & Statistics; JSTOR Archive Collection A-Z Listing |
| subjects | Automorphisms Classification theory First order theories Logical theorems Mathematical functions Mathematical logic Mathematical theorems Model theory Solvability |
| title | Classification theory and 0 |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T09%3A34%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_proje&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Classification%20theory%20and%200&rft.jtitle=The%20Journal%20of%20symbolic%20logic&rft.au=Friedman,%20Sy%20D.&rft.date=2003-06-01&rft.volume=68&rft.issue=2&rft.spage=580&rft.epage=588&rft.pages=580-588&rft.issn=0022-4812&rft.eissn=1943-5886&rft_id=info:doi/10.2178/jsl/1052669064&rft_dat=%3Cjstor_proje%3E4147697%3C/jstor_proje%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_jstor_id=4147697&rfr_iscdi=true |