Game semantics for first-order logic

Details Game semantics for first-order logic Game semantics for first-order logic

2010-09-22

arxiv.org/abs/1009.4400v2

LMCS 6 (4:3) 2010

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-6(4:3)2010

We refine HO/N game semantics with an additional notion of pointer
(mu-pointers) and extend it to first-order classical logic with completeness
results. We use a Church style extension of Parigot's lambda-mu-calculus to
represent proofs of first-order classical logic. We present some relations with
Krivine's classical realizability and applications to type isomorphisms.

Affiliated with

Also associated with

No associations

Rating

Game semantics for first-order logic 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 Game semantics for first-order logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Game semantics for first-order logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-638333