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

Saved in:
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!
Description
Summary: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 where interesting relations can be recursively defined (Ebbinghaus, 1995 [4], Libkin, 2004 [12]). We will show that for some sorts of recursive definitions there are explicit definitions on sufficiently strong theories of LFP. It is known that LFP, restricted to finite models, does not have Beth’s Definability Theorem (Gurevich, 1996 [7], Hodkinson, 1993 [8], Dawar, 1995 [3]). Beth’s Definability Theorem states that, if a relation is implicitly defined, then there is an explicit definition for it. We will also give a proof that Beth’s Definability Theorem fails for LFP without this finite model restriction. We will investigate fragments of LFP for which Beth’s Definability Theorem holds, specifically theories whose models are well-founded structures.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2011.01.028