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

Learn More →

Consistency of a λ-theory withn-tuples and easy term

Consistency of a λ-theory withn-tuples and easy term We give here a model-theoretical solution to the problem, raised by J.L: Krivine, of the consistency of λβη+U(G)+Ω=t, wheret is an arbitrary λ-term,G an arbitrary finite group of order, sayn, andU(G) the theory which expresses the existence of a surjectiven-tuple notion, such that each element ofG behaves simultaneously as a permutation of the components of then-tuple and as an automorphism of the model. This provides in particular a semantic proof of the βη-easiness of the λ-term Ω. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Archive for Mathematical Logic Springer Journals

Consistency of a λ-theory withn-tuples and easy term

Jiang, Ying
Archive for Mathematical Logic , Volume 34 (2) – Feb 21, 2005
Download PDF
18 pages

Loading next page...
 
/lp/springer-journals/consistency-of-a-theory-withn-tuples-and-easy-term-pCeagTcsla

References (13)

Publisher
Springer Journals
Copyright
Copyright © 1995 by Springer-Verlag
Subject
Mathematics; Mathematical Logic and Foundations; Mathematics, general; Algebra
ISSN
0933-5846
eISSN
1432-0665
DOI
10.1007/BF01270389
Publisher site
See Article on Publisher Site

Abstract

We give here a model-theoretical solution to the problem, raised by J.L: Krivine, of the consistency of λβη+U(G)+Ω=t, wheret is an arbitrary λ-term,G an arbitrary finite group of order, sayn, andU(G) the theory which expresses the existence of a surjectiven-tuple notion, such that each element ofG behaves simultaneously as a permutation of the components of then-tuple and as an automorphism of the model. This provides in particular a semantic proof of the βη-easiness of the λ-term Ω.

Journal

Archive for Mathematical Logic – Springer Journals

Published: Feb 21, 2005

There are no references for this article.