Ordinal arithmetic with list structures (Preliminary version)

Nachum Dershowitz; Edward M. Reingold

doi:10.1007/BFb0023868

Ordinal arithmetic with list structures (Preliminary version)

Nachum Dershowitz, Edward M. Reingold

University of Illinois

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

Abstract

We provide a set of “natural” requirements for well-orderings of (binary) list structures. We show that the resultant order-type is the successor of the first critical epsilon number.

Original language	English
Title of host publication	Logical Foundations of Computer Science — Tver 1992 - 2nd International Symposium, Proceedings
Editors	Anil Nerode, Mikhail Taitslin
Publisher	Springer Verlag
Pages	117-138
Number of pages	22
ISBN (Print)	9783540557074
DOIs	https://doi.org/10.1007/BFb0023868
State	Published - 1992
Externally published	Yes
Event	2nd International Symposia on Logical Foundations of Computer Science, Tver 1992 - Tver, Russian Federation Duration: 20 Jul 1992 → 24 Jul 1992

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	620 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	2nd International Symposia on Logical Foundations of Computer Science, Tver 1992
Country/Territory	Russian Federation
City	Tver
Period	20/07/92 → 24/07/92

Funding

Funders	Funder number
National Science Foundation	CCR-90-07195, CCR-90-24271

Access to Document

10.1007/BFb0023868

Cite this

Dershowitz, N., & Reingold, E. M. (1992). Ordinal arithmetic with list structures (Preliminary version). In A. Nerode, & M. Taitslin (Eds.), Logical Foundations of Computer Science — Tver 1992 - 2nd International Symposium, Proceedings (pp. 117-138). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 620 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0023868

Dershowitz, Nachum ; Reingold, Edward M. / Ordinal arithmetic with list structures (Preliminary version). Logical Foundations of Computer Science — Tver 1992 - 2nd International Symposium, Proceedings. editor / Anil Nerode ; Mikhail Taitslin. Springer Verlag, 1992. pp. 117-138 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{8e054a85b74d4b8abce9fb07347aefff,

title = "Ordinal arithmetic with list structures (Preliminary version)",

abstract = "We provide a set of “natural” requirements for well-orderings of (binary) list structures. We show that the resultant order-type is the successor of the first critical epsilon number.",

author = "Nachum Dershowitz and Reingold, {Edward M.}",

note = "Publisher Copyright: {\textcopyright} 1992, Springer Verlag. All rights reserved.; 2nd International Symposia on Logical Foundations of Computer Science, Tver 1992 ; Conference date: 20-07-1992 Through 24-07-1992",

year = "1992",

doi = "10.1007/BFb0023868",

language = "אנגלית",

isbn = "9783540557074",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "117--138",

editor = "Anil Nerode and Mikhail Taitslin",

booktitle = "Logical Foundations of Computer Science — Tver 1992 - 2nd International Symposium, Proceedings",

address = "גרמניה",

}

Dershowitz, N & Reingold, EM 1992, Ordinal arithmetic with list structures (Preliminary version). in A Nerode & M Taitslin (eds), Logical Foundations of Computer Science — Tver 1992 - 2nd International Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 620 LNCS, Springer Verlag, pp. 117-138, 2nd International Symposia on Logical Foundations of Computer Science, Tver 1992, Tver, Russian Federation, 20/07/92. https://doi.org/10.1007/BFb0023868

Ordinal arithmetic with list structures (Preliminary version). / Dershowitz, Nachum; Reingold, Edward M.
Logical Foundations of Computer Science — Tver 1992 - 2nd International Symposium, Proceedings. ed. / Anil Nerode; Mikhail Taitslin. Springer Verlag, 1992. p. 117-138 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 620 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Ordinal arithmetic with list structures (Preliminary version)

AU - Dershowitz, Nachum

AU - Reingold, Edward M.

PY - 1992

Y1 - 1992

N2 - We provide a set of “natural” requirements for well-orderings of (binary) list structures. We show that the resultant order-type is the successor of the first critical epsilon number.

AB - We provide a set of “natural” requirements for well-orderings of (binary) list structures. We show that the resultant order-type is the successor of the first critical epsilon number.

UR - http://www.scopus.com/inward/record.url?scp=33746786948&partnerID=8YFLogxK

U2 - 10.1007/BFb0023868

DO - 10.1007/BFb0023868

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:33746786948

SN - 9783540557074

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 117

EP - 138

BT - Logical Foundations of Computer Science — Tver 1992 - 2nd International Symposium, Proceedings

A2 - Nerode, Anil

A2 - Taitslin, Mikhail

PB - Springer Verlag

T2 - 2nd International Symposia on Logical Foundations of Computer Science, Tver 1992

Y2 - 20 July 1992 through 24 July 1992

ER -

Dershowitz N, Reingold EM. Ordinal arithmetic with list structures (Preliminary version). In Nerode A, Taitslin M, editors, Logical Foundations of Computer Science — Tver 1992 - 2nd International Symposium, Proceedings. Springer Verlag. 1992. p. 117-138. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/BFb0023868

Ordinal arithmetic with list structures (Preliminary version)

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this