This is a preview. Log in through your library . Abstract I survey Brouwer's weak counterexamples to classical theorems, with a view to discovering (i) what useful mathematical work is done by weak ...
Studia Logica: An International Journal for Symbolic Logic, Vol. 101, No. 1 (February 2013), pp. 31-44 (14 pages) Provability logic is a modal logic for studying properties of provability predicates, ...
In the article, the authors harness recent advances in incremental answer set solving for developing effective algorithms for reasoning tasks in the logic programming fragment of assumption-based ...
Quantified Boolean Formulas (QBF) extend classical Boolean logic by incorporating quantifiers over Boolean variables, thereby enabling the expression of problems in the PSPACE complexity class. The ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback