No Cover Image

Journal article 1055 views

Dynamic ordinal analysis

Arnold Beckmann Orcid Logo

Archive for Mathematical Logic, Volume: 42, Issue: 4, Pages: 303 - 334

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/s00153-002-0169-4

Abstract

Dynamic ordinal analysis is ordinal analysis for weak arithmetics like fragments of bounded arithmetic. In this paper we will define dynamic ordinals - they will be sets of number theoretic functions measuring the amount of Π b 1 (α) order induction available in a theory. We will compare order induc...

Full description

Published in: Archive for Mathematical Logic
ISSN: 0933-5846 1432-0665
Published: Springer 2002
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa1701
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2013-07-23T11:48:08Z
last_indexed 2018-02-09T04:29:12Z
id cronfa1701
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2013-10-17T11:45:51.6797797</datestamp><bib-version>v2</bib-version><id>1701</id><entry>2011-10-01</entry><title>Dynamic ordinal analysis</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>2011-10-01</date><deptcode>SCS</deptcode><abstract>Dynamic ordinal analysis is ordinal analysis for weak arithmetics like fragments of bounded arithmetic. In this paper we will define dynamic ordinals - they will be sets of number theoretic functions measuring the amount of &#x3A0; b 1 (&#x3B1;) order induction available in a theory. We will compare order induction to successor induction over weak theories. We will compute dynamic ordinals of the bounded arithmetic theories &#x3A3; b n (&#x3B1;)-LmIND for m=n and m=n+1, n&#x2265;0 . Different dynamic ordinals lead to separation. Therefore, we will obtain several separation results between these relativized theories. We will generalize our results to arbitrary languages extending the language of Peano arithmetic.</abstract><type>Journal Article</type><journal>Archive for Mathematical Logic</journal><volume>42</volume><journalNumber>4</journalNumber><paginationStart>303</paginationStart><paginationEnd>334</paginationEnd><publisher>Springer</publisher><placeOfPublication/><issnPrint>0933-5846</issnPrint><issnElectronic>1432-0665</issnElectronic><keywords/><publishedDay>19</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2002</publishedYear><publishedDate>2002-12-19</publishedDate><doi>10.1007/s00153-002-0169-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:51.6797797</lastEdited><Created>2011-10-01T00:00:00.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></authors><documents/><OutputDurs/></rfc1807>
spelling 2013-10-17T11:45:51.6797797 v2 1701 2011-10-01 Dynamic ordinal analysis 1439ebd690110a50a797b7ec78cca600 0000-0001-7958-5790 Arnold Beckmann Arnold Beckmann true false 2011-10-01 SCS Dynamic ordinal analysis is ordinal analysis for weak arithmetics like fragments of bounded arithmetic. In this paper we will define dynamic ordinals - they will be sets of number theoretic functions measuring the amount of Π b 1 (α) order induction available in a theory. We will compare order induction to successor induction over weak theories. We will compute dynamic ordinals of the bounded arithmetic theories Σ b n (α)-LmIND for m=n and m=n+1, n≥0 . Different dynamic ordinals lead to separation. Therefore, we will obtain several separation results between these relativized theories. We will generalize our results to arbitrary languages extending the language of Peano arithmetic. Journal Article Archive for Mathematical Logic 42 4 303 334 Springer 0933-5846 1432-0665 19 12 2002 2002-12-19 10.1007/s00153-002-0169-4 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2013-10-17T11:45:51.6797797 2011-10-01T00:00:00.0000000 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Arnold Beckmann 0000-0001-7958-5790 1
title Dynamic ordinal analysis
spellingShingle Dynamic ordinal analysis
Arnold Beckmann
title_short Dynamic ordinal analysis
title_full Dynamic ordinal analysis
title_fullStr Dynamic ordinal analysis
title_full_unstemmed Dynamic ordinal analysis
title_sort Dynamic ordinal analysis
author_id_str_mv 1439ebd690110a50a797b7ec78cca600
author_id_fullname_str_mv 1439ebd690110a50a797b7ec78cca600_***_Arnold Beckmann
author Arnold Beckmann
author2 Arnold Beckmann
format Journal article
container_title Archive for Mathematical Logic
container_volume 42
container_issue 4
container_start_page 303
publishDate 2002
institution Swansea University
issn 0933-5846
1432-0665
doi_str_mv 10.1007/s00153-002-0169-4
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
description Dynamic ordinal analysis is ordinal analysis for weak arithmetics like fragments of bounded arithmetic. In this paper we will define dynamic ordinals - they will be sets of number theoretic functions measuring the amount of Π b 1 (α) order induction available in a theory. We will compare order induction to successor induction over weak theories. We will compute dynamic ordinals of the bounded arithmetic theories Σ b n (α)-LmIND for m=n and m=n+1, n≥0 . Different dynamic ordinals lead to separation. Therefore, we will obtain several separation results between these relativized theories. We will generalize our results to arbitrary languages extending the language of Peano arithmetic.
published_date 2002-12-19T03:04:30Z
_version_ 1763749575642841088
score 11.014291

Similar Items