- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The Complexity of Revision
Notre Dame Journal of Formal Logic 35 (1):67-72 (1994)
Abstract
In this paper we show that the Gupta-Belnap systems S# and S* are П12. Since Kremer has independently established that they are П12-hard, this completely settles the problem of their complexity. The above-mentioned upper bound is established through a reduction to countable revision sequences that is inspired by, and makes use of a construction of McGee.Author's Profile
Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
The Complexity of Revision, revised.Aldo Antonelli - 2002 - Notre Dame Journal of Formal Logic 43 (2):75-78.
The Complexity of Revision, Revised.G. Aldo Antonelli - 2002 - Notre Dame Journal of Formal Logic 43 (2):75-78.
Comparing More Revision and Fixed-Point Theories of Truth.Qiqing Lin & Hu Liu - 2021 - Journal of Philosophical Logic 50 (4):615-671.
The Gupta-Belnap systems ${\rm S}^\#$ and ${\rm S}^*$ are not axiomatisable.Philip Kremer - 1993 - Notre Dame Journal of Formal Logic 34 (4):583-596.
Revision Without Revision Sequences: Circular Definitions.Edoardo Rivello - 2019 - Journal of Philosophical Logic 48 (1):57-85.
Book Review: Anil Gupta and Nuel Belnap. The Revision Theory of Truth. [REVIEW]Robert C. Koons - 1994 - Notre Dame Journal of Formal Logic 35 (4):606-631.
A New Spectrum of Recursive Models.André Nies - 1999 - Notre Dame Journal of Formal Logic 40 (3):307-314.
Comparing inductive and circular definitions: Parameters, complexity and games.Kai-Uwe Küdhnberger, Benedikt Löwe, Michael Möllerfeld & Philip Welch - 2005 - Studia Logica 81 (1):79 - 98.
The Borel Complexity of Isomorphism for Theories with Many Types.David Marker - 2007 - Notre Dame Journal of Formal Logic 48 (1):93-97.
Isomorphism of Homogeneous Structures.John D. Clemens - 2009 - Notre Dame Journal of Formal Logic 50 (1):1-22.
Analytics
Added to PP
2010-08-24
Downloads
55 (#390,837)
6 months
6 (#851,135)
2010-08-24
Downloads
55 (#390,837)
6 months
6 (#851,135)
Historical graph of downloads
Author's Profile
Citations of this work
Conditionals in Theories of Truth.Anil Gupta & Shawn Standefer - 2017 - Journal of Philosophical Logic 46 (1):27-63.
Solovay-Type Theorems for Circular Definitions.Shawn Standefer - 2015 - Review of Symbolic Logic 8 (3):467-487.
Revision Without Revision Sequences: Self-Referential Truth.Edoardo Rivello - 2019 - Journal of Philosophical Logic 48 (3):523-551.
Guest Editors’ Introduction.Riccardo Bruni & Shawn Standefer - 2019 - Journal of Philosophical Logic 48 (1):1-9.
Property theory and the revision theory of definitions.Francesco Orilia - 2000 - Journal of Symbolic Logic 65 (1):212-246.
References found in this work
The Gupta-Belnap systems ${\rm S}^\#$ and ${\rm S}^*$ are not axiomatisable.Philip Kremer - 1993 - Notre Dame Journal of Formal Logic 34 (4):583-596.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-f8568656d-4gxsk uwo