Abstraction in Fitch's Basic Logic

DOI10.1080/01445340.2011.648312zbMath1304.03045OpenAlexW2000963163WikidataQ58543104 ScholiaQ58543104MaRDI QIDQ5497106

Eric T. Updike

Publication date: 3 February 2015

Published in: History and Philosophy of Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01445340.2011.648312

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computer implication and the Curry paradox
• Stability and paradox in algorithmic logic
• Logical frameworks for truth and abstraction. An axiomatic study
• Abstraction in algorithmic logic
• Combinatory logic. Vol. II
• Notions of Invariance for Abstraction Principles
• Constructive definition of certain analytic sets of numbers
• Toward useful type-free theories. I
• Correction to a definition of negation
• Russell's 1903 - 1905 Anticipation of the Lambda Calculus
• The Russell Archives: Some new light on Russell's logicism
• The anatytic conception of truth and the foundations of arithmetic
• The system CΔ of combinatory logic
• A system of formal logic without an analogue to the curry W operator
• The Heine-Borel theorem in extended basic logic
• A demonstrably consistent mathematics—Part I
• A complete theory of natural, rational, and real numbers
• A demonstrably consistent mathematics—Part II
• A finitary metalanguage for extended basic logic
• A simplification of basic logic
• A basic logic
• Representations of calculi
• A minimum calculus for logic

This page was built for publication: Abstraction in Fitch's Basic Logic