Remarks on applicative theories (Q2566067): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.apal.2005.05.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2014134602 / rank | |||
Normal rank | |||
Revision as of 01:34, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Remarks on applicative theories |
scientific article |
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
