Related papers: Stable theories and representation over sets
Let G be a finite group. The stable module category of G has been applied extensively in group representation theory. In particular, it has been used to great effect that it is a triangulated category which is compactly generated. Let H be…
In this paper we show that the intuitionistic fixed point theory FiX^{i}(X) over set theories T is a conservative extension of T if T can manipulate finite sequences and has the full foundation schema.
In the following paper we propose a model-theoretical way of comparing the "strength" of various truth theories which are conservative over PA. Let $\mathfrak{Th}$ denote the class of models of PA which admit an expansion to a model of…
G{\"o}del's second incompleteness theorem forbids to prove, in a given theory U, the consistency of many theories-in particular, of the theory U itself-as well as it forbids to prove the normalization property for these theories, since this…
lambda-good frame is for us a parallel of the class of models of a superstable theory. Our main line is to start with lambda-good^+ frame s, categorical in lambda, n-successful for n large enough and try to have parallel of stability theory…
We deal with consistency results for the existence of universal models in natural classes of models (more exactly--a somewhat weaker version). We apply a result on quite general family to T_feq and to the class of triangle-free graphs.
In this work, we establish a representation theorem for multivariable totally symmetric functions: a multisymmetric continuous function must be the composition of a continuous function and a set of generators of the multisymmetric…
A model of knowledge representation is described in which propositional facts and the relationships among them can be supported by other facts. The set of knowledge which can be supported is called the set of cognitive units, each having…
Promoting a theory with a finite number of terms into an effective field theory with an infinite number of terms worsens simplicity, predictability, falsifiability, and other attributes often favored in theory choice. However, the…
This paper provides a complete suite of axioms for a version of set theory that I call Explication. Explication borrows from the two most prominent existing systems of set theory. Explication starts with class variables. After several…
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
In this paper, we extend properties Going Up and Lying Over from ring theory to the general setting of congruence--modular equational classes, using the notion of prime congruence defined through the commutator. We show how these two…
We show that induction over $\Delta(\mathbb R)$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The…
This article is devoted to the tactical game theoretical interpretation of dialectics. Dialectical games are considered as abstractly as well as models of the internal dialogue and reflection. The models related to the representation theory…
We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for…
Since physical theories employ mathematical models to describe and predict physical phenomena, our knowledge depends on the models available to that end. To increase their scope we present a particular type of simplified models, serial…
Saturation is (mu,kappa)-transferable in T if and only if there is an expansion T_1 of T with |T_1| = |T| such that if M is a mu-saturated model of T_1 and |M| \geq kappa then the reduct M|L(T) is kappa-saturated. We characterize theories…
We study the sets of the infinite sentences constructible with a dictionary over a finite alphabet, from the viewpoint of descriptive set theory. Among other things, this gives some true co-analytic sets. The case where the dictionary is…
Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…
The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…