The complexity of revision

DOI10.1305/NDJFL/1040609294zbMath0801.03021OpenAlexW2010506509MaRDI QIDQ1333309

Gian Aldo Antonelli

Publication date: 1 December 1994

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1040609294

zbMATH Keywords

complexityupper boundcountable revision sequencesGupta-Belnap systems

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Philosophical and critical aspects of logic and foundations (03A05) Complexity of computation (including implicit computational complexity) (03D15) Gödel numberings and issues of incompleteness (03F40) Hierarchies of computability and definability (03D55)

Related Items (6)

SOLOVAY-TYPE THEOREMS FOR CIRCULAR DEFINITIONS ⋮ Conditionals in theories of truth ⋮ The complexity of revision, revised ⋮ Guest editors' introduction ⋮ Revision without revision sequences: self-referential truth ⋮ Property theory and the revision theory of definitions

Cites Work

• The Gupta-Belnap systems \({\mathbf S}^ \#\) and \({\mathbf S}^*\) are not axiomatisable
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of revision