Assume p∗ is a meager type in a superstable theory T . We investigate definability properties of p∗-closure. We prove that if T has < 2א0 countable models then the multiplicity rank M of every type p is finite. We improve Saffe’s conjecture. 0. Introduction. Throughout the paper, T is a superstable theory in a countable language L, and we work within a monster model C = C of T . The general ref...

We give a Natural Deduction formulation of an adaptation of Gödel’s functional (Dialectica) interpretation to the extraction of (more) efficient programs from (classical) proofs. We adapt Jørgensen’s formulation of pure Dialectica translation by eliminating his “Contraction Lemma” and allowing free variables in the extracted terms (which is more suitable in a Natural Deduction setting). We also...

1 Introduction The-calculus and its typed versions are important tools for studying most fundamental computation and deduction paradigms. However, the non-trivial nature of substitution, as used in the deenition of-reduction notably, has spurred the design of various rst-order languages representing-terms,-reduction and-conversion, where computation is simple, rst-order rewriting, and substitut...

this paper proposes an alternative approach for efficiency analysis when a set of dmus uses interval scale variables in the productive process. to test the influence of these variables, we present a general approach of deriving dea models to deal with the variables. we investigate a number of performance measures with unrestricted-in-sign interval and/or interval scale variables.