Sciweavers

479 search results - page 14 / 96
» A quantified logic of evidence
Sort
View
JSYML
2008
86views more  JSYML 2008»
13 years 8 months ago
On Skolemization in constructive theories
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting ...
Matthias Baaz, Rosalie Iemhoff
EMNLP
2009
13 years 5 months ago
Quantifier Scope Disambiguation Using Extracted Pragmatic Knowledge: Preliminary Results
It is well known that pragmatic knowledge is useful and necessary in many difficult language processing tasks, but because this knowledge is difficult to acquire and process autom...
Prakash Srinivasan, Alexander Yates
NDJFL
2010
13 years 2 months ago
Numerical Abstraction via the Frege Quantifier
l Abstraction via the Frege Quantifier G. Aldo Antonelli Abstract This paper presents a formalization of first-order aritharacterizing the natural numbers as abstracta of the equin...
Gian Aldo Antonelli
CADE
2006
Springer
14 years 8 months ago
Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers
Propositional canonical Gentzen-type systems, introduced in [1], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Anna Zamansky, Arnon Avron
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
14 years 8 months ago
Random graphs and the parity quantifier
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
Phokion G. Kolaitis, Swastik Kopparty