Keyword

computable model theory

Description: Computable model theory is a branch of mathematical logic that studies structures and their properties using computability and algorithmic methods.

Primary topic: Computability, Logic, AI Algorithms (72%)

Wikidata ID: wiki/Q5157266

OpenAlex ID: keywords/computable-model-theory

∏ 0 1 Classes and Degrees of Theories

1972 · Carl G. Jockusch, Robert I. Soare · Transactions of the American Mathematical Society · 113

Enumerations in computable structure theory

2005 · Sergey Goncharov, Valentina Harizanov, et al. · Annals of Pure and Applied Logic · 100

PDF

Autostability and computable families of constructivizations

1975 · S. S. Goncharov · Algebra and Logic · 84

Comparing Classes of Finite Structures

2004 · W. Calvert, D. Cummins, et al. · Algebra and Logic · 72

Pairs of recursive structures

1990 · C.J. Ash, J.F. Knight · Annals of Pure and Applied Logic · 70

Degrees of Categoricity and the Hyperarithmetic Hierarchy

2013 · Barbara F. Csima, Johanna N. Y. Franklin, et al. · Notre Dame Journal of Formal Logic · 63

PDF

Universal Computably Enumerable Equivalence Relations

2014 · URI ANDREWS, STEFFEN LEMPP, et al. · Journal of Symbolic Logic · 60

Computably Isometric Spaces

2013 · Alexander G. Melnikov · Journal of Symbolic Logic · 59

Turing computable embeddings

2007 · Julia F. Knight, Sara Miller, et al. · Journal of Symbolic Logic · 59

Effective categoricity of equivalence structures

2005 · Wesley Calvert, Douglas Cenzer, et al. · Annals of Pure and Applied Logic · 59

PDF

Non-Classical Logics, Model Theory, And Computability

1977 · Studies in logic and the foundations of mathematics · 58

Computable model theory

2014 · Ekaterina B. Fokina, Valentina Harizanov, et al. · Cambridge University Press eBooks · 55

Notes on the Jump of a Structure

2009 · Antonio Montalbán · Lecture notes in computer science · 49

Recursion theory on fields and abstract dependence

1980 · G. Metakides, A. Nerode · Journal of Algebra · 49

Computable categoricity of trees of finite height

2005 · Steffen Lempp, Charles McCoy, et al. · Journal of Symbolic Logic · 46

Hyperarithmetical quantifiers

1960 · C. Spector · Fundamenta Mathematicae · 46

PDF

Computable Structure Theory

2021 · Antonio Montalbán · Cambridge University Press eBooks · 44

d-computable categoricity for algebraic fields

2009 · Russell Miller · Journal of Symbolic Logic · 44

A Computable Functor From Graphs to Fields

2018 · RUSSELL MILLER, BJORN POONEN, et al. · Journal of Symbolic Logic · 43

PDF

Computable Functors and Effective Interpretability

2017 · MATTHEW HARRISON-TRAINOR, ALEXANDER MELNIKOV, et al. · Journal of Symbolic Logic · 43

PDF

Computably categorical structures and expansions by constants

1999 · Peter Cholak, Sergey Goncharov, et al. · Journal of Symbolic Logic · 37

Chapter 1 Pure computable model theory

1998 · Valentina S. Harizanov · Studies in logic and the foundations of mathematics · 37

Ideals in computable rings

2007 · Rodney G. Downey, Steffen Lempp, et al. · Journal of Algebra · 35

PDF

The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility

2012 · Samuel Coskey, Joel David Hamkins, et al. · Computability · 33

PDF

The isomorphism problem for computable Abelian p-groups of bounded length

2005 · Wesley Calvert · Journal of Symbolic Logic · 32

PDF

Works count: 621

Citation count: 3,874