Computable isomorphism
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
- Arch. Math. Log.
- 2016
The computable dimension of a structure counts the number of computable copies up to computable isomorphism. In this paper, we… (More)
Is this relevant?
2015
2015
- Math. Comput.
- 2015
Arithmetic Kleinian groups are arithmetic lattices in PSL2(C). We present an algorithm that, given such a group Γ, returns a… (More)
Is this relevant?
2011
2011
- 2011
Calvert [3], [4], [5] calculated the complexity of the computable isomorphism problem for a number of familiar classes of… (More)
Is this relevant?
2007
2007
- J. Symb. Log.
- 2007
In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not א0… (More)
Is this relevant?
2005
2005
- Discrete Applied Mathematics
- 2005
In this paper we examine the hard problems underlying asymmetric pairings, their precise relationships and how they affect a… (More)
Is this relevant?
2005
2005
- 2005
In this paper we examine the underlying hard problems in asymmetric pairings, their precise relationships and how they affect a… (More)
Is this relevant?
2005
2005
- IJAC
- 2005
Computably enumerable algebras are the ones whose positive atomic diagrams are computably enumerable. Computable algebras are the… (More)
Is this relevant?
Review
2000
Review
2000
- Bulletin of Symbolic Logic
- 2000
§0. Introduction. There has been increasing interest over the last few decades in the study of the effective content of… (More)
Is this relevant?
1997
1997
- Notre Dame Journal of Formal Logic
- 1997
Fine and Kripke extended S5, S4, S4.2 and such to produce propositionally quantified systems S5π+, S4π+, S4.2π+: given a Kripke… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
- STOC
- 1989
Berman and Hartmanis [BH77] conjectured that there is a polynomial-time computable isomorphism between any two languages m… (More)
Is this relevant?