{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:26:21Z","timestamp":1777645581398,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2016,12,24]],"date-time":"2016-12-24T00:00:00Z","timestamp":1482537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2016,12,24]]},"abstract":"<jats:p>We investigate the foundations of reasoning over infinite data structures by means of set-theoretical structures arising in the sheaf-theoretic semantics of higher-order intuitionistic logic. Our approach focuses on a natural notion of tiering involving an operation of restriction of elements to levels forming a complete Heyting algebra. We relate these tiered objects to final coalgebras and initial algebras of a wide class of endofunctors of the category of sets, and study their order and convergence properties. As a sample application, we derive a general proof principle for tiered objects.<\/jats:p>","DOI":"10.3233\/fi-2016-1449","type":"journal-article","created":{"date-parts":[[2016,12,27]],"date-time":"2016-12-27T10:59:08Z","timestamp":1482836348000},"page":"263-295","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Tiered Objects"],"prefix":"10.1177","volume":"149","author":[{"given":"Fabio","family":"Alessi","sequence":"first","affiliation":[{"name":"Dipartimento di Scienze Matematiche Informatiche e Fisiche Universit\u00e0 di Udine via delle Scienze 206, I-33100 Udine, Italy"},{"name":"Dipartimento di Informatica, Universit\u00e0 di Torino corso Svizzera 185 I-10149 Torino, Italy"}]},{"given":"Felice","family":"Cardone","sequence":"additional","affiliation":[{"name":"Dipartimento di Scienze Matematiche Informatiche e Fisiche Universit\u00e0 di Udine via delle Scienze 206, I-33100 Udine, Italy"},{"name":"Dipartimento di Informatica, Universit\u00e0 di Torino corso Svizzera 185 I-10149 Torino, Italy"}]}],"member":"179","published-online":{"date-parts":[[2016,12,24]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2016-1449","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2016-1449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:38Z","timestamp":1777444358000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2016-1449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,24]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,12,24]]}},"alternative-id":["10.3233\/FI-2016-1449"],"URL":"https:\/\/doi.org\/10.3233\/fi-2016-1449","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,24]]}}}