Add to ORKGWe build an ℵ1-categorical but not ℵ0-categorical theory whose only computably presentable model is the saturated one. As a tool, we introduce a notion related to limitwise monotonic functions
We employ the Hrushovski Amalgamation Construction to generate strongly minimal examples of interest...
The 1970s saw the appearance and development in categoricity theory of a tendency to focus on the st...
Modern model theory began with Morley's categoricity theorem: A countable first-order theory that ha...
© 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. We extend the limitwise monotonicity notion to th...
It is proved that each strongly η-representable degree contains a set that is a range of values for ...
In this paper, we describe the technique of extremely monotonic functions in the theory of computabl...
In this paper, we study effective monotonic approximations of sets and sequences of sets. We show th...
© 2017, Pleiades Publishing, Ltd.We find new sufficient conditions for the existence of a 0’-limitwi...
In the early days of the development of model theory it was considered natural and was certainly ben...
AbstractThe results in this paper are in a context of abstract elementary classes identified by Shel...
In this paper I propose a new approach to the foundation of mathematics: non-monotonic set theory. I...
This thesis looks at characterising countably infinitely categorical theories. That is theories for ...
In this paper I propose a new approach to the foundation of mathematics: non-monotonic set theory. I...
© 2014, Pleiades Publishing, Ltd. In the paper we study the maximal and minimal objects under Σ-redu...
Proc. ALT\u2790, 339-354; New Generation Computing 8, 371-384, 1991A formal system is a finite set o...
We employ the Hrushovski Amalgamation Construction to generate strongly minimal examples of interest...
The 1970s saw the appearance and development in categoricity theory of a tendency to focus on the st...
Modern model theory began with Morley's categoricity theorem: A countable first-order theory that ha...
© 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. We extend the limitwise monotonicity notion to th...
It is proved that each strongly η-representable degree contains a set that is a range of values for ...
In this paper, we describe the technique of extremely monotonic functions in the theory of computabl...
In this paper, we study effective monotonic approximations of sets and sequences of sets. We show th...
© 2017, Pleiades Publishing, Ltd.We find new sufficient conditions for the existence of a 0’-limitwi...
In the early days of the development of model theory it was considered natural and was certainly ben...
AbstractThe results in this paper are in a context of abstract elementary classes identified by Shel...
In this paper I propose a new approach to the foundation of mathematics: non-monotonic set theory. I...
This thesis looks at characterising countably infinitely categorical theories. That is theories for ...
In this paper I propose a new approach to the foundation of mathematics: non-monotonic set theory. I...
© 2014, Pleiades Publishing, Ltd. In the paper we study the maximal and minimal objects under Σ-redu...
Proc. ALT\u2790, 339-354; New Generation Computing 8, 371-384, 1991A formal system is a finite set o...
We employ the Hrushovski Amalgamation Construction to generate strongly minimal examples of interest...
The 1970s saw the appearance and development in categoricity theory of a tendency to focus on the st...
Modern model theory began with Morley's categoricity theorem: A countable first-order theory that ha...