Comparing inductive and circular definitions: Parameters, complexity and games

DOI10.1007/S11225-005-2803-8MaRDI QIDQ817681zbMATH OpenOpenAlexFDO

Authors Kai-Uwe Kühnberger, Michael Möllerfeld, Benedikt Löwe, 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

zbMATH Keywords

finite model theoryinductive definitionscircular definitionsrevision theory of truth

Mathematics Subject Classification ID

Applications of game theory (91A80) Philosophical and critical aspects of logic and foundations (03A05) Model theory of finite structures (03C13) Determinacy principles (03E60) General logic (03B99) Inductive definability (03D70)

Recommendations

• On the complexity of inductive definitions
• Game-theoretic inductive definability
• New Computational Paradigms
• Infinite games and transfinite recursion of multiple inductive definitions
• Infinite Games, Inductive Definitions and Transfinite Recursion
• Definability in games
• From parity games to circular proofs
• Variations on inductive-recursive definitions
• The geometry of inductive reasoning in games
• Iterated inductive definitions revisited

Cites work

• scientific article; zbMATH DE number 3861143 (Why is no real title available?)
• scientific article; zbMATH DE number 4156407 (Why is no real title available?)
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• scientific article; zbMATH DE number 1948172 (Why is no real title available?)
• scientific article; zbMATH DE number 1908324 (Why is no real title available?)
• scientific article; zbMATH DE number 795569 (Why is no real title available?)
• scientific article; zbMATH DE number 803269 (Why is no real title available?)
• Descriptive set theory
• Elementary induction on abstract structures
• Meaning and circular definitions
• On Gupta-Belnap revision theories of truth, Kripkean fixed points and the next stable set
• On revision operators
• Patterns of paradox
• Revision sequences and computers with an infinite amount of time
• Set-theoretic absoluteness and the revision theory of truth
• The Game Quantifier
• The truth is never simple
• Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
• Weak systems of determinacy and arithmetical quasi-inductive definitions
• What's in a function?

Cited in

(8)

• scientific article; zbMATH DE number 1302495 (Why is no real title available?)
• Revision without revision sequences: circular definitions
• Guest editors' introduction
• A fixed point theory over stratified truth
• Conditionals in theories of truth
• Rethinking revision
• Solovay-type theorems for circular definitions
• Cofinally invariant sequences and revision

This page was built for publication: Comparing inductive and circular definitions: Parameters, complexity and games

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