UCLA Logic Colloquium, April 17

Article View: la.seminars

Article #14

#14

From: H. Enderton
Date: Thu, 09 Apr 1992 16:15

26 lines
1456 bytes

                    UCLA LOGIC COLLOQUIUM
                    Friday, April 17, 1992
                           4:00 p.m.
                   Mathematical Sciences 6627
                             UCLA
                                                  
                       ALEXANDRA SOSKOVA
                      (Sofia University)

               "EFFECTIVE FIRST ORDER STRUCTURES"

		           Abstract

In our talk we shall discuss the notion of abstract data type from a
recursion theoretical point of view.  Our results are mainly
concentrated on the definition and on the characterization of the
effective abstract data types.

The main tool is a notion of computability over many-sorted first order
structure which puts together two non-deterministic notions of
computability -- search computability of Moschovakis and computability
of Friedman and Shepherdson.

The relationships between some special properties of the class of the
computable functions in an abstract structure and the existence of some
special enumerations of it will be presented.

Technical Details

Message-ID: <1992Apr9.161522.18949@math.ucla.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!usc!elroy.jpl.nasa.gov!ucla-cs!ucla-ma!sonia!hbe

Show Full Headers

Complete Article Headers

Newsgroups: la.seminars
Path: arc1-ca.pugleaf.net!sparky!uunet!usc!elroy.jpl.nasa.gov!ucla-cs!ucla-ma!sonia!hbe
From: hbe@sonia.math.ucla.edu (H. Enderton)
Subject: UCLA Logic Colloquium, April 17
Message-ID: <1992Apr9.161522.18949@math.ucla.edu>
Sender: news@math.ucla.edu
Organization: UCLA Mathematics Department
Distribution: la
Date: Thu, 9 Apr 92 16:15:22 GMT
Lines: 27