Sciweavers

14 search results - page 1 / 3
» Pairs, sets and sequences in first-order theories
Sort
View
AML
2008
53views more  AML 2008»
13 years 11 months ago
Pairs, sets and sequences in first-order theories
In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. Firs...
Albert Visser
BSL
2005
106views more  BSL 2005»
13 years 11 months ago
Compactness and independence in non first order frameworks
This communication deals with positive model theory, a non first order model theoretic setting which preserves compactness at the cost of giving up negation. Positive model theory ...
Itay Ben-Yaacov
JSYML
2008
105views more  JSYML 2008»
13 years 11 months ago
Finite state automata and monadic definability of singular cardinals
We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formu...
Itay Neeman
JSYML
2007
100views more  JSYML 2007»
13 years 11 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
IANDC
2010
115views more  IANDC 2010»
13 years 8 months ago
18th International Conference on Concurrency Theory
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
Luís Caires, Vasco Thudichum Vasconcelos