2529 search results - page 81 / 506 » The Logical Structure of Binding |
APAL
2006
14 years 10 months ago
2006
We show that--unlike products of `transitive' modal logics which are usually undecidable-their `expanding domain' relativisations can be decidable, though not in primiti...
MFCS
2000
Springer
15 years 1 months ago
2000
Springer
The probability of a property on the collection of all finite relational structures is the limit as
ENTCS
2008
14 years 10 months ago
2008
This paper considers QLtl, a quantitative analagon of Ltl and presents algorithms for model checking QLtl over quantitative versions of Kripke structures and Markov chains.
CSL
2009
Springer
15 years 1 months ago
2009
Springer
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
LOGCOM
2010
14 years 4 months ago
2010
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...