On revision operators

DOI10.2178/JSL/1052669071MaRDI QIDQ3160562zbMATH OpenOpenAlexFDO

Authors

Publication date 9 February 2005

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.jsl/1052669071

zbMATH Keywords

admissibilitydefinabilityrevision theorytheory of truth

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Inductive definability (03D70) Descriptive set theory (03E15) Second- and higher-order arithmetic and fragments (03F35)

Recommendations

• Rethinking revision
• On Gupta-Belnap revision theories of truth, Kripkean fixed points and the next stable set
• Revision revisited
• What's in a function?
• Cofinally invariant sequences and revision

Cites work

• A generalization of the limit lemma and clopen games
• A revision-theoretic analysis of the arithmetical hierarchy
• Alternative revision theories of truth
• Elementary induction on abstract structures
• scientific article; zbMATH DE number 3861143 (Why is no real title available?)
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• scientific article; zbMATH DE number 795569 (Why is no real title available?)
• scientific article; zbMATH DE number 3250555 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Infinite time Turing machines
• Minimality in the ${Δ^1}_2$-degrees
• Outline of a Theory of Truth
• Revision sequences and computers with an infinite amount of time
• Set-theoretic absoluteness and the revision theory of truth
• The truth is never simple

Cited in

(10)

• What's in a function?
• Comparing more revision and fixed-point theories of truth
• Cofinally invariant sequences and revision
• Truth, dependence and supervaluation: living with the ghost
• Revision without revision sequences: circular definitions
• Rethinking revision
• Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines
• A NOTE ON THEORIES FOR QUASI-INDUCTIVE DEFINITIONS
• Guest editors' introduction
• Comparing inductive and circular definitions: Parameters, complexity and games

This page was built for publication: On revision operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3160562)