Codings and strongly inaccessible cardinals View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2017-11

AUTHORS

Tadatoshi Miyamoto

ABSTRACT

We show that a coding principle introduced by J. Moore with respect to all ladder systems is equiconsistent with the existence of a strongly inaccessible cardinal. We also show that a coding principle introduced by S. Todorcevic has consistency strength at least of a strongly inaccessible cardinal.

PAGES

1037-1044

Journal

TITLE

Archive for Mathematical Logic

ISSUE

7-8

VOLUME

56

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s00153-017-0548-5

DOI

http://dx.doi.org/10.1007/s00153-017-0548-5

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1085712591


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "author": [
      {
        "affiliation": {
          "alternateName": "Nanzan University", 
          "id": "https://www.grid.ac/institutes/grid.444385.a", 
          "name": [
            "Nanzan University, 18 Yamazato-cho, 466-8673, Showa-ku, Nagoya, Japan"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Miyamoto", 
        "givenName": "Tadatoshi", 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.2307/2274108", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1030845626"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1142/s0219061305000407", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062989674"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1142/s0219061305000407", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062989674"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.4310/mrl.2002.v9.n4.a6", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1072462173"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2017-11", 
    "datePublishedReg": "2017-11-01", 
    "description": "We show that a coding principle introduced by J. Moore with respect to all ladder systems is equiconsistent with the existence of a strongly inaccessible cardinal. We also show that a coding principle introduced by S. Todorcevic has consistency strength at least of a strongly inaccessible cardinal.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s00153-017-0548-5", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": [
      {
        "id": "sg:journal.1136186", 
        "issn": [
          "0933-5846", 
          "1432-0665"
        ], 
        "name": "Archive for Mathematical Logic", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "7-8", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "56"
      }
    ], 
    "name": "Codings and strongly inaccessible cardinals", 
    "pagination": "1037-1044", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "7e4ffd17bcda99df75669feffc142f1d69a9d966b0dd7c04b1d61ec20ef74b4e"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s00153-017-0548-5"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1085712591"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s00153-017-0548-5", 
      "https://app.dimensions.ai/details/publication/pub.1085712591"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T09:53", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000347_0000000347/records_89793_00000003.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://link.springer.com/10.1007%2Fs00153-017-0548-5"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s00153-017-0548-5'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s00153-017-0548-5'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00153-017-0548-5'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00153-017-0548-5'


 

This table displays all metadata directly associated to this object as RDF triples.

61 TRIPLES      20 PREDICATES      28 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s00153-017-0548-5 schema:author N1a705f79286a48b8abd2c034bf8abf1b
2 schema:citation https://doi.org/10.1142/s0219061305000407
3 https://doi.org/10.2307/2274108
4 https://doi.org/10.4310/mrl.2002.v9.n4.a6
5 schema:datePublished 2017-11
6 schema:datePublishedReg 2017-11-01
7 schema:description We show that a coding principle introduced by J. Moore with respect to all ladder systems is equiconsistent with the existence of a strongly inaccessible cardinal. We also show that a coding principle introduced by S. Todorcevic has consistency strength at least of a strongly inaccessible cardinal.
8 schema:genre research_article
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N10db0f3c68c64f7381a95c0b1838fb3b
12 N5dae023a10374ad8866f4219482f604d
13 sg:journal.1136186
14 schema:name Codings and strongly inaccessible cardinals
15 schema:pagination 1037-1044
16 schema:productId N4309519d55b54238bbce18d9732f2ac5
17 N8e903d59cb554a87a4fab641769c9402
18 Nea7a87e9d1e248cb86e1163b9fb1ff98
19 schema:sameAs https://app.dimensions.ai/details/publication/pub.1085712591
20 https://doi.org/10.1007/s00153-017-0548-5
21 schema:sdDatePublished 2019-04-11T09:53
22 schema:sdLicense https://scigraph.springernature.com/explorer/license/
23 schema:sdPublisher N9b69912693444947b7a7279fc9d6ceb9
24 schema:url https://link.springer.com/10.1007%2Fs00153-017-0548-5
25 sgo:license sg:explorer/license/
26 sgo:sdDataset articles
27 rdf:type schema:ScholarlyArticle
28 N10db0f3c68c64f7381a95c0b1838fb3b schema:volumeNumber 56
29 rdf:type schema:PublicationVolume
30 N1a705f79286a48b8abd2c034bf8abf1b rdf:first N6149f632ee4442ec944b7f0214bc98d9
31 rdf:rest rdf:nil
32 N4309519d55b54238bbce18d9732f2ac5 schema:name doi
33 schema:value 10.1007/s00153-017-0548-5
34 rdf:type schema:PropertyValue
35 N5dae023a10374ad8866f4219482f604d schema:issueNumber 7-8
36 rdf:type schema:PublicationIssue
37 N6149f632ee4442ec944b7f0214bc98d9 schema:affiliation https://www.grid.ac/institutes/grid.444385.a
38 schema:familyName Miyamoto
39 schema:givenName Tadatoshi
40 rdf:type schema:Person
41 N8e903d59cb554a87a4fab641769c9402 schema:name readcube_id
42 schema:value 7e4ffd17bcda99df75669feffc142f1d69a9d966b0dd7c04b1d61ec20ef74b4e
43 rdf:type schema:PropertyValue
44 N9b69912693444947b7a7279fc9d6ceb9 schema:name Springer Nature - SN SciGraph project
45 rdf:type schema:Organization
46 Nea7a87e9d1e248cb86e1163b9fb1ff98 schema:name dimensions_id
47 schema:value pub.1085712591
48 rdf:type schema:PropertyValue
49 sg:journal.1136186 schema:issn 0933-5846
50 1432-0665
51 schema:name Archive for Mathematical Logic
52 rdf:type schema:Periodical
53 https://doi.org/10.1142/s0219061305000407 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062989674
54 rdf:type schema:CreativeWork
55 https://doi.org/10.2307/2274108 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030845626
56 rdf:type schema:CreativeWork
57 https://doi.org/10.4310/mrl.2002.v9.n4.a6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1072462173
58 rdf:type schema:CreativeWork
59 https://www.grid.ac/institutes/grid.444385.a schema:alternateName Nanzan University
60 schema:name Nanzan University, 18 Yamazato-cho, 466-8673, Showa-ku, Nagoya, Japan
61 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...