Results 1  10
of
26,273
Independence and the finite submodel property
, 2007
"... We study a class C of ℵ0categorical simple structures such that every M in C has an uncomplicated forking behavior and where definable relations in M which do not cause forking are independent in a sense that is made precise. The SUrank of such M may be n for any natural number n> 0. The most w ..."
Abstract
 Add to MetaCart
relations which do not cause forking. A stable structure M belongs to C if and only if it is ℵ0categorical, ℵ0stable and every definable strictly minimal subset of M eq is indiscernible.
Submodels of Kripke Models
 Arch. Math. Logic
, 1998
"... A Kripke model K is a submodel of another Kripke modelMif K is obtained by restricting the set of nodes of M. In this paper we showthat the class of formulas of Intuitionistic Predicate Logic that is preserved under taking submodels of Kripke models is precisely the class of semipositive formulas. T ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
A Kripke model K is a submodel of another Kripke modelMif K is obtained by restricting the set of nodes of M. In this paper we showthat the class of formulas of Intuitionistic Predicate Logic that is preserved under taking submodels of Kripke models is precisely the class of semipositive formulas
Lumpability And Aggregation Of Markovian Submodels
, 1992
"... Hierarchical Markovian models are an adequate paradigm for the modeling of complex systems. For the analysis of such models decomposition and aggregation techniques are very important, since the Markov chain described by a complex model often has a size that exceeds the capacity of contemporary c ..."
Abstract
 Add to MetaCart
computer equipment by orders of a magnitude. A class of hierarchical Markovian models is defined and a new aggregation technique is presented, which allows the aggregation of isolated submodels and the substitution of submodels by less complex aggregates and often reduces the size of the underlying
ELEMENTARY SUBMODELS IN INFINITE COMBINATORICS
"... Abstract. We show that usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary submodels. We also present a new proof of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We show that usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary submodels. We also present a new proof
Elementary Submodels and Cardinal Functions
 Points=5000; fid=fopen('h:\Ib.dat','rt'); if(fid==(1)) end n=1; disp('Error in opening the given input data file'); while n~=(Points+1) a(n)=fscanf(fid,'%f',1); end n=n+1; % Calculation of the scaling function N=10; minx=min(a); maxx=max(a); mat1=[minx 1
, 1995
"... . The purpose of this article is to illustrate the use of elementary submodels in the theory of cardinal functions. 1. Introduction and preliminaries In this paper we prove many classical results on cardinal functions in the language of Skolem functions or elementary submodels. This language allows ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
allows the main ideas to emerge from what would otherwise be a mass of technical details. The key for such applications is the following weak form of the LowenheimSkolem theorem (see [W2] Proposition 1, [Ku] Theorem 7.8 and [Je] Lemma 11.2). Proposition 1. Let OE(x; v 0 ; :::; v n ) be a formula of set
Earth Submodel System (MESSy) submodel TRACER
, 2008
"... Abstract. The implementation of processes related to chemistry into Earth System Models and their coupling within such systems requires the consistent description of the chemical species involved. We provide a tool (written in Fortran95) to structure and manage information about constituents, herein ..."
Abstract
 Add to MetaCart
, hereinafter referred to as tracers, namely the Modular Earth Submodel System (MESSy) generic (i.e., infrastructure) submodel TRACER. With TRACER it is possible to define a multitude of tracer sets, depending on the spatiotemporal representation (i.e., the grid structure) of the model. The required
A Compositional Approach to Performance Modelling
, 1996
"... Performance modelling is concerned with the capture and analysis of the dynamic behaviour of computer and communication systems. The size and complexity of many modern systems result in large, complex models. A compositional approach decomposes the system into subsystems that are smaller and more ea ..."
Abstract

Cited by 746 (102 self)
 Add to MetaCart
Performance modelling is concerned with the capture and analysis of the dynamic behaviour of computer and communication systems. The size and complexity of many modern systems result in large, complex models. A compositional approach decomposes the system into subsystems that are smaller and more
Results 1  10
of
26,273