Add to ORKGAbstract: A criterion is obtained for existence of two isomorphic but not hyperarithmetically isomorphic tuples in a hyperarithmetical model. This criterion is used to show that such a situation occurs in the models of well-known classes
We investigate the problem of type isomorphisms in a programming language with higher-order referenc...
AbstractWe develop the method of iterated ultrapower representation to provide a unified and perspic...
AbstractIn this note we characterize isomorphism between two hypergraphs by means of equicardinality...
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic ...
AbstractWe solve the isomorphism problem for certain classes of unary automatic structures: unary au...
Automatic structures are finitely presented structures where the universe and all relations can be r...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
Several new undecidability results on isomorphism problems for automatic structures are shown: (i) T...
The calculation of the countable model automorphism number for uncountable categorical theories is t...
Abstract. We investigate the problem of type isomorphisms in the presence of higher-order references...
AbstractWe study models ofHST (a nonstandard set theory which includes, in particular, the Replaceme...
The enumeration of finite models of first order logic formulas is an indispensable tool in computati...
In this paper we provide an implementable formal algorithm for knowledge bases equivalence verificat...
This paper investigates the concepts of relational homomorphisms and their closely associated concep...
© Springer Nature Switzerland AG 2019. A standard tool for the classifying computability-theoretic c...
We investigate the problem of type isomorphisms in a programming language with higher-order referenc...
AbstractWe develop the method of iterated ultrapower representation to provide a unified and perspic...
AbstractIn this note we characterize isomorphism between two hypergraphs by means of equicardinality...
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic ...
AbstractWe solve the isomorphism problem for certain classes of unary automatic structures: unary au...
Automatic structures are finitely presented structures where the universe and all relations can be r...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
Several new undecidability results on isomorphism problems for automatic structures are shown: (i) T...
The calculation of the countable model automorphism number for uncountable categorical theories is t...
Abstract. We investigate the problem of type isomorphisms in the presence of higher-order references...
AbstractWe study models ofHST (a nonstandard set theory which includes, in particular, the Replaceme...
The enumeration of finite models of first order logic formulas is an indispensable tool in computati...
In this paper we provide an implementable formal algorithm for knowledge bases equivalence verificat...
This paper investigates the concepts of relational homomorphisms and their closely associated concep...
© Springer Nature Switzerland AG 2019. A standard tool for the classifying computability-theoretic c...
We investigate the problem of type isomorphisms in a programming language with higher-order referenc...
AbstractWe develop the method of iterated ultrapower representation to provide a unified and perspic...
AbstractIn this note we characterize isomorphism between two hypergraphs by means of equicardinality...