Sciweavers

1101 search results - page 217 / 221
» Forcing in proof theory
Sort
View
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 7 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
JLP
2006
98views more  JLP 2006»
13 years 7 months ago
Partiality I: Embedding relation algebras
As long as no cooperation between processes is supposed to take place, one may consider them separately and need not ask for the progress of the respective other processes. If a c...
Gunther Schmidt
SLOGICA
2008
97views more  SLOGICA 2008»
13 years 7 months ago
A Generic Framework for Adaptive Vague Logics
A generic format for adaptive vague logics is presented. The concrete adaptive vague logics based on this format are able to (1) identify sentences as vague or non-vague in the con...
Peter Verdée, Stephan van der Waart van Gul...
TCS
2008
13 years 7 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
JSYML
2007
100views more  JSYML 2007»
13 years 7 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