No Cover Image

Journal article 951 views

Continuous Fraïssé Conjecture

Arnold Beckmann Orcid Logo, Martin Goldstern, Norbert Preining

Order, Volume: 25, Issue: 4, Pages: 281 - 298

Swansea University Author: Arnold Beckmann Orcid Logo

Full text not available from this repository: check for access using links below.

Check full text

DOI (Published version): 10.1007/s11083-008-9094-4

Abstract

We investigate the relation of countable closed linear orderings with respect to continuous monotone embeddability and show that there are exactly ℵ_1 many equivalence classes with respect to this embeddability relation. This is an extension of Laver's result, who considered (plain) embeddabili...

Full description

Published in: Order
ISSN: 0167-8094 1572-9273
Published: 2008
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa134
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2013-07-23T11:47:00Z
last_indexed 2018-02-09T04:26:58Z
id cronfa134
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2013-10-17T11:45:31.9202319</datestamp><bib-version>v2</bib-version><id>134</id><entry>2012-02-23</entry><title>Continuous Fra&#xEF;ss&#xE9; Conjecture</title><swanseaauthors><author><sid>1439ebd690110a50a797b7ec78cca600</sid><ORCID>0000-0001-7958-5790</ORCID><firstname>Arnold</firstname><surname>Beckmann</surname><name>Arnold Beckmann</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2012-02-23</date><deptcode>SCS</deptcode><abstract>We investigate the relation of countable closed linear orderings with respect to continuous monotone embeddability and show that there are exactly &#x2135;_1 many equivalence classes with respect to this embeddability relation. This is an extension of Laver's result, who considered (plain) embeddability, which yields coarser equivalence classes. Using this result we show that there are only &#x2135;_0 many different G&#xF6;del logics.</abstract><type>Journal Article</type><journal>Order</journal><volume>25</volume><journalNumber>4</journalNumber><paginationStart>281</paginationStart><paginationEnd>298</paginationEnd><publisher/><placeOfPublication/><issnPrint>0167-8094</issnPrint><issnElectronic>1572-9273</issnElectronic><keywords/><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2008</publishedYear><publishedDate>2008-12-31</publishedDate><doi>10.1007/s11083-008-9094-4</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2013-10-17T11:45:31.9202319</lastEdited><Created>2012-02-23T17:02:01.0000000</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Arnold</firstname><surname>Beckmann</surname><orcid>0000-0001-7958-5790</orcid><order>1</order></author><author><firstname>Martin</firstname><surname>Goldstern</surname><order>2</order></author><author><firstname>Norbert</firstname><surname>Preining</surname><order>3</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2013-10-17T11:45:31.9202319 v2 134 2012-02-23 Continuous Fraïssé Conjecture 1439ebd690110a50a797b7ec78cca600 0000-0001-7958-5790 Arnold Beckmann Arnold Beckmann true false 2012-02-23 SCS We investigate the relation of countable closed linear orderings with respect to continuous monotone embeddability and show that there are exactly ℵ_1 many equivalence classes with respect to this embeddability relation. This is an extension of Laver's result, who considered (plain) embeddability, which yields coarser equivalence classes. Using this result we show that there are only ℵ_0 many different Gödel logics. Journal Article Order 25 4 281 298 0167-8094 1572-9273 31 12 2008 2008-12-31 10.1007/s11083-008-9094-4 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2013-10-17T11:45:31.9202319 2012-02-23T17:02:01.0000000 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Arnold Beckmann 0000-0001-7958-5790 1 Martin Goldstern 2 Norbert Preining 3
title Continuous Fraïssé Conjecture
spellingShingle Continuous Fraïssé Conjecture
Arnold Beckmann
title_short Continuous Fraïssé Conjecture
title_full Continuous Fraïssé Conjecture
title_fullStr Continuous Fraïssé Conjecture
title_full_unstemmed Continuous Fraïssé Conjecture
title_sort Continuous Fraïssé Conjecture
author_id_str_mv 1439ebd690110a50a797b7ec78cca600
author_id_fullname_str_mv 1439ebd690110a50a797b7ec78cca600_***_Arnold Beckmann
author Arnold Beckmann
author2 Arnold Beckmann
Martin Goldstern
Norbert Preining
format Journal article
container_title Order
container_volume 25
container_issue 4
container_start_page 281
publishDate 2008
institution Swansea University
issn 0167-8094
1572-9273
doi_str_mv 10.1007/s11083-008-9094-4
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 0
active_str 0
description We investigate the relation of countable closed linear orderings with respect to continuous monotone embeddability and show that there are exactly ℵ_1 many equivalence classes with respect to this embeddability relation. This is an extension of Laver's result, who considered (plain) embeddability, which yields coarser equivalence classes. Using this result we show that there are only ℵ_0 many different Gödel logics.
published_date 2008-12-31T03:02:54Z
_version_ 1763749474723692544
score 11.016235

Similar Items