Conference Paper/Proceeding/Abstract 1192 views
An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma
Lecture Notes In Computer Science, Volume: 2277, Pages: 233 - 242
Swansea University Author: Monika Seisenberger
Full text not available from this repository: check for access using links below.
DOI (Published version): 10.1007/3-540-45842-5_15
Abstract
An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma
Published in: | Lecture Notes In Computer Science |
---|---|
Published: |
Springer
2001
|
URI: | https://cronfa.swan.ac.uk/Record/cronfa14505 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
first_indexed |
2013-07-23T12:12:21Z |
---|---|
last_indexed |
2018-02-09T04:45:55Z |
id |
cronfa14505 |
recordtype |
SURis |
fullrecord |
<?xml version="1.0"?><rfc1807><datestamp>2013-12-04T22:58:53.2576499</datestamp><bib-version>v2</bib-version><id>14505</id><entry>2013-04-01</entry><title>An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma</title><swanseaauthors><author><sid>d035399b2b324a63fe472ce0344653e0</sid><ORCID>0000-0002-2226-386X</ORCID><firstname>Monika</firstname><surname>Seisenberger</surname><name>Monika Seisenberger</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2013-04-01</date><deptcode>SCS</deptcode><abstract></abstract><type>Conference Paper/Proceeding/Abstract</type><journal>Lecture Notes In Computer Science</journal><volume>2277</volume><paginationStart>233</paginationStart><paginationEnd>242</paginationEnd><publisher>Springer</publisher><issnPrint/><issnElectronic/><keywords/><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2001</publishedYear><publishedDate>2001-12-31</publishedDate><doi>10.1007/3-540-45842-5_15</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-12-04T22:58:53.2576499</lastEdited><Created>2013-04-01T09:21:01.1036628</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>Monika</firstname><surname>Seisenberger</surname><orcid>0000-0002-2226-386X</orcid><order>1</order></author></authors><documents/><OutputDurs/></rfc1807> |
spelling |
2013-12-04T22:58:53.2576499 v2 14505 2013-04-01 An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma d035399b2b324a63fe472ce0344653e0 0000-0002-2226-386X Monika Seisenberger Monika Seisenberger true false 2013-04-01 SCS Conference Paper/Proceeding/Abstract Lecture Notes In Computer Science 2277 233 242 Springer 31 12 2001 2001-12-31 10.1007/3-540-45842-5_15 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2013-12-04T22:58:53.2576499 2013-04-01T09:21:01.1036628 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Monika Seisenberger 0000-0002-2226-386X 1 |
title |
An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma |
spellingShingle |
An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma Monika Seisenberger |
title_short |
An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma |
title_full |
An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma |
title_fullStr |
An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma |
title_full_unstemmed |
An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma |
title_sort |
An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma |
author_id_str_mv |
d035399b2b324a63fe472ce0344653e0 |
author_id_fullname_str_mv |
d035399b2b324a63fe472ce0344653e0_***_Monika Seisenberger |
author |
Monika Seisenberger |
author2 |
Monika Seisenberger |
format |
Conference Paper/Proceeding/Abstract |
container_title |
Lecture Notes In Computer Science |
container_volume |
2277 |
container_start_page |
233 |
publishDate |
2001 |
institution |
Swansea University |
doi_str_mv |
10.1007/3-540-45842-5_15 |
publisher |
Springer |
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 |
published_date |
2001-12-31T03:16:36Z |
_version_ |
1763750336484343808 |
score |
11.037581 |