Fixed-point Logics

Fixed-Point Logics is a formal logical system that extends predicate logic by allowing the definition of predicates through least or greatest fixed points of monotone operators, thereby enabling the expressive characterization of inductive and coinductive definitions.

108

Publications

5.2K

Citations

148

Authors

105

Institutions

Publications per year

2017–2026

12

Authors

148

  1. GG
    Georg Gottlob

    TU Wien, Austria

    5 publications · 417 citations

    5

    h-index

  2. MG
    Martin Grohe

    Humboldt-Universität zu Berlin, Germany

    5 publications · 138 citations

    5

    h-index

  3. AD
    Anuj Dawar

    University of Cambridge, United Kingdom

    5 publications · 134 citations

    5

    h-index

  4. BT
    Balder ten Cate

    University of California, Santa Cruz, United States

    4 publications · 166 citations

    4

    h-index

  5. SK
    Stephan Kreutzer

    Technische Universität Berlin, Germany

    4 publications · 91 citations

    4

    h-index

1–5 of 148

Venues

  1. Theoretical Computer Science

    5 publications · 335 citations

    5

    h-index

  2. Journal of Logic and Computation

    5 publications · 440 citations

    5

    h-index

  3. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 4 publications · 84 citations

    4

    h-index

  4. Information and Computation

    4 publications · 314 citations

    4

    h-index

  5. Annals of Pure and Applied Logic

    4 publications · 365 citations

    4

    h-index

1–5