Sciweavers

66 search results - page 13 / 14
» Closed fragments of provability logics of constructive theor...
Sort
View
ECAI
2000
Springer
13 years 11 months ago
An Embedding of ConGolog in 3APL
Several high-level programming languages for programming agents and robots have been proposed in recent years. Each of these languages has its own features and merits. It is still...
Koen V. Hindriks, Yves Lespérance, Hector J...
IFSA
2003
Springer
89views Fuzzy Logic» more  IFSA 2003»
14 years 16 days ago
Lattice Fuzzy Signal Operators and Generalized Image Gradients
In this paper we use concepts from the lattice-based theory of morphological operators and fuzzy sets to develop generalized lattice image operators that are nonlinear convolutions...
Petros Maragos, Vassilis Tzouvaras, Giorgos B. Sta...
NDJFL
1998
105views more  NDJFL 1998»
13 years 7 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau
CCA
2009
Springer
13 years 11 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi
ICFP
2003
ACM
14 years 7 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay