Feasibility as a gradual notion

5 pages•Published: March 25, 2013

Abstract

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.

Keyphrases: feasibility, gradualness, logical omniscience, t norm logics

In: Andrei Voronkov, Geoff Sutcliffe, Matthias Baaz and Christian Fermüller (editors). LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning., vol 13, pages 15-19.

Links:	https://easychair.org/publications/paper/q7b
	https://doi.org/10.29007/kjk6

BibTeX entry

@inproceedings{LPAR-17-short:Feasibility_as_gradual_notion,
  author    = {Libor Behounek},
  title     = {Feasibility as a gradual notion},
  booktitle = {LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning.},
  editor    = {Andrei Voronkov and Geoff Sutcliffe and Matthias Baaz and Christian Fermüller},
  series    = {EPiC Series in Computing},
  volume    = {13},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/q7b},
  doi       = {10.29007/kjk6},
  pages     = {15-19},
  year      = {2013}}

Download PDF Open PDF in browser