{ "items" : [
    { "id" : "http://webisa.webdatacommons.org/171090552"
      "properties" : {
        "http://www.w3.org/1999/02/22-rdf-syntax-ns#type" : [ "http://www.w3.org/ns/prov#Entity" ] ,
        "http://www.w3.org/ns/prov#value" : [ "Then a full set is any subset of XX that contains in an element of ???\\mathcal{F}. (If we start with the ??\\delta-filter ?????\\bar{\\mathcal{F}} in ????X\\mathcal{P}X, then every full set must contain a measurable full set.) In constructive mathematics, full sets are more fundamental for such examples as Lebesgue measure." ] ,
        "http://www.w3.org/ns/prov#wasQuotedFrom" : [ "ncatlab.org" ] } },

    { "id" : "http://webisa.webdatacommons.org/prov/433980450"
      "properties" : {
        "http://www.w3.org/ns/prov#wasDerivedFrom" : [ "http://webisa.webdatacommons.org/171090552"] } } }
