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
Parents
108
Complexity Results for Nonmonotonic Logics
Georg Gottlob · Journal of Logic and Computation · 1992 · 349 citations
Fixed-point extensions of first-order logic
Yuri Gurevich, Saharon Shelah · Annals of Pure and Applied Logic · 1986 · 243 citations · Full text
Fixpoint semantics for logic programming a survey
Melvin Fitting · Theoretical Computer Science · 2002 · 229 citations
Quantitative deduction and its fixpoint theory
M. H. van Emden · The Journal of Logic Programming · 1986 · 216 citations
1–5 of 108
148
5
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 148
105
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
8 h-index
9 publications
431 citations
RWTH Aachen University
Aachen, Germany
8 h-index
13 publications
295 citations
Université Paris Cité
Paris, France
6 h-index
7 publications
209 citations

University of Amsterdam
Amsterdam, The Netherlands
6 h-index
6 publications
260 citations
University of California, Santa Cruz
Santa Cruz, United States
5 h-index
6 publications
180 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
7 publications
216 citations
University of Cambridge
Cambridge, United Kingdom
5 h-index
5 publications
134 citations
Humboldt-Universität zu Berlin
Berlin, Germany
4 h-index
5 publications
79 citations
1–8 of 105
5 publications · 335 citations
5
h-index
5 publications · 440 citations
5
h-index
Repository · 4 publications · 84 citations
4
h-index
4 publications · 314 citations
4
h-index
4 publications · 365 citations
4
h-index
1–5