Lexicographic exponentiation of chains

Holland, Charles W.; Kuhlmann, Salma; McCleary, Stephen

Lexicographic exponentiation of chains

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2005

Autor:innen

Holland, Charles W.

Kuhlmann, Salma

McCleary, Stephen

Publikationstyp

Zeitschriftenartikel

unikn.publication.listelement.citation.prefix.version.undefined

The Journal of Symbolic Logic. 2005, 70(02), pp. 389-409. ISSN 0022-4812. Available under: doi: 10.2178/jsl/1120224719

Zusammenfassung

The lexicographic power Δ Γ of chains Δ and Γ is, roughly, the Cartesian power ∏γ ∈ ΓΔ, totally ordered lexicographically from the left. Here the focus is on certain powers in which either Δ = ℝ or Γ = ℝ, with emphasis on when two such powers are isomorphic and on when Δ Γ is 2-homogeneous. The main results are:

(1) For a countably infinite ordinal α, ℝα * +α≃ℝ α.

(2) ℝ ℝ≂ℝ ℚ.

(3) For Δ a countable ordinal ≥ 2, Δ ℝ, with its smallest element deleted, is 2-homogeneous.

Fachgebiet (DDC)

510 Mathematik

Zitieren

ISO 690

HOLLAND, Charles W., Salma KUHLMANN, Stephen MCCLEARY, 2005. Lexicographic exponentiation of chains. In: The Journal of Symbolic Logic. 2005, 70(02), pp. 389-409. ISSN 0022-4812. Available under: doi: 10.2178/jsl/1120224719

BibTex

@article{Holland2005Lexic-16742,
  year={2005},
  doi={10.2178/jsl/1120224719},
  title={Lexicographic exponentiation of chains},
  number={02},
  volume={70},
  issn={0022-4812},
  journal={The Journal of Symbolic Logic},
  pages={389--409},
  author={Holland, Charles W. and Kuhlmann, Salma and McCleary, Stephen}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/16742">
    <dcterms:abstract xml:lang="eng">The lexicographic power Δ Γ of chains Δ and Γ is, roughly, the Cartesian power ∏γ ∈ ΓΔ, totally ordered lexicographically from the left. Here the focus is on certain powers in which either Δ = ℝ or Γ = ℝ, with emphasis on when two such powers are isomorphic and on when Δ Γ is 2-homogeneous. The main results are:&lt;br /&gt;&lt;br /&gt;(1) For a countably infinite ordinal α, ℝα * +α≃ℝ α.&lt;br /&gt;&lt;br /&gt;(2) ℝ ℝ≂ℝ ℚ.&lt;br /&gt;&lt;br /&gt;(3) For Δ a countable ordinal ≥ 2, Δ ℝ, with its smallest element deleted, is 2-homogeneous.</dcterms:abstract>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-11-16T10:03:47Z</dc:date>
    <dc:contributor>Kuhlmann, Salma</dc:contributor>
    <dc:creator>Holland, Charles W.</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-11-16T10:03:47Z</dcterms:available>
    <dcterms:title>Lexicographic exponentiation of chains</dcterms:title>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/16742"/>
    <dc:contributor>McCleary, Stephen</dc:contributor>
    <dc:contributor>Holland, Charles W.</dc:contributor>
    <dc:language>eng</dc:language>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>McCleary, Stephen</dc:creator>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Kuhlmann, Salma</dc:creator>
    <dcterms:issued>2005</dcterms:issued>
    <dcterms:bibliographicCitation>Publ. in: Journal of Symbolic Logic ; 70 (2005), 2. - pp. 389-409</dcterms:bibliographicCitation>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja