Results for 'Curry's paradox'

27 found
Order:
  1. Curry’s Paradox and Ω -Inconsistency.Andrew Bacon - 2013 - Studia Logica 101 (1):1-9.
    In recent years there has been a revitalised interest in non-classical solutions to the semantic paradoxes. In this paper I show that a number of logics are susceptible to a strengthened version of Curry's paradox. This can be adapted to provide a proof theoretic analysis of the omega-inconsistency in Lukasiewicz's continuum valued logic, allowing us to better evaluate which logics are suitable for a naïve truth theory. On this basis I identify two natural subsystems of Lukasiewicz logic which (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  2. Naïve Proof and Curry’s Paradox.Massimiliano Carrara - 2018 - In Alessandro Giordani & Ciro de Florio (eds.), From Arithmetic to Metaphysics: A Path Through Philosophical Logic. Berlin: De Gruyter. pp. 61-68.
    Download  
     
    Export citation  
     
    Bookmark  
  3. Relevant First-Order Logic LP# and Curry’s Paradox Resolution.Jaykov Foukzon - 2015 - Pure and Applied Mathematics Journal Volume 4, Issue 1-1, January 2015 DOI: 10.11648/J.Pamj.S.2015040101.12.
    In 1942 Haskell B. Curry presented what is now called Curry's paradox which can be found in a logic independently of its stand on negation. In recent years there has been a revitalised interest in non-classical solutions to the semantic paradoxes. In this article the non-classical resolution of Curry’s Paradox and Shaw-Kwei' sparadox without rejection any contraction postulate is proposed. In additional relevant paraconsistent logic C ̌_n^#,1≤n<ω, in fact,provide an effective way of circumventing triviality of da Costa’s (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  4. Faithfulness for Naive Validity.Ulf Hlobil - 2019 - Synthese 196 (11):4759-4774.
    Nontransitive responses to the validity Curry paradox face a dilemma that was recently formulated by Barrio, Rosenblatt and Tajer. It seems that, in the nontransitive logic ST enriched with a validity predicate, either you cannot prove that all derivable metarules preserve validity, or you can prove that instances of Cut that are not admissible in the logic preserve validity. I respond on behalf of the nontransitive approach. The paper argues, first, that we should reject the detachment principle for naive (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  94
    Naïve Validity.Julien Murzi & Lorenzo Rossi - forthcoming - Synthese:1-23.
    Beall and Murzi :143–165, 2013) introduce an object-linguistic predicate for naïve validity, governed by intuitive principles that are inconsistent with the classical structural rules. As a consequence, they suggest that revisionary approaches to semantic paradox must be substructural. In response to Beall and Murzi, Field :1–19, 2017) has argued that naïve validity principles do not admit of a coherent reading and that, for this reason, a non-classical solution to the semantic paradoxes need not be substructural. The aim of this (...)
    Download  
     
    Export citation  
     
    Bookmark  
  6. Disarming a Paradox of Validity.Hartry Field - 2017 - Notre Dame Journal of Formal Logic 58 (1):1-19.
    Any theory of truth must find a way around Curry’s paradox, and there are well-known ways to do so. This paper concerns an apparently analogous paradox, about validity rather than truth, which JC Beall and Julien Murzi call the v-Curry. They argue that there are reasons to want a common solution to it and the standard Curry paradox, and that this rules out the solutions to the latter offered by most “naive truth theorists.” To this end they (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  7. Conditionals and Curry.Daniel Nolan - 2016 - Philosophical Studies 173 (10):2629-2647.
    Curry's paradox for "if.. then.." concerns the paradoxical features of sentences of the form "If this very sentence is true, then 2+2=5". Standard inference principles lead us to the conclusion that such conditionals have true consequents: so, for example, 2+2=5 after all. There has been a lot of technical work done on formal options for blocking Curry paradoxes while only compromising a little on the various central principles of logic and meaning that are under threat. -/- Once we (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  95
    Paths to Triviality.Tore Fjetland Øgaard - 2016 - Journal of Philosophical Logic 45 (3):237-276.
    This paper presents a range of new triviality proofs pertaining to naïve truth theory formulated in paraconsistent relevant logics. It is shown that excluded middle together with various permutation principles such as A → (B → C)⊩B → (A → C) trivialize naïve truth theory. The paper also provides some new triviality proofs which utilize the axioms ((A → B)∧ (B → C)) → (A → C) and (A → ¬A) → ¬A, the fusion connective and the Ackermann constant. An (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  9.  47
    Expressing Validity: Towards a Self-Sufficient Inferentialism.Ulf Hlobil - forthcoming - In Martin Blicha & Igor Sedlár (eds.), The Logica Yearbook 2019. London: College Publications.
    For semantic inferentialists, the basic semantic concept is validity. An inferentialist theory of meaning should offer an account of the meaning of "valid." If one tries to add a validity predicate to one's object language, however, one runs into problems like the v-Curry paradox. In previous work, I presented a validity predicate for a non-transitive logic that can adequately capture its own meta-inferences. Unfortunately, in that system, one cannot show of any inference that it is invalid. Here I extend (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10. Alethic Undecidability Doesn’T Solve the Liar.Mark Jago - 2016 - Analysis 76 (3):278-283.
    Stephen Barker presents a novel approach to solving semantic paradoxes, including the Liar and its variants and Curry’s paradox. His approach is based around the concept of alethic undecidability. His approach, if successful, renders futile all attempts to assign semantic properties to the paradoxical sentences, whilst leaving classical logic fully intact. And, according to Barker, even the T-scheme remains valid, for validity is not undermined by undecidable instances. Barker’s approach is innovative and worthy of further consideration, particularly by those (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11. Paradoxos Semânticos.Ricardo Santos - 2014 - Compêndio Em Linha de Problemas de Filosofia Analítica.
    The semantic paradoxes are a family of arguments – including the liar paradox, Curry’s paradox, Grelling’s paradox of heterologicality, Richard’s and Berry’s paradoxes of definability, and others – which have two things in common: first, they make an essential use of such semantic concepts as those of truth, satisfaction, reference, definition, etc.; second, they seem to be very good arguments until we see that their conclusions are contradictory or absurd. These arguments raise serious doubts concerning the coherence (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  12.  59
    On False Antecedent in Dialetheic Entailment.Massimiliano Carrara - 2019 - In Luca Bellotti, Luca Gili, Enrico Moriconi & Giacomo Turbanti (eds.), Third Pisa Colloquium in Logic, Language and Epistemology. Pisa PI, Italia: Edizioni ETS. pp. 59-68.
    Aim of the paper is to analyze Priest’s dialetheic solution to Curry’s paradox. It has been shown that a solution refuting ABS, accepting MPP and consequently refuting CP meets some difficulties. Here I just concentrate on one difficulty: one obtains the validity of MPP just using FA in the metalanguage, an invalid rule for a dialetheist.
    Download  
     
    Export citation  
     
    Bookmark  
  13.  67
    An Epistemicist Solution to the Alethic Paradoxes.Hasen Khudairi - manuscript
    This paper targets a series of potential issues for the discussion of, and modal resolution to, the alethic paradoxes advanced by Scharp (2013). I aim, then, to provide a novel, epistemicist treatment of the alethic paradoxes. In response to Curry's paradox, the epistemicist solution that I advance enables the retention of both classical logic and the traditional rules for the alethic predicate: truth-elimination and truth-introduction. By availing of epistemic modal logic, the epistemicist approach permits, further, of a descriptively (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  14. The Cut‐Free Approach and the Admissibility‐Curry.Ulf Hlobil - 2018 - Thought: A Journal of Philosophy 7 (1):40-48.
    The perhaps most important criticism of the nontransitive approach to semantic paradoxes is that it cannot truthfully express exactly which metarules preserve validity. I argue that this criticism overlooks that the admissibility of metarules cannot be expressed in any logic that allows us to formulate validity-Curry sentences and that is formulated in a classical metalanguage. Hence, the criticism applies to all approaches that do their metatheory in classical logic. If we do the metatheory of nontransitive logics in a nontransitive logic, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  15. Refuting Incompleteness and Undefinability.Pete Olcott - manuscript
    Within the (Haskell Curry) notion of a formal system we complete Tarski's formal correctness: ∀x True(x) ↔ ⊢ x and use this finally formalized notion of Truth to refute his own Undefinability Theorem (based on the Liar Paradox), the Liar Paradox, and the (Panu Raatikainen) essence of the conclusion of the 1931 Incompleteness Theorem.
    Download  
     
    Export citation  
     
    Bookmark  
  16.  59
    Separating Syntax and Combinatorics in Categorial Grammar.Reinhard Muskens - 2007 - Research on Language and Computation 5 (3):267-285.
    The ‘syntax’ and ‘combinatorics’ of my title are what Curry (1961) referred to as phenogrammatics and tectogrammatics respectively. Tectogrammatics is concerned with the abstract combinatorial structure of the grammar and directly informs semantics, while phenogrammatics deals with concrete operations on syntactic data structures such as trees or strings. In a series of previous papers (Muskens, 2001a; Muskens, 2001b; Muskens, 2003) I have argued for an architecture of the grammar in which finite sequences of lambda terms are the basic data structures, (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  17. Tableaux sin refutación.Tomás Barrero & Walter Carnielli - 2005 - Matemáticas: Enseñanza Universitaria 13 (2):81-99.
    Motivated by H. Curry’s well-known objection and by a proposal of L. Henkin, this article introduces the positive tableaux, a form of tableau calculus without refutation based upon the idea of implicational triviality. The completeness of the method is proven, which establishes a new decision procedure for the (classical) positive propositional logic. We also introduce the concept of paratriviality in order to contribute to the question of paradoxes and limitations imposed by the behavior of classical implication.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  18.  99
    Lógica positiva : plenitude, potencialidade e problemas (do pensar sem negação).Tomás Barrero - 2004 - Dissertation, Universidade Estadual de Campinas
    This work studies some problems connected to the role of negation in logic, treating the positive fragments of propositional calculus in order to deal with two main questions: the proof of the completeness theorems in systems lacking negation, and the puzzle raised by positive paradoxes like the well-known argument of Haskel Curry. We study the constructive com- pleteness method proposed by Leon Henkin for classical fragments endowed with implication, and advance some reasons explaining what makes difficult to extend this constructive (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  19. Forms of Luminosity.Hasen Khudairi - 2017
    This dissertation concerns the foundations of epistemic modality. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The dissertation demonstrates how phenomenal consciousness and gradational possible-worlds models in Bayesian perceptual psychology relate to epistemic modal space. The dissertation demonstrates, then, how epistemic modality relates to the computational theory of mind; metaphysical modality; deontic modality; logical modality; the types of mathematical modality; to the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20. Binding On the Fly: Cross-Sentential Anaphora in Variable— Free Semantics.Anna Szabolcsi - 2003 - In R. Oehrle & J. Kruijff (eds.), Resource Sensitivity, Binding, and Anaphora. Kluwer Academic Publishers. pp. 215--227.
    Combinatory logic (Curry and Feys 1958) is a “variable-free” alternative to the lambda calculus. The two have the same expressive power but build their expressions differently. “Variable-free” semantics is, more precisely, “free of variable binding”: it has no operation like abstraction that turns a free variable into a bound one; it uses combinators—operations on functions—instead. For the general linguistic motivation of this approach, see the works of Steedman, Szabolcsi, and Jacobson, among others. The standard view in linguistics is that reflexive (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  21. Lambda Grammars and the Syntax-Semantics Interface.Reinhard Muskens - 2001 - In Robert Van Rooij & Martin Stokhof (eds.), Proceedings of the Thirteenth Amsterdam Colloquium. Amsterdam: ILLC. pp. 150-155.
    In this paper we discuss a new perspective on the syntax-semantics interface. Semantics, in this new set-up, is not ‘read off’ from Logical Forms as in mainstream approaches to generative grammar. Nor is it assigned to syntactic proofs using a Curry-Howard correspondence as in versions of the Lambek Calculus, or read off from f-structures using Linear Logic as in Lexical-Functional Grammar (LFG, Kaplan & Bresnan [9]). All such approaches are based on the idea that syntactic objects (trees, proofs, fstructures) are (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  22.  91
    Trivial Languages.Arvid Båve - 2018 - Acta Analytica 33 (1):1-17.
    I here present and defend what I call the Triviality Theory of Truth, to be understood in analogy with Matti Eklund’s Inconsistency Theory of Truth. A specific formulation of is defended and compared with alternatives found in the literature. A number of objections against the proposed notion of meaning-constitutivity are discussed and held inconclusive. The main focus, however, is on the problem, discussed at length by Gupta and Belnap, that speakers do not accept epistemically neutral conclusions of Curry derivations. I (...)
    Download  
     
    Export citation  
     
    Bookmark  
  23. The Inexpressibility of Validity.Julien Murzi - 2014 - Analysis 74 (1):65-81.
    Tarski's Undefinability of Truth Theorem comes in two versions: that no consistent theory which interprets Robinson's Arithmetic (Q) can prove all instances of the T-Scheme and hence define truth; and that no such theory, if sound, can even express truth. In this note, I prove corresponding limitative results for validity. While Peano Arithmetic already has the resources to define a predicate expressing logical validity, as Jeff Ketland has recently pointed out (2012, Validity as a primitive. Analysis 72: 421-30), no theory (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  24. Proofs Are Programs: 19th Century Logic and 21st Century Computing.Philip Wadler - manuscript
    As the 19th century drew to a close, logicians formalized an ideal notion of proof. They were driven by nothing other than an abiding interest in truth, and their proofs were as ethereal as the mind of God. Yet within decades these mathematical abstractions were realized by the hand of man, in the digital stored-program computer. How it came to be recognized that proofs and programs are the same thing is a story that spans a century, a chase with as (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  25. Beliefs as Inner Causes: The (Lack of) Evidence.Devin Sanchez Curry - 2018 - Philosophical Psychology 31 (6):850-877.
    Many psychologists studying lay belief attribution and behavior explanation cite Donald Davidson in support of their assumption that people construe beliefs as inner causes. But Davidson’s influential argument is unsound; there are no objective grounds for the intuition that the folk construe beliefs as inner causes that produce behavior. Indeed, recent experimental work by Ian Apperly, Bertram Malle, Henry Wellman, and Tania Lombrozo provides an empirical framework that accords well with Gilbert Ryle’s alternative thesis that the folk construe beliefs as (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  26. Cartesian Critters Can't Remember.Devin Sanchez Curry - 2018 - Studies in History and Philosophy of Science Part A 69:72-85.
    Descartes held the following view of declarative memory: to remember is to reconstruct an idea that you intellectually recognize as a reconstruction. Descartes countenanced two overarching varieties of declarative memory. To have an intellectual memory is to intellectually reconstruct a universal idea that you recognize as a reconstruction, and to have a sensory memory is to neurophysiologically reconstruct a particular idea that you recognize as a reconstruction. Sensory remembering is thus a capacity of neither ghosts nor machines, but only of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  27. Cabbage À la Descartes.Devin Sanchez Curry - 2016 - Ergo: An Open Access Journal of Philosophy 3:609-637.
    This article offers an interpretation of Descartes’s method of doubt. It wields an examination of Descartes’s pedagogy—as exemplified by The Search for Truth as well as the Meditations—to make the case for the sincerity (as opposed to artificiality) of the doubts engendered by the First Meditation. Descartes was vigilant about balancing the need to use his method of doubt to achieve absolute certainty with the need to compensate for the various foibles of his scholastic and unschooled readers. Nevertheless, Descartes endeavored (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation