About: Bekić's theorem

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Bekić's theorem Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FBeki%C4%87%27s_theorem&invfp=IFP_OFF&sas=SAME_AS_OFF

In computability theory, Bekić's theorem or Bekić's lemma is a theorem about fixed-points which allows splitting a mutual recursion into recursions on one variable at a time. It was created by Hans Bekić in 1969, and published posthumously in a book by Cliff Jones in 1984. Bekić's theorem (called the "bisection lemma" in his notes) is that the simultaneous least fixed point can be separated into a series of least fixed points on and , in particular: Proof (Bekić):

Attributes	Values
rdfs:label	Bekić's theorem (en)
rdfs:comment	In computability theory, Bekić's theorem or Bekić's lemma is a theorem about fixed-points which allows splitting a mutual recursion into recursions on one variable at a time. It was created by Hans Bekić in 1969, and published posthumously in a book by Cliff Jones in 1984. Bekić's theorem (called the "bisection lemma" in his notes) is that the simultaneous least fixed point can be separated into a series of least fixed points on and , in particular: Proof (Bekić): (en)
dcterms:subject	Order theory Fixed-point theorems
Wikipage page ID	70253847 (xsd:integer)
Wikipage revision ID	1115436343 (xsd:integer)
Link from a Wikipage to another Wikipage	Product order Monotonic function Order theory Computability theory Complete lattice Complete partial order Fixed-point theorem Scott continuity Fixed-point theorems Automated theorem prover Kleene fixed-point theorem Knaster–Tarski theorem
sameAs	Bekić's theorem Bekić's theorem
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:Short_description
has abstract	In computability theory, Bekić's theorem or Bekić's lemma is a theorem about fixed-points which allows splitting a mutual recursion into recursions on one variable at a time. It was created by Hans Bekić in 1969, and published posthumously in a book by Cliff Jones in 1984. The theorem is set up as follows. Consider two operators and on pointed directed-complete partial orders and , continuous in each component. Then define the operator . This is monotone with respect to the product order (componentwise order). By the Kleene fixed-point theorem, it has a least fixed point , a pair in such that and . Bekić's theorem (called the "bisection lemma" in his notes) is that the simultaneous least fixed point can be separated into a series of least fixed points on and , in particular: Proof (Bekić): since it is the fixed point. Similarly . Hence is a fixed point of . Conversely, if there is a pre-fixed point with , then and ; hence and is the minimal fixed point. (en)
prov:wasDerivedFrom	wikipedia-en:Bekić's_theorem?oldid=1115436343&ns=0
page length (characters) of wiki page	5651 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Bekić's_theorem
is Link from a Wikipage to another Wikipage of	Bekić Fixed-point theorems Bekić's lemma
is Wikipage redirect of	Bekić's lemma
is Wikipage disambiguates of	Bekić
is foaf:primaryTopic of	wikipedia-en:Bekić's_theorem

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software