Recursive unary algebras and trees

Annals of Pure and Applied Logic 67 (1-3):213-268 (1994)
  Copy   BIBTEX

Abstract

A unary algebra is an algebraic system A = , where ƒ 0 ,…,ƒ n are unary operations on A and n ∈ ω. In the paper we develop the theory of effective unary algebras. We investigate well-known questions of constructive model theory with respect to the class of unary algebras. In the paper we construct unary algebras with a finite number of recursive isomorphism types. We give the notions of program, uniform, and algebraic dimensions of models, and then we investigate these notions on unary algebras. We find connections between algebraic and effective properties of r.e. representable unary algebras. We also deal with finitely generated r.e. unary algebras. We show the connections between trees and unary algebras. Our interests also concern recursive automorphisms groups, r.e. subalgebra and congruence lattices of effective unary algebras

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,497

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Boolean sentence algebras: Isomorphism constructions.William P. Hanf & Dale Myers - 1983 - Journal of Symbolic Logic 48 (2):329-338.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
Tennenbaum's Theorem and Unary Functions.Sakae Yaegasi - 2008 - Notre Dame Journal of Formal Logic 49 (2):177-183.
The decision problem for branching time logic.Yuri Gurevich & Saharon Shelah - 1985 - Journal of Symbolic Logic 50 (3):668-681.
Recursive and r.e. quotient Boolean algebras.John J. Thurber - 1994 - Archive for Mathematical Logic 33 (2):121-129.
$$\Pi^0_1$$ -Presentations of Algebras.Bakhadyr Khoussainov, Theodore Slaman & Pavel Semukhin - 2006 - Archive for Mathematical Logic 45 (6):769-781.
Complexity Ranks of Countable Models.Su Gao - 2007 - Notre Dame Journal of Formal Logic 48 (1):33-48.
Recursive Boolean algebras with recursive atoms.Jeffrey B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):595-616.
Recursive isomorphism types of recursive Boolean algebras.J. B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):572-594.

Analytics

Added to PP
2014-01-16

Downloads
8 (#1,325,033)

6 months
1 (#1,478,830)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Recursive isomorphism types of recursive Boolean algebras.J. B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):572-594.
A survey of lattices of re substructures.Anil Nerode & Jeffrey Remmel - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion theory. Providence, R.I.: American Mathematical Society. pp. 42--323.
Recursive Boolean algebras with recursive atoms.Jeffrey B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):595-616.

Add more references