Epistemic entrenchment and arithmetical hierarchy
From MaRDI portal
Publication:685538
DOI10.1016/0004-3702(93)90046-EzbMath0785.03011OpenAlexW2032962458MaRDI QIDQ685538
Publication date: 21 April 1994
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(93)90046-e
defeasible proofsdefeasible provabilityepistemic entrenchment preorder of sentencesprovability in experimental logics
Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) First-order arithmetic and fragments (03F30) Hierarchies of computability and definability (03D55)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Epistemic entrenchment and possibilistic logic
- How to reason defeasibly
- Experimental logics and \(\Delta^0_2\)-theories
- Classical recursion theory. Vol. II
- Nonmonotonic inference based on expectations
- Experimental logics and Π30 theories
- Trial and error predicates and the solution to a problem of Mostowski
- Limiting recursion
- ∏ 0 1 Classes and Degrees of Theories