A weak absolute consistency proof for some systems of illative combinatory logic (Q3043111): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Illative combinatory logic without equality as a primitive predicate / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Progress report on generalized functionality / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatory logic. Vol. II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some consistency proofs and a characterization of inconsistency proofs in illative combinatory logic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3752369 / rank | |||
Normal rank | |||
Latest revision as of 11:15, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A weak absolute consistency proof for some systems of illative combinatory logic |
scientific article |
Statements
A weak absolute consistency proof for some systems of illative combinatory logic (English)
0 references
1983
0 references
illative combinatory logic
0 references
lambda calculus
0 references
weak consistency
0 references
strong consistency
0 references
0 references
