Arithmetic based on the Church numerals in illative combinatory logic (Q1115414): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Various systems of set theory based on combinatory logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional and predicate calculus based on combinatory logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weak absolute consistency proof for some systems of illative combinatory logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one axiom set theory based on higher order predicate calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3752369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Positive Integers in Formal Logic. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof by cases in formal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inconsistency of certain formal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the Theory of Optimal Control. A General Procedure for the Computation of Switching Manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical logic without variables. I / rank
 
Normal rank

Latest revision as of 13:57, 19 June 2024

scientific article
Language Label Description Also known as
English
Arithmetic based on the Church numerals in illative combinatory logic
scientific article

    Statements

    Arithmetic based on the Church numerals in illative combinatory logic (English)
    0 references
    0 references
    1988
    0 references
    Arithmetic was first developed within lambda calculus by Rosser and Kleene in a system of Church, which was later shown to be inconsistent. Some of this work could be rescued but not within the framework of predicate logic. The present paper has a new definition of equality which allows not only the Church numerals to be used, but also the set of all such to be defined, within the author's system of illative combinatory logic as outlined in Arch. Math. Logik Grundlagenforsch. 23, 99-107 (1983; Zbl 0537.03010). All the Peano-type axioms of Mendelson except one can be proved directly from this. A rather weak extra axiom suffices to derive the properties of a predecessor relation, which allow for the proof of the remaining Peano axiom.
    0 references
    0 references
    Arithmetic
    0 references
    Church numerals
    0 references
    illative combinatory logic
    0 references
    Peano-type axioms of Mendelson
    0 references
    predecessor relation
    0 references
    0 references