Fixed points on abstract structures without the equality test

In this paper we present a study of definability properties of fixed points of effective operators on abstract structures without the equality test. In particular we prove that Gandy theorem holds for abstract structures. This provides a useful tool for dealing with recursive definitions using Sigma-formulas. One of the applications of Gandy theorem in the case of the reals without the equality test is that it allows us to define universal Sigma-predicates. It leads to a topological characterisation of Sigma-relations on |R.

[1]  Yiannis N. Moschovakis,et al.  Abstract first order computability. II , 1969 .

[2]  Peter G. Hinman,et al.  Recursion on Abstract Structures , 1999, Handbook of Computability Theory.

[3]  B. Dahn.  Admissible sets and structures , 1978 .

[4]  Antonio di Nola,et al.  Compact representations of BL-algebras , 2003, Arch. Math. Log..

[5]  J. V. Tucker,et al.  Computable functions and semicomputable sets on many-sorted algebras , 2001, Logic in Computer Science.

[6]  Frank D. Valencia,et al.  On the Expressive Power of Concurrent Constraint Programming Languages , 2002 .

[7]  K. Larsen,et al.  Regular Languages Definable by Lindström Quantifiers (Preliminary Version) , 2002 .

[8]  A. Grzegorczyk.  On the definitions of computable real continuous functions , 1957 .

[9]  Zoltán Ésik,et al.  An Extension Theorem with an Application to Formal Tree Series , 2002 .

[10]  Zoltán Ésik,et al.  An Extension Theorem with an Application to Formal Tree Series , 2002, J. Autom. Lang. Comb..

[11]  Hans Hüttel,et al.  Deciding Framed Bisimilarity , 2003, INFINITY.

[12]  Ker-I Ko,et al.  Computational Complexity of Real Functions , 1982, Theor. Comput. Sci..

[13]  Oleg V. Kudinov,et al.  Semantic Characterisations of Second-Order Computability over the Real Numbers , 2001, CSL.

[14]  Yiannis N. Moschovakis,et al.  Elementary induction on abstract structures , 1974 .

[15]  Marian Boykan Pour-El,et al.  Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.

[16]  Johann A. Makowsky,et al.  Query Languages for Hierarchic Databases , 1992, Inf. Comput..

[17]  Andreas Blass,et al.  Background, Reserve, and Gandy Machines , 2000, CSL.

[18]  Saharon Shelah,et al.  Choiceless Polynomial Time , 1997, Ann. Pure Appl. Log..

[19]  Oleg V. Kudinov,et al.  Characteristic Properties of Majorant-Computability over the Reals , 1998, CSL.

[20]  J. Shepherdson.  Computational Complexity of Real Functions , 1985 .