COMPLETENESS FOR COUNTER-DOXA CONDITIONALS – USING RANKING SEMANTICS

DOI10.1017/S1755020318000199zbMath1442.03004OpenAlexW2898821837MaRDI QIDQ5216973

Eric Raidl

Publication date: 20 February 2020

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1755020318000199

zbMATH Keywords

conditionalsconditionalisationnonvacuismranking theoryranking semanticscounter-possiblesvacuism

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Philosophical and critical aspects of logic and foundations (03A05) Logics of knowledge and belief (including belief change) (03B42)

Related Items (4)

Proof systems for super-strict implication ⋮ Stalnakerian connexive logics ⋮ The implicative conditional ⋮ Defeasible normative reasoning

Cites Work

• Unnamed Item
• Unnamed Item
• Quick completeness proofs for some logics of conditionals
• Counterfactuals and comparative possibility
• A misplaced thesis of conditional logic
• Basic conditional logic
• Cotenability and counterfactual logics
• Impossible worlds: A modest approach
• On the logic of iterated belief revision
• Williamson on counterpossibles
• Bridging ranking theory and the stability theory of belief
• Why follow the royal rule?
• A relevant theory of conditionals
• Counterpossibles
• What should I believe about what would have been the case?
• Qualitative probabilities for default reasoning, belief revision, and causal modeling
• Remarks on counterpossibles
• The consistency argument for ranking functions
• The logic of theory assessment
• Ranking functions and rankings on languages
• New foundations for counterfactuals
• On the logic of theory change: Partial meet contraction and revision functions
• Plausibility measures and default reasoning
• Completeness and decidability of three logics of counterfactual conditionals¹

This page was built for publication: COMPLETENESS FOR COUNTER-DOXA CONDITIONALS – USING RANKING SEMANTICS