On the definition of substitution, replacement and allied notions in a abstract formal system

Revue Philosophique De Louvain 50 (26):251-269 (1952)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.3406/phlou.1952.4394

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,283

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Organism, community, and the "substitution problem".Eric Katz - 1985 - Environmental Ethics 7 (3):241-256.
Translation and Interpretation in Ibn Taymiyya's Logical Definition.Sobhi Rayan - 2011 - British Journal for the History of Philosophy 19 (6):1047 - 1065.
Review: Haskell B. Curry, The System LD; Haskell B. Curry, On the Definition of Negation by a Fixed Proposition in Inferential Calculus. [REVIEW]Paul Bernays - 1953 - Journal of Symbolic Logic 18 (3):266-268.
The Epistemological Functions of Symbolization in Leibniz’s Universal Characteristic.Christian Leduc - 2014 - Foundations of Science 19 (1):53-68.
Meinong's Analysis of Lying.Ursula Zegleń - 1995 - Grazer Philosophische Studien 50 (1):549-557.
A Uniform Logic of Information Dynamics.Wesley H. Holliday, Tomohiro Hoshi & Thomas F. Icard - 2012 - In Thomas Bolander, Torben Braüner, Silvio Ghilardi & Lawrence Moss (eds.), Advances in Modal Logic 9. College Publications. pp. 348-367.
Epsilon substitution for transfinite induction.Henry Towsner - 2005 - Archive for Mathematical Logic 44 (4):397-412.
Un refinamiento del concepto de sistema axiomático.José Alfredo Amor - 2003 - Signos Filosóficos 6 (11):121-140.
Language, metalanguage, and formal system.Haskell B. Curry - 1950 - Philosophical Review 59 (3):346-353.
Essence and modality.Edward N. Zalta - 2006 - Mind 115 (459):659-693.
Consequence Mining: Constans Versus Consequence Relations.Denis Bonnay & Dag Westerståhl - 2012 - Journal of Philosophical Logic 41 (4):671-709.
Strong Normalization Theorem for a Constructive Arithmetic with Definition by Transfinite Recursion and Bar Induction.Osamu Takaki - 1997 - Notre Dame Journal of Formal Logic 38 (3):350-373.
Review: Haskell B. Curry, Language, Metalanguage, and Formal System. [REVIEW]A. R. Turquette - 1953 - Journal of Symbolic Logic 18 (3):270-270.

Analytics

Added to PP
2014-01-18

Downloads
33 (#487,487)

6 months
5 (#648,018)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Principal type-schemes and condensed detachment.J. Roger Hindley & David Meredith - 1990 - Journal of Symbolic Logic 55 (1):90-105.
Logic may be simple. Logic, congruence and algebra.Jean-Yves Béziau - 1997 - Logic and Logical Philosophy 5:129-147.
Idempotent Full Paraconsistent Negations are not Algebraizable.Jean-Yves Béziau - 1998 - Notre Dame Journal of Formal Logic 39 (1):135-139.
From Curry to Haskell.Felice Cardone - 2020 - Philosophy and Technology 34 (1):57-74.
Prelogic of logoi.Marcel Crabbé - 1976 - Studia Logica 35 (3):219 - 226.

View all 6 citations / Add more citations

References found in this work

No references found.

Add more references