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...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 412; číslo 37; s. 4893 - 4904
Hlavní autori:	Ferreira, Francicleber Martins, Martins, Ana Teresa
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 26.08.2011
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!