1101 search results - page 28 / 221 » Forcing in proof theory |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
The theory revision problem is the problem of how best to go about revising a deficient domain theory using information contained in examples that expose inaccuracies. In this pa...
TPHOL
2003
IEEE
14 years 25 days ago
2003
IEEE
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
AML
2007
13 years 7 months ago
2007
In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each...
CSL
2005
Springer
14 years 1 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
KI
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. We investigate the task of skeptically reasoning in extensionbased, nonmonotonic logics by concentrating on general argumentation theories. The restricted applicability o...