Recursive definitions and fixed-points on well-founded structures

DOI10.1016/j.tcs.2011.01.028zbMath1252.03088OpenAlexW2017762820MaRDI QIDQ654910

Ana Teresa Martins, Francicleber Martins Ferreira

Publication date: 23 December 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.028

zbMATH Keywords

recursive definitionsBeth's definability theoremleast fixed-point logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Interpolation, preservation, definability (03C40)

Cites Work

• Elements of finite model theory.
• A lattice-theoretical fixpoint theorem and its applications
• Fixed Point Logics
• Implicit definability and infinitary logic in finite model theory
• On finite rigid structures
• Recursive Definitions and Fixed-Points
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursive definitions and fixed-points on well-founded structures