Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Propositional quantification in logics of contingency

Propositional quantification in logics of contingency In this work we define contingency logic with arbitrary announcement. In contingency logic, the primitive modality contingency formalises that a proposition may be true but also may be false, so that if it is non-contingent then it is necessarily true or necessarily false. To this logic one can add dynamic operators to describe change of (non-)contingency. Our logic has operators for public announcement and operators for arbitrary public announcement, as in the dynamic epistemic logic called arbitrary public announcement logic. However, our language primitive is the more suitable notion of public announcement whether, instead of the public announcement that. We compare the expressive power of our logic and its various fragments to related dynamic epistemic logics. We further present an axiomatisation and show its completeness by adapting a method to demonstrate completeness of arbitrary public announcement logic. Various extensions are also shown to be complete with respect to the corresponding frame classes. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Applied Non-Classical Logics Taylor & Francis

Propositional quantification in logics of contingency

Propositional quantification in logics of contingency

Abstract

In this work we define contingency logic with arbitrary announcement. In contingency logic, the primitive modality contingency formalises that a proposition may be true but also may be false, so that if it is non-contingent then it is necessarily true or necessarily false. To this logic one can add dynamic operators to describe change of (non-)contingency. Our logic has operators for public announcement and operators for arbitrary public announcement, as in the dynamic epistemic logic called...
Loading next page...
 
/lp/taylor-francis/propositional-quantification-in-logics-of-contingency-OWMBLC0CZr
Publisher
Taylor & Francis
Copyright
© 2016 Informa UK Limited, trading as Taylor & Francis Group
ISSN
1958-5780
eISSN
1166-3081
DOI
10.1080/11663081.2016.1184931
Publisher site
See Article on Publisher Site

Abstract

In this work we define contingency logic with arbitrary announcement. In contingency logic, the primitive modality contingency formalises that a proposition may be true but also may be false, so that if it is non-contingent then it is necessarily true or necessarily false. To this logic one can add dynamic operators to describe change of (non-)contingency. Our logic has operators for public announcement and operators for arbitrary public announcement, as in the dynamic epistemic logic called arbitrary public announcement logic. However, our language primitive is the more suitable notion of public announcement whether, instead of the public announcement that. We compare the expressive power of our logic and its various fragments to related dynamic epistemic logics. We further present an axiomatisation and show its completeness by adapting a method to demonstrate completeness of arbitrary public announcement logic. Various extensions are also shown to be complete with respect to the corresponding frame classes.

Journal

Journal of Applied Non-Classical LogicsTaylor & Francis

Published: Jan 2, 2016

Keywords: Contingency logic; announcement whether; arbitrary announcement; axiomatisation; completeness; expressivity

References