Completeness proof of functional logic, a formalism with variable-binding nonlogical symbols

Details Completeness proof of functional logic, a formalism with variable-binding nonlogical symbols Completeness proof of functional logic, a formalism with variable-binding nonlogical symbols

1995-03-13

arxiv.org/abs/math/9503206v1

Mathematics

Logic

Scientific paper

We know extensions of first order logic by quantifiers of the kind "there are uncountable many ...", "most ..." with new axioms and appropriate semantics. Related are operations such as "set of x, such that ...", Hilbert's $\epsilon$-operator, Churche's $\lambda$-notation, minimization and similar ones, which also bind a variable within some expression, the meaning of which is however partly defined by a translation into the language of first order logic. In this paper a generalization is presented that comprises arbitrary variable-binding symbols as non-logical operations. The axiomatic extension is determined by new equality-axioms; models assign functionals to variable-binding symbols. The completeness of this system of the so called "Functional Logic of 1st Order" will be proved.

Affiliated with

Also associated with

No associations

Rating

Completeness proof of functional logic, a formalism with variable-binding nonlogical symbols does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Completeness proof of functional logic, a formalism with variable-binding nonlogical symbols, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Completeness proof of functional logic, a formalism with variable-binding nonlogical symbols will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-488896