{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:32:00Z","timestamp":1725550320099},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The notion of feasibility, applicable in various areas related to logic, is arguably of gradual nature---some tasks are more feasible than others. The possibility of modeling a gradual notion of feasibility in t-norm logics is brought forward and illustrated on the gradual notions of feasible number, feasible knowledge, feasible formula, and feasible computability.<\/jats:p>","DOI":"10.29007\/kjk6","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T17:57:35Z","timestamp":1516730255000},"page":"15-9","source":"Crossref","is-referenced-by-count":0,"title":["Feasibility as a gradual notion"],"prefix":"10.29007","volume":"13","author":[{"given":"Libor","family":"Behounek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning."},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T17:57:35Z","timestamp":1516730255000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/q7b"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/kjk6","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}