FUIN
2010
13 years 9 months ago
2010
We study 0-1 laws for extensions of first-order logic by Lindstr
AMSTERDAM
2009
13 years 10 months ago
2009
The paper presents a study examining the role of working memory in quantifier verification. We created situations similar to the span task to compare numerical quantifiers of low a...
APAL
2005
14 years 10 days ago
2005
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
CSR
2008
Springer
14 years 15 days ago
2008
Springer
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...
COGSCI
2010
14 years 16 days ago
2010
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same pr...
AGI
2008
14 years 1 months ago
2008
: Indefinite probabilities are a novel technique for quantifying uncertainty, which were created as part of the PLN (Probabilistic Logic Networks) logical inference engine, which i...