References of "Journal of Philosophical Logic"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailCut-Elimination for Quantified Conditional Logic
Benzmüller, Christoph UL

in Journal of Philosophical Logic (2017), 46(3), 333353

A semantic embedding of quantified conditional logic in classical higher-order logic is utilized for reducing cut-elimination in the former logic to existing results for the latter logic. The presented ... [more ▼]

A semantic embedding of quantified conditional logic in classical higher-order logic is utilized for reducing cut-elimination in the former logic to existing results for the latter logic. The presented embedding approach is adaptable to a wide range of other logics, for many of which cut-elimination is still open. However, special attention has to be payed to cut-simulation, which may render cut-elimination as a pointless criterion. [less ▲]

Detailed reference viewed: 45 (0 UL)
Full Text
Peer Reviewed
See detailConditional Ranking Revision - Iterated Revision with Sets of Conditionals
Weydert, Emil UL

in Journal of Philosophical Logic (2012), 41(1), 237-271

In the context of a general framework for belief dynamics which interprets revision as doxastic constraint satisfaction, we discuss a proposal for revising quasi-probabilistic belief measures with finite ... [more ▼]

In the context of a general framework for belief dynamics which interprets revision as doxastic constraint satisfaction, we discuss a proposal for revising quasi-probabilistic belief measures with finite sets of graded conditionals. The belief states are ranking measures with divisible values (generalizing Spohn's epistemology), and the conditionals are interpreted as ranking constraints. The approach is inspired by the minimal information paradigm and based on the principle-guided canonical construction of a ranking model of the input conditionals. This is achieved by extending techniques known from conditional default reasoning. We give an overview of how it handles different principles for conditional and parallel revision and compare it with similar accounts. [less ▲]

Detailed reference viewed: 51 (4 UL)
Full Text
Peer Reviewed
See detailA general family of preferential belief removal operators
Booth, Richard UL; Meyer, Thomas; Sombattheera, Chattrakul

in Journal of Philosophical Logic (2012), 41(4), 711-733

Most belief change operators in the AGM tradition assume an underlying plausibility ordering over the possible worlds which is transitive and complete. A unifying structure for these operators, based on ... [more ▼]

Most belief change operators in the AGM tradition assume an underlying plausibility ordering over the possible worlds which is transitive and complete. A unifying structure for these operators, based on supplementing the plausibility ordering with a second, guiding, relation over the worlds was presented in Booth et al. (Artif Intell 174:1339–1368, 2010). However it is not always reasonable to assume completeness of the underlying ordering. In this paper we generalise the structure of Booth et al. (Artif Intell 174:1339–1368, 2010) to allow incomparabilities between worlds. We axiomatise the resulting class of belief removal functions, and show that it includes an important family of removal functions based on finite prioritised belief bases. [less ▲]

Detailed reference viewed: 50 (0 UL)
Full Text
Peer Reviewed
See detailHow to revise a total preorder
Booth, Richard UL; Meyer, Thomas

in Journal of Philosophical Logic (2011), 40

Detailed reference viewed: 38 (1 UL)