Publication
Two level credibility-limited revisions
dc.contributor.author | Garapa, Marco | |
dc.date.accessioned | 2023-06-19T09:20:07Z | |
dc.date.available | 2023-06-19T09:20:07Z | |
dc.date.issued | 2020 | |
dc.description.abstract | In this paper, we propose a new kind of nonprioritized operator which we call two level credibility-limited revision. When revising through a two level credibility-limited revision there are two levels of credibility and one of incredibility. When revising by a sentence at the highest level of credibility, the operator behaves as a standard revision, if the sentence is at the second level of credibility, then the outcome of the revision process coincides with a standard contraction by the negation of that sentence. If the sentence is not credible, then the original belief set remains unchanged. In this article, we axiomatically characterize several classes of two level credibility-limited revision operators. | pt_PT |
dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
dc.identifier.citation | Garapa, M. (2022). Two level credibility-limited revisions. The Review of Symbolic Logic, 15(2), 388-408. | pt_PT |
dc.identifier.doi | 10.1017/S1755020320000283 | pt_PT |
dc.identifier.uri | http://hdl.handle.net/10400.13/5232 | |
dc.language.iso | eng | pt_PT |
dc.peerreviewed | yes | pt_PT |
dc.publisher | Cambridge University Press | pt_PT |
dc.relation | Research Centre for Mathematics and Applications | |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | pt_PT |
dc.subject | Belief change | pt_PT |
dc.subject | Non-prioritized belief revision | pt_PT |
dc.subject | Two level credibility-limited revisions functions | pt_PT |
dc.subject | Axiomatic characterizations | pt_PT |
dc.subject | . | pt_PT |
dc.subject | Faculdade de Ciências Exatas e da Engenharia | pt_PT |
dc.title | Two level credibility-limited revisions | pt_PT |
dc.type | journal article | |
dspace.entity.type | Publication | |
oaire.awardTitle | Research Centre for Mathematics and Applications | |
oaire.awardURI | info:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UID%2FMAT%2F04674%2F2019/PT | |
oaire.awardURI | info:eu-repo/grantAgreement/FCT/3599-PPCDT/PTDC%2FCCI-COM%2F30990%2F2017/PT | |
oaire.citation.endPage | 408 | pt_PT |
oaire.citation.issue | 2 | pt_PT |
oaire.citation.startPage | 388 | pt_PT |
oaire.citation.title | The Review of Symbolic Logic | pt_PT |
oaire.citation.volume | 15 | pt_PT |
oaire.fundingStream | 6817 - DCRRNI ID | |
oaire.fundingStream | 3599-PPCDT | |
person.familyName | Garapa | |
person.givenName | Marco | |
person.identifier.ciencia-id | 2712-ABAA-7FAD | |
person.identifier.orcid | 0000-0003-3697-1565 | |
person.identifier.scopus-author-id | 57191524100 | |
project.funder.identifier | http://doi.org/10.13039/501100001871 | |
project.funder.identifier | http://doi.org/10.13039/501100001871 | |
project.funder.name | Fundação para a Ciência e a Tecnologia | |
project.funder.name | Fundação para a Ciência e a Tecnologia | |
rcaap.rights | openAccess | pt_PT |
rcaap.type | article | pt_PT |
relation.isAuthorOfPublication | 17ad4b81-ed14-4f2c-9302-0c6fa9125673 | |
relation.isAuthorOfPublication.latestForDiscovery | 17ad4b81-ed14-4f2c-9302-0c6fa9125673 | |
relation.isProjectOfPublication | 7b72ed6c-ce54-464b-8531-324933bf3775 | |
relation.isProjectOfPublication | 9cf81ce7-2e2d-469d-ba33-9a70d1eb657d | |
relation.isProjectOfPublication.latestForDiscovery | 9cf81ce7-2e2d-469d-ba33-9a70d1eb657d |