Fixed-point Logic

Fixed-Point Logic is a formal logical system that extends first-order logic by allowing the explicit definition of recursive predicates through least or inflationary fixed points, thereby enabling the expression of iterative and inductive constructions in descriptive complexity.

256

Publications

13.9K

Citations

419

Authors

231

Institutions

Publications per year

2017–2026

24

Authors

419

  1. AD
    Anuj Dawar

    University of Cambridge, United Kingdom

    11 publications · 370 citations

    11

    h-index

  2. MG
    Martin Grohe

    Humboldt-Universität zu Berlin, Germany

    10 publications · 350 citations

    10

    h-index

  3. YG
    Yuri Gurevich

    University of Michigan, United States

    6 publications · 529 citations

    6

    h-index

  4. GG
    Georg Gottlob

    TU Wien, Austria

    5 publications · 474 citations

    5

    h-index

  5. EG
    Erich Grädel

    RWTH Aachen University, Germany

    5 publications · 179 citations

    5

    h-index

1–5 of 419

Venues

  1. Theoretical Computer Science

    17 publications · 729 citations

    15

    h-index

  2. Journal of Logic and Computation

    7 publications · 565 citations

    7

    h-index

  3. Annals of Pure and Applied Logic

    6 publications · 363 citations

    6

    h-index

  4. ACM Transactions on Computational Logic

    TOCL · 6 publications · 334 citations

    6

    h-index

  5. Journal of Symbolic Logic

    6 publications · 249 citations

    6

    h-index

1–5