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", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/17", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Psychology and Cognitive Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1702", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Cognitive Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Computer Technology Associates, Suite 201, 14900 Sweitzer Lane, 20707, Laurel, MD, USA", 
          "id": "http://www.grid.ac/institutes/grid.433150.0", 
          "name": [
            "Computer Technology Associates, Suite 201, 14900 Sweitzer Lane, 20707, Laurel, MD, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Bailin", 
        "givenName": "Sidney C.", 
        "id": "sg:person.011667755735.32", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011667755735.32"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1988-09", 
    "datePublishedReg": "1988-09-01", 
    "description": "We present a semi-decision algorithm for the unifiability of two set-theoretic formulas modulo \u03bb-reduction. The algorithm is based on the approach developed by G. Huet for type theory, but requires additional measures because formulas in set theory are not all normalizable. We present the algorithm in an Ada-like pseudocode, and then prove two theorems that show the completeness and correctness of the procedure. We conclude by showing that \u03bb-unification is not a complete quantifier substitution method for set theory-unlile first-order unification and first-order logic. In this respect set theory is similar to type theory (higher-order logic).", 
    "genre": "article", 
    "id": "sg:pub.10.1007/bf00244943", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1136522", 
        "issn": [
          "0168-7433", 
          "1573-0670"
        ], 
        "name": "Journal of Automated Reasoning", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "3", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "4"
      }
    ], 
    "keywords": [
      "type theory", 
      "first-order logic", 
      "theory", 
      "set theory", 
      "unification", 
      "unifiability", 
      "Huet", 
      "logic", 
      "respect", 
      "approach", 
      "completeness", 
      "additional measures", 
      "correctness", 
      "algorithm", 
      "measures", 
      "formula", 
      "theorem", 
      "procedure", 
      "substitution method", 
      "method", 
      "semi-decision algorithm", 
      "pseudocode", 
      "first-order unification", 
      "reduction", 
      "test"
    ], 
    "name": "A \u03bb-unifiability test for set theory", 
    "pagination": "269-286", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1017454428"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf00244943"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf00244943", 
      "https://app.dimensions.ai/details/publication/pub.1017454428"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-06-01T21:59", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/article/article_193.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/bf00244943"
  }
]

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

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

95 TRIPLES      21 PREDICATES      54 URIs      43 LITERALS      6 BLANK NODES