Collapsing Partial Combinatory Algebras

Partial combinatory algebras occur regularly in the literature as a framework for an abstract formulation of computation theory or recursion theory. In this paper we develop some general theory concerning homomorphic images (or collapses) of pca''s, obtained by identification of elements in a pca. We establish several facts concerning final collapses (maximal identification of elements). `En passant'' we find another example of a pca that cannot be extended to a total one.

[1]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..

[2]  M. Beeson.  Foundations of Constructive Mathematics , 1985 .

[3]  J. Baeten,et al.  Omega can be anything it should not be , 1979 .

[4]  Andrea Asperti,et al.  Effective Applicative Structures , 1995, Category Theory and Computer Science.

[5]  Peter Burmeister,et al.  Partial algebras—survey of a unifying approach towards a two-valued model theory for partial algebras , 1982 .

[6]  Benedetto Intrigila,et al.  Some New Results on Easy lambda-Terms , 1993, Theor. Comput. Sci..

[7]  H. R. Strong.  Algebraically generalized recursive function theory , 1968 .

[8]  Desmond Fearnley-Sander,et al.  Universal Algebra , 1982 .

[9]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[10]  Ingemarie Bethke,et al.  On the existence of extensional partial combinatory algebras , 1987, Journal of Symbolic Logic.

[11]  Giuseppe Jacopini,et al.  A condition for identifying two elements of whatever model of combinatory logic , 1975, Lambda-Calculus and Computer Science Theory.

[12]  Klaas Pieter Hart,et al.  Open Problems , 2022, Dimension Groups and Dynamical Systems.

[13]  J. Roger Hindley,et al.  Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

[14]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[15]  E. Engeler.  Algebras and combinators , 1981 .

[16]  A. Troelstra,et al.  Constructivism in Mathematics: An Introduction , 1988 .

[17]  Thomas Streicher,et al.  Semantics of type theory - correctness, completeness and independence results , 1991, Progress in theoretical computer science.

[18]  Inge Bethke,et al.  Finite Type Structures within Combinatory Algebras , 1991, Ann. Pure Appl. Log..

[19]  Erwin Emgeler.  Algebras and combinators , 1979 .

[20]  J. Baeten,et al.  Ω Can be anything it should not be , 1979 .

[21]  Eric G. Wagner.  Uniformly reflexive structures: On the nature of gödelizations and relative computability , 1969 .