Comparing inductive and circular definitions: Parameters, complexity and games
From MaRDI portal
Publication:817681
DOI10.1007/s11225-005-2803-8zbMath1098.03041OpenAlexW2148907430MaRDI QIDQ817681
Michael Möllerfeld, Kai-Uwe Kühnberger, Benedikt Loewe, Philip D. Welch
Publication date: 17 March 2006
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-005-2803-8
Applications of game theory (91A80) Philosophical and critical aspects of logic and foundations (03A05) Model theory of finite structures (03C13) General logic (03B99) Inductive definability (03D70) Determinacy principles (03E60)
Related Items (7)
SOLOVAY-TYPE THEOREMS FOR CIRCULAR DEFINITIONS ⋮ Conditionals in theories of truth ⋮ A fixed point theory over stratified truth ⋮ Revision without revision sequences: circular definitions ⋮ Rethinking revision ⋮ Guest editors' introduction ⋮ Cofinally invariant sequences and revision
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
- Descriptive set theory
- Elementary induction on abstract structures
- What's in a function?
- Meaning and circular definitions
- Revision Sequences and Computers with an Infinite Amount of Time
- On Gupta-Belnap Revision Theories of Truth, Kripkean Fixed Points, and The Next Stable Set
- Weak systems of determinacy and arithmetical quasi-inductive definitions
- On revision operators
- The truth is never simple
- Patterns of paradox
- The Game Quantifier
- Set-theoretic absoluteness and the revision theory of truth
This page was built for publication: Comparing inductive and circular definitions: Parameters, complexity and games