Work

Some remarks concerning theories with recursively enumerable complements

Year: 1963

Type: article

Source: Journal of Symbolic Logic

DOI: 10.2307/2271337

Author: Alan Cobham

Language: English

Topic: Computability, Logic, AI Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2105081790

FWCI:

Cites: 2

Cited by: 2

Related to: 10