Sciweavers

3353 search results - page 666 / 671
» Laver and set theory
Sort
View
JSYML
2007
100views more  JSYML 2007»
13 years 10 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
ASE
2002
160views more  ASE 2002»
13 years 10 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
CMOT
2004
83views more  CMOT 2004»
13 years 10 months ago
Networks, Fields and Organizations: Micro-Dynamics, Scale and Cohesive Embeddings
Social action is situated in fields that are simultaneously composed of interpersonal ties and relations among organizations, which are both usefully characterized as social netwo...
Douglas R. White, Jason Owen-Smith, James Moody, W...
CORR
2004
Springer
100views Education» more  CORR 2004»
13 years 10 months ago
On Spatial Conjunction as Second-Order Logic
Abstract. Spatial conjunction is a powerful construct for reasoning about dynamically allocated data structures, as well as concurrent, distributed and mobile computation. While re...
Viktor Kuncak, Martin C. Rinard
AMAI
2000
Springer
13 years 10 months ago
The logic of events
An event space is a set of instantaneous events that vary both in time and specificity. The concept of an event space provides a foundation for a logical--i.e., modular and open-a...
Glenn Shafer, Peter R. Gillett, Richard B. Scherl