Computability-Theoretic Complexity of Countable Structures
Work
Year: 2002
Type: article
Abstract: Computable model theory, also called effective or recursive model theory, studies algorithmic properties of mathematical structures, their relations, and isomorphisms. These properties can be describe... more
Source: Bulletin of Symbolic Logic
Author Valentina Harizanov
Institution George Washington University
Cites:
Cited by: 1
Related to: 10
FWCI:
Citation percentile (by year/subfield): 33.77
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green