Paper Info
Title
Completeness Of Indexed Epsilon-Calculus
Abstract
Epsilon terms indexed by contexts were used by K. von Heusinger to represent definite and indefinite noun phrases as well as some other constructs of natural language. We provide a language and a complete first order system allowing to formalize basic aspects of this representation. The main axiom says that for any finite collection S-1, ..., S-k of distinct definable sets and elements a(1), ..., a(k) of these sets there exists a choice function assigning a(i) to S-i for all i less than or equal to k. We prove soundness and completeness theorems for this system S-epsiloni(fin).
Year
DOI
Venue
2003
10.1007/s00153-003-0170-6
ARCHIVE FOR MATHEMATICAL LOGIC
Keywords
DocType
Volume
epsilon calculus, finite choice, completeness
Journal
42
Issue
ISSN
Citations 
7
0933-5846
0
PageRank 
References 
Authors
0.34
2
2
Name
Order
Citations
PageRank
Grigori Mints123572.76
Darko Sarenac2162.54