Recursive definitions and fixed-points on well-founded structures

An expression such as ∀ x ( P ( x ) ↔ ϕ ( P ) ) , where P occurs in ϕ ( P ) , does not always define P . When such an expression implicitly defines P , in the sense of Beth (1953) [1] and Padoa (1900) [13], we call it a recursive definition. In the Least Fixed-Point Logic (LFP), we have theories whe...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 412; no. 37; pp. 4893 - 4904
Main Authors:	Ferreira, Francicleber Martins, Martins, Ana Teresa
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 26.08.2011
Subjects:	Beth’s definability theorem Computer simulation Constrictions Fixed points (mathematics) Fixed-points Fragments Logic Mathematical analysis Mathematical models Recursive Recursive definitions Theorems Beth’s definability theorem Recursive definitions Fixed-points
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!