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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 01:18, 5 March 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