Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Completeness of indexed ε-calculus

Completeness of indexed ε-calculus 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≤k. We prove soundness and completeness theorems for this system S ε i fin . http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Archive for Mathematical Logic Springer Journals

Completeness of indexed ε-calculus

Archive for Mathematical Logic , Volume 42 (7) – May 16, 2003

Loading next page...
 
/lp/springer-journals/completeness-of-indexed-calculus-YPiA5IjWF4

References (5)

Publisher
Springer Journals
Copyright
Copyright © 2003 by Springer-Verlag Berlin Heidelberg
Subject
Mathematics
ISSN
0933-5846
eISSN
1432-0665
DOI
10.1007/s00153-003-0170-6
Publisher site
See Article on Publisher Site

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≤k. We prove soundness and completeness theorems for this system S ε i fin .

Journal

Archive for Mathematical LogicSpringer Journals

Published: May 16, 2003

There are no references for this article.