Journal article 1108 views
Programs from proofs using classical dependent choice
Annals of Pure and Applied Logic, Volume: 153, Issue: 1-3, Pages: 97 - 110
Swansea University Author: Monika Seisenberger
Full text not available from this repository: check for access using links below.
DOI (Published version): 10.1016/j.apal.2008.01.004
Abstract
Programs from proofs using classical dependent choice
Published in: | Annals of Pure and Applied Logic |
---|---|
ISSN: | 0168-0072 |
Published: |
2008
|
Online Access: |
Check full text
|
URI: | https://cronfa.swan.ac.uk/Record/cronfa168 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
first_indexed |
2013-07-23T11:48:04Z |
---|---|
last_indexed |
2018-02-09T04:27:02Z |
id |
cronfa168 |
recordtype |
SURis |
fullrecord |
<?xml version="1.0"?><rfc1807><datestamp>2015-07-06T00:01:23.6340283</datestamp><bib-version>v2</bib-version><id>168</id><entry>2012-02-23</entry><title>Programs from proofs using classical dependent choice</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>2012-02-23</date><deptcode>SCS</deptcode><abstract></abstract><type>Journal Article</type><journal>Annals of Pure and Applied Logic</journal><volume>153</volume><journalNumber>1-3</journalNumber><paginationStart>97</paginationStart><paginationEnd>110</paginationEnd><publisher/><issnPrint>0168-0072</issnPrint><issnElectronic/><keywords>Computational content of classical proofs; A-translation; Minlog; Classical dependent choice; infinite tape example</keywords><publishedDay>28</publishedDay><publishedMonth>2</publishedMonth><publishedYear>2008</publishedYear><publishedDate>2008-02-28</publishedDate><doi>10.1016/j.apal.2008.01.004</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2015-07-06T00:01:23.6340283</lastEdited><Created>2012-02-23T17:01:58.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>Monika</firstname><surname>Seisenberger</surname><orcid>0000-0002-2226-386X</orcid><order>1</order></author></authors><documents/><OutputDurs/></rfc1807> |
spelling |
2015-07-06T00:01:23.6340283 v2 168 2012-02-23 Programs from proofs using classical dependent choice d035399b2b324a63fe472ce0344653e0 0000-0002-2226-386X Monika Seisenberger Monika Seisenberger true false 2012-02-23 SCS Journal Article Annals of Pure and Applied Logic 153 1-3 97 110 0168-0072 Computational content of classical proofs; A-translation; Minlog; Classical dependent choice; infinite tape example 28 2 2008 2008-02-28 10.1016/j.apal.2008.01.004 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2015-07-06T00:01:23.6340283 2012-02-23T17:01:58.0000000 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Monika Seisenberger 0000-0002-2226-386X 1 |
title |
Programs from proofs using classical dependent choice |
spellingShingle |
Programs from proofs using classical dependent choice Monika Seisenberger |
title_short |
Programs from proofs using classical dependent choice |
title_full |
Programs from proofs using classical dependent choice |
title_fullStr |
Programs from proofs using classical dependent choice |
title_full_unstemmed |
Programs from proofs using classical dependent choice |
title_sort |
Programs from proofs using classical dependent choice |
author_id_str_mv |
d035399b2b324a63fe472ce0344653e0 |
author_id_fullname_str_mv |
d035399b2b324a63fe472ce0344653e0_***_Monika Seisenberger |
author |
Monika Seisenberger |
author2 |
Monika Seisenberger |
format |
Journal article |
container_title |
Annals of Pure and Applied Logic |
container_volume |
153 |
container_issue |
1-3 |
container_start_page |
97 |
publishDate |
2008 |
institution |
Swansea University |
issn |
0168-0072 |
doi_str_mv |
10.1016/j.apal.2008.01.004 |
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 |
2008-02-28T03:02:56Z |
_version_ |
1763749477182603264 |
score |
11.037581 |