Remarks on applicative theories (Q2566067)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2207223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Remarks on applicative theories |
scientific article; zbMATH DE number 2207223 |
Statements
Remarks on applicative theories (English)
0 references
22 September 2005
0 references
\(\text{TON}\) is a first-order predicate calculus with, as basic well-formed formulas, the equations of strong combinatory logic. In addition, basic arithmetical functions over \(N\) and definition by cases over \(\text{IN}\), using the same equality, are assumed. The author shows that certain models of the extended untyped \(\lambda\)-calculus are also models of \(\text{ TON}\) together with a number of interesting and surprising extra uniformity, reflection, enumeration and choice principles. Similar results are obtained for some variants and extensions of \(\text{ TON}\).
0 references
first-order predicate calculus
0 references
combinatory logic
0 references
untyped \(\lambda\)-calculus
0 references
0 references
0 references
0 references
0.8266951
0 references
0.82659626
0 references
0.81823325
0 references
0 references
0 references
