Comparing inductive and circular definitions: Parameters, complexity and games (Q817681): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: What's in a function? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The truth is never simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Patterns of paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4805123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revision Sequences and Computers with an Infinite Amount of Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-theoretic absoluteness and the revision theory of truth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Game Quantifier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary induction on abstract structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meaning and circular definitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Gupta-Belnap Revision Theories of Truth, Kripkean Fixed Points, and The Next Stable Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On revision operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak systems of determinacy and arithmetical quasi-inductive definitions / rank
 
Normal rank

Revision as of 11:05, 24 June 2024

scientific article
Language Label Description Also known as
English
Comparing inductive and circular definitions: Parameters, complexity and games
scientific article

    Statements

    Comparing inductive and circular definitions: Parameters, complexity and games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 March 2006
    0 references
    Recall that in the revision theory of truth we have a base language which, for simplicity, is usually taken as first-order (axiomatic) arithmetic. Then we search to define the extension of an additional predicate by semantic rules. In this comprehensive paper, the authors investigate the underlying logical methodologies of inductive definitions and circular definitions (in a vague sense, the next step after inductive definitions). Using game-theoretic representations (say, in the sense of Y. N. Moschovakis's game quantifier) they discuss ways in which inductive and circular definitions form different levels of a hierarchy. Several theorems are proved in great detail. The reviewer looks forward to the treatment of analogical definitions as the next step after circular definitions.
    0 references
    finite model theory
    0 references
    inductive definitions
    0 references
    revision theory of truth
    0 references
    circular definitions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references