Sciweavers

63 search results - page 12 / 13
» The Bounded Axiom A Forcing Axiom
Sort
View
JSYML
2007
85views more  JSYML 2007»
13 years 5 months ago
Substructural fuzzy logics
Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0, 1]. In this paper, we introduce Un...
George Metcalfe, Franco Montagna
MLQ
1998
126views more  MLQ 1998»
13 years 5 months ago
Reverse Mathematics and Recursive Graph Theory
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theor...
William I. Gasarch, Jeffry L. Hirst
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 11 days ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
GIS
2008
ACM
14 years 6 months ago
Geospatial information integration based on the conceptualization of geographic domain
Geospatial information integration is not a trivial task. An integrated view must be able to describe various heterogeneous data sources and its interrelation to obtain shared con...
Miguel Torres, Serguei Levachkine, Rolando Quinter...
IICAI
2007
13 years 7 months ago
Logics for Action
Logics of action, for reasoning about the effects of state change, and logics of belief, accounting for belief revision and update, have much in common. Furthermore, we may underta...
Michael P. Fourman