S. Abiteboul & V. Vianu (1987):
A Transaction Language Complete for Database Update and Specification.
In: Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems,
San Diego, CA,
pp. 260–268,
doi:10.1145/28659.28688.
H. R. Andersen (1994):
A Polyadic Modal μ-Calculus.
Technical Report ID-TR: 1994-195.
Dept. of Computer Science, Technical University of Denmark, Copenhagen,
doi:10.1.1.42.1859.
R. Axelsson, M. Lange & R. Somla (2007):
The Complexity of Model Checking Higher-Order Fixpoint Logic.
Logical Methods in Computer Science 3,
pp. 1–33,
doi:10.2168/LMCS-3(2:7)2007.
F. Bruse, M. Lange & É. Lozes (2017):
Space-Efficient Fragments of Higher-Order Fixpoint Logic.
In: Proc. 11th Int. Workshop on Reachability Problems, RP'17,
LNCS 10506,
pp. 26–41,
doi:10.1007/978-3-319-67089-8_3.
R. Fagin (1974):
Generalized First-Order Spectra and Polynomial-Time Recognizable Sets.
Complexity and Computation 7,
pp. 43–73.
C. M. Freire & A. T. Martins (2011):
The Descriptive Complexity of the Deterministic Exponential Time Hierarchy.
In: Proc. 5th Workshop on Logical and Semantic Frameworks with Applications, LSFA'10 269,
pp. 71–82,
doi:10.1016/j.entcs.2011.03.006.
M. Grohe (2008):
The Quest for a Logic Capturing PTIME.
In: Proc. 23rd Annual IEEE Symp. on Logic in Computer Science, LICS'08.
IEEE Computer Society,
pp. 267–271,
doi:10.1109/LICS.2008.11.
N. Immerman (1986):
Relational Queries Computable in Polynomial Time.
Information and Control 68(1-3),
pp. 86–104,
doi:10.1016/S0019-9958(86)80029-8.
N. Immerman (1987):
Languages That Capture Complexity Classes.
SIAM Journal of Computing 16(4),
pp. 760–778,
doi:10.1137/0216051.
S. C. Kleene (1938):
On Notation for Ordinal Numbers.
Journal of Symbolic Logic 3(4),
pp. 150–155,
doi:10.2307/2267778.
B. Knaster (1928):
Un théorèm sur les fonctions d'ensembles.
Annals Soc. Pol. Math 6,
pp. 133–134.
D. Kozen (1983):
Results on the Propositional μ-calculus.
Theor. Comp. Sci. 27,
pp. 333–354,
doi:10.1016/0304-3975(82)90125-6.
D. Kronenberger (2018):
Capturing Bisimulation-Invariant Complexity Classes by Polyadic Higher-Order Fixpoint Logic.
University of Kassel.
M. Lange & É. Lozes (2012):
Model Checking the Higher-Dimensional Modal μ-Calculus.
In: Proc. 8th Workshop on Fixpoints in Computer Science, FICS'12,
Electr. Proc. in Theor. Comp. Sc. 77,
pp. 39–46,
doi:10.4204/EPTCS.77.
M. Lange & É. Lozes (2014):
Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic.
In: Proc. 8th Int. IFIP Conf. on Theoretical Computer Science, TCS'14,
LNCS 8705.
Springer,
pp. 90–103,
doi:10.1007/978-3-662-44602-7.
M. Lange, É. Lozes & M. Vargas Guzmán (2014):
Model-Checking Process Equivalences.
Theor. Comp. Sci. 560,
pp. 326–347,
doi:10.1016/j.tcs.2014.08.020.
M. Otto (1999):
Bisimulation-invariant PTIME and higher-dimensional μ-calculus.
Theor. Comput. Sci. 224(1-2),
pp. 237–265,
doi:10.1016/S0304-3975(98)00314-4.
A. Tarski (1955):
A Lattice-theoretical Fixpoint Theorem and its Application.
Pacific Journal of Mathematics 5,
pp. 285–309,
doi:10.2140/pjm.1955.5.285.
J. van Benthem & K. Doets (1983):
Higher-Order Logic.
In: D. Gabbay & F. Guenther: Handbook of Philosophical Logic, Volume I: Elements of Classical Logic.
D. Reidel Publishing Co.,
pp. 275–329,
doi:10.1007/978-94-009-7066-3_4.
M. Y. Vardi (1982):
The Complexity of Relational Query Languages (Extended Abstract).
In: Proc. 14th Symp. on Theory of Computing, STOC'82.
ACM,
San Francisco, CA, USA,
pp. 137–146,
doi:10.1145/800070.
M. Viswanathan & R. Viswanathan (2004):
A Higher Order Modal Fixed Point Logic.
In: Proc. 15th Int. Conf. on Concurrency Theory, CONCUR'04,
LNCS 3170.
Springer,
pp. 512–528,
doi:10.1007/978-3-540-28644-8_33.
eptcs@eptcs.org