Results for ' undecidable sentences'

974 found
Order:
  1. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  2. Semantic Paradox and Alethic Undecidability.Stephen Barker - 2014 - Analysis 74 (2):201-209.
    I use the principle of truth-maker maximalism to provide a new solution to the semantic paradoxes. According to the solution, AUS, its undecidable whether paradoxical sentences are grounded or ungrounded. From this it follows that their alethic status is undecidable. We cannot assert, in principle, whether paradoxical sentences are true, false, either true or false, neither true nor false, both true and false, and so on. AUS involves no ad hoc modification of logic, denial of the (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  3. The Manifestation Challenge: The Debate between McDowell and Wright.Ali Hossein Khani & Saeedeh Shahmir - 2018 - Journal of Philosophical Investigations at University of Tabriz 12 (24): 287-306.
    In this paper, we will discuss what is called the “Manifestation Challenge” to semantic realism, which was originally developed by Michael Dummett and has been further refined by Crispin Wright. According to this challenge, semantic realism has to meet the requirement that knowledge of meaning must be publically manifested in linguistic behaviour. In this regard, we will introduce and evaluate John McDowell’s response to this anti-realistic challenge, which was put forward to show that the challenge cannot undermine realism. According to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4. Tarski Undefinability Theorem Succinctly Refuted.P. Olcott - manuscript
    If the conclusion of the Tarski Undefinability Theorem was that some artificially constrained limited notions of a formal system necessarily have undecidable sentences, then Tarski made no mistake within his assumptions. When we expand the scope of his investigation to other notions of formal systems we reach an entirely different conclusion showing that Tarski's assumptions were wrong.
    Download  
     
    Export citation  
     
    Bookmark  
  5. The Prolog Inference Model refutes Tarski Undefinability.P. Olcott - manuscript
    The generalized conclusion of the Tarski and Gödel proofs: All formal systems of greater expressive power than arithmetic necessarily have undecidable sentences. Is not the immutable truth that Tarski made it out to be it is only based on his starting assumptions. -/- When we reexamine these starting assumptions from the perspective of the philosophy of logic we find that there are alternative ways that formal systems can be defined that make undecidability inexpressible in all of these formal (...)
    Download  
     
    Export citation  
     
    Bookmark  
  6. Pluralism and the Liar.Cory Wright - 2017 - In Bradley P. Armour-Garb, Reflections on the Liar. Oxford, England: Oxford University. pp. 347–373.
    Pluralists maintain that there is more than one truth property in virtue of which bearers are true. Unfortunately, it is not yet clear how they diagnose the liar paradox or what resources they have available to treat it. This chapter considers one recent attempt by Cotnoir (2013b) to treat the Liar. It argues that pluralists should reject the version of pluralism that Cotnoir assumes, discourse pluralism, in favor of a more naturalized approach to truth predication in real languages, which should (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  7. The Relevance of Phenomenological Analysis Within Current Epistemology.Stathis Livadas - 2020 - Phainomenon 30 (1):107-134.
    This article is primarily concerned with the articulation of a defensible position on the relevance of phenomenological analysis with the current epistemological edifice as this latter has evolved since the rupture with the classical scientific paradigm pointing to the Newtonian-Leibnizian tradition which took place around the beginning of 20th century. My approach is generally based on the reduction of the objects-contents of natural sciences, abstracted in the form of ideal objectivities in the corresponding logical-mathematical theories, to the content of meaning-acts (...)
    Download  
     
    Export citation  
     
    Bookmark  
  8. Truth, Proof and Gödelian Arguments: A Defence of Tarskian Truth in Mathematics.Markus Pantsar - 2009 - Dissertation, University of Helsinki
    One of the most fundamental questions in the philosophy of mathematics concerns the relation between truth and formal proof. The position according to which the two concepts are the same is called deflationism, and the opposing viewpoint substantialism. In an important result of mathematical logic, Kurt Gödel proved in his first incompleteness theorem that all consistent formal systems containing arithmetic include sentences that can neither be proved nor disproved within that system. However, such undecidable Gödel sentences can (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  9. (1 other version)Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017 - Dissertation, Arché, University of St Andrews
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines 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 book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, (...) propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. Elohim develops a novel, topic-sensitive truthmaker semantics for dynamic epistemic logic, and develops a novel, dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for two-dimensional (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} is availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between Elohim's hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. Elohim countenances a hyperintensional semantics for novel epistemic abstractionist modalities. Elohim suggests, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for two-dimensional hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. Elohim invents a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Elohim provides a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  10. Effective finite-valued approximations of general propositional logics.Matthias Baaz & Richard Zach - 2008 - In Arnon Avron & Nachum Dershowitz, Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Springer Verlag. pp. 107–129.
    Propositional logics in general, considered as a set of sentences, can be undecidable even if they have “nice” representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple—at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances propositional logics represented in various (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11. Wolpert, Chaitin and Wittgenstein on impossibility, incompleteness, the liar paradox, theism, the limits of computation, a non-quantum mechanical uncertainty principle and the universe as computer—the ultimate theorem in Turing Machine Theory (revised 2019).Michael Starks - 2019 - In Suicidal Utopian Delusions in the 21st Century -- Philosophy, Human Nature and the Collapse of Civilization-- Articles and Reviews 2006-2019 4th Edition Michael Starks. Las Vegas, NV USA: Reality Press. pp. 294-299.
    I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv dot org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  12. Do Goedel's incompleteness theorems set absolute limits on the ability of the brain to express and communicate mental concepts verifiably?Bhupinder Singh Anand - 2004 - Neuroquantology 2:60-100.
    Classical interpretations of Goedels formal reasoning, and of his conclusions, implicitly imply that mathematical languages are essentially incomplete, in the sense that the truth of some arithmetical propositions of any formal mathematical language, under any interpretation, is, both, non-algorithmic, and essentially unverifiable. However, a language of general, scientific, discourse, which intends to mathematically express, and unambiguously communicate, intuitive concepts that correspond to scientific investigations, cannot allow its mathematical propositions to be interpreted ambiguously. Such a language must, therefore, define mathematical truth (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  13. The Undecidability of the Politics of Politics: On Geoffrey Bennington’s Scatter 1.Humberto González Núñez - 2018 - Politica Común 12.
    In this paper, I consider the contribution of Geoffrey Bennington's book, _Scatter 1_, to the ongoing discussion of the political dimension of deconstruction. Focusing on the resonances between Bennington's "politics of politics" and the notion of infrapolitics, I suggest that Bennington's major contribution revolves around the introduction of undecidability into political action and thought.
    Download  
     
    Export citation  
     
    Bookmark  
  14. (1 other version)The undecidability of the spatialized prisoner's dilemma.Patrick Grim - 1997 - Theory and Decision 42 (1):53-80.
    In the spatialized Prisoner's Dilemma, players compete against their immediate neighbors and adopt a neighbor's strategy should it prove locally superior. Fields of strategies evolve in the manner of cellular automata (Nowak and May, 1993; Mar and St. Denis, 1993a,b; Grim 1995, 1996). Often a question arises as to what the eventual outcome of an initial spatial configuration of strategies will be: Will a single strategy prove triumphant in the sense of progressively conquering more and more territory without opposition, or (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  15. Judge-Specific Sentences about Personal Taste, Indexical Contextualism, and Disagreement.Marián Zouhar - 2022 - Filozofia Nauki 30 (4):15-39.
    The paper aims to weaken a widespread argument against indexical contextualism regarding matters of personal taste. According to indexical contextualism, an utterance of “T is tasty” (where T is an object of taste) expresses the proposition that T is tasty for J (where J is a judge). This argument suggests that indexical contextualism cannot do justice to our disagreement intuitions regarding typical disputes about personal taste because it has to treat conversations in which one speaker utters “T is tasty” and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  16. What is Absolute Undecidability?†.Justin Clarke-Doane - 2012 - Noûs 47 (3):467-481.
    It is often supposed that, unlike typical axioms of mathematics, the Continuum Hypothesis (CH) is indeterminate. This position is normally defended on the ground that the CH is undecidable in a way that typical axioms are not. Call this kind of undecidability “absolute undecidability”. In this paper, I seek to understand what absolute undecidability could be such that one might hope to establish that (a) CH is absolutely undecidable, (b) typical axioms are not absolutely undecidable, and (c) (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  17. Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system.Matthew W. Parker - 2003 - Philosophy of Science 70 (2):359-382.
    Some have suggested that certain classical physical systems have undecidable long-term behavior, without specifying an appropriate notion of decidability over the reals. We introduce such a notion, decidability in (or d- ) for any measure , which is particularly appropriate for physics and in some ways more intuitive than Ko's (1991) recursive approximability (r.a.). For Lebesgue measure , d- implies r.a. Sets with positive -measure that are sufficiently "riddled" with holes are never d- but are often r.a. This explicates (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  18. اظهارات در مورد عدم امکان ، بی کامل بودن ، پاراستشتها، Undecidability ، اتفاقی ، Computability ، پارادوکس ، و عدم قطعیت در Chaitin ، ویتگنشتاین ، Hofstadter ، Wolpert ، doria ، دا کوستا ، گودل ، سرل ، رودیچ ، برتو ، فلوید ، مویال-شرراک و یانفسکی.Michael Richard Starks - 2019 - Las Vegas, NV USA: Reality Press.
    معمولا تصور می شود که عدم امکان ، بی کامل بودن ، پارامونشتها ، Undecidability ، اتفاقی ، قابلیت های مختلف ، پارادوکس ، عدم قطعیت و محدودیت های دلیل ، مسائل فیزیکی و ریاضی علمی و یا با داشتن کمی یا هیچ چیز در مشترک. من پیشنهاد می کنم که آنها تا حد زیادی مشکلات فلسفی استاندارد (به عنوان مثال ، بازی های زبان) که عمدتا توسط ویتگنشتاین بیش از 80 سال پیش حل و فصل شد. -/- "آنچه ما (...)
    Download  
     
    Export citation  
     
    Bookmark  
  19. Creative Undecidability of Real-World Dynamics and the Emergent Time Hierarchy.Andrei P. Kirilyuk - 2020 - FQXi Essay Contest 2019-2020 “Undecidability, Uncomputability, and Unpredictability”.
    The unreduced solution to the arbitrary interaction problem, absent in the standard theory framework, reveals many equally real and mutually incompatible system configurations, or "realizations". This is the essence of universal dynamic undecidability, or multivaluedness, and the ensuing causal randomness (unpredictability), non-computability, irreversible time flow (evolution, emergence), and dynamic complexity of every real system, object, or process. This creative undecidability of real-world dynamics provides causal explanations for "quantum mysteries", relativity postulates, cosmological problems, and the huge efficiency of high-complexity phenomena, such (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20. Learnability of state spaces of physical systems is undecidable.Petr Spelda & Vit Stritecky - 2024 - Journal of Computational Science 83 (December 2024):1-7.
    Despite an increasing role of machine learning in science, there is a lack of results on limits of empirical exploration aided by machine learning. In this paper, we construct one such limit by proving undecidability of learnability of state spaces of physical systems. We characterize state spaces as binary hypothesis classes of the computable Probably Approximately Correct learning framework. This leads to identifying the first limit for learnability of state spaces in the agnostic setting. Further, using the fact that finiteness (...)
    Download  
     
    Export citation  
     
    Bookmark  
  21. Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories.Panu Raatikainen - 2003 - Journal of Symbolic Logic 68 (1):262-266.
    A natural problem from elementary arithmetic which is so strongly undecidable that it is not even Trial and Error decidable (in other words, not decidable in the limit) is presented. As a corollary, a natural, elementary arithmetical property which makes a difference between intuitionistic and classical theories is isolated.
    Download  
     
    Export citation  
     
    Bookmark  
  22. Mathematical undecidability, quantum nonlocality, and the question of the existence of God.Alfred Driessen & Antoine Suarez (eds.) - 1997 - Springer.
    The title of the present book suggests that scientific results obtained in mathematics and quantum physics can be in some way related to the question of the existence of God. This seems possible to us, because it is our conviction that reality in all its dimensions is intelligible. The really impressive progress in science and technology demonstrates that we can trust our intellect, and that nature is not offering us a collection of meaningless absurdities. We first of all intend to (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  23. Frege, Sentence-questions, Questions, and Thoughts: a dialogue.Nathan William Davies - manuscript
    In the last forty years Dummett, Hanks, Künne, and Bobzien have claimed that when Frege wrote ‘Über Sinn und Bedeutung’, he thought that the sense of a sentence-question [Satzfrage] was not a thought [Gedanke] ((Dummett 1981: 307–308); (Hanks 2007: 142–143); (Künne 2010: 427–429); (Bobzien 2021: 163–164)). Recently, Textor has claimed that when Frege wrote ‘Über Sinn und Bedeutung’, he thought that the sense of a sentence-question was not a question [Frage] (Textor 2021: 227 fn.2). I think it is possible that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  24. Eliminating Undecidability and Incompleteness in Formal Systems.P. Olcott - manuscript
    To eliminate incompleteness, undecidability and inconsistency from formal systems we only need to convert the formal proofs to theorem consequences of symbolic logic to conform to the sound deductive inference model. -/- Within the sound deductive inference model there is a (connected sequence of valid deductions from true premises to a true conclusion) thus unlike the formal proofs of symbolic logic provability cannot diverge from truth.
    Download  
     
    Export citation  
     
    Bookmark  
  25. Sentence, Proposition, Judgment, Statement, and Fact: Speaking about the Written English Used in Logic.John Corcoran - 2009 - In W. A. Carnielli, The Many Sides of Logic. College Publications. pp. 71-103.
    The five English words—sentence, proposition, judgment, statement, and fact—are central to coherent discussion in logic. However, each is ambiguous in that logicians use each with multiple normal meanings. Several of their meanings are vague in the sense of admitting borderline cases. In the course of displaying and describing the phenomena discussed using these words, this paper juxtaposes, distinguishes, and analyzes several senses of these and related words, focusing on a constellation of recommended senses. One of the purposes of this paper (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  26. Moorean Sentences and the Norm of Assertion.Michael J. Shaffer - 2012 - Logos and Episteme 3 (4):653-658.
    In this paper Timothy Williamson’s argument that the knowledge norm of assertion is the best explanation of the unassertability of Morrean sentences is challenged and an alternative account of the norm of assertion is defended.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  27. Algorithmic information theory and undecidability.Panu Raatikainen - 2000 - Synthese 123 (2):217-225.
    Chaitin’s incompleteness result related to random reals and the halting probability has been advertised as the ultimate and the strongest possible version of the incompleteness and undecidability theorems. It is argued that such claims are exaggerations.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  28. (1 other version)What Do Paraconsistent, Undecidable, Random, Computable and Incomplete mean? A Review of Godel's Way: Exploits into an undecidable world by Gregory Chaitin, Francisco A Doria , Newton C.A. da Costa 160p (2012).Michael Starks - 2017 - Philosophy, Human Nature and the Collapse of Civilization -- Articles and Reviews 2006-2017 3rd Ed 686p(2017).
    In ‘Godel’s Way’ three eminent scientists discuss issues such as undecidability, incompleteness, randomness, computability and paraconsistency. I approach these issues from the Wittgensteinian viewpoint that there are two basic issues which have completely different solutions. There are the scientific or empirical issues, which are facts about the world that need to be investigated observationally and philosophical issues as to how language can be used intelligibly (which include certain questions in mathematics and logic), which need to be decided by looking at (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  29. Sentence processing strategies in adult bilinguals.Kerry Kilborn & Takehiko Ito - 1989 - In Brian MacWhinney & Elizabeth Bates, The Crosslinguistic study of sentence processing. New York: Cambridge University Press. pp. 257--291.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  30. Free Will, Temporal Asymmetry, and Computational Undecidability.Stuart T. Doyle - 2022 - Journal of Mind and Behavior 43 (4):305-321.
    One of the central criteria for free will is “Could I have done otherwise?” But because of a temporal asymmetry in human choice, the question makes no sense. The question is backward-looking, while human choices are forward-looking. At the time when any choice is actually made, there is as of yet no action to do otherwise. Expectation is the only thing to contradict (do other than). So the ability to do something not expected by the ultimate expecter, Laplace’s demon, is (...)
    Download  
     
    Export citation  
     
    Bookmark  
  31. Does Predictive Sentencing Make Sense?Clinton Castro, Alan Rubel & Lindsey Schwartz - forthcoming - Inquiry: An Interdisciplinary Journal of Philosophy.
    This paper examines the practice of using predictive systems to lengthen the prison sentences of convicted persons when the systems forecast a higher likelihood of re-offense or re-arrest. There has been much critical discussion of technologies used for sentencing, including questions of bias and opacity. However, there hasn’t been a discussion of whether this use of predictive systems makes sense in the first place. We argue that it does not by showing that there is no plausible theory of punishment (...)
    Download  
     
    Export citation  
     
    Bookmark  
  32. Identificational Sentences.Friederike Moltmann - 2013 - Natural Language Semantics 21 (1):43-77.
    Based on the notion of a trope, this paper gives a novel analysis of identificational sentences such as 'this is Mary','this is a beautiful woman', 'this looks like Mary', or 'this is the same lump of clay, but not the same statue as that'.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  33. Null Sentences.Philip Hugly & Charles Sayward - 1999 - Iyyun, The Jewish Philosophical Quarterly 48:23-36.
    In Tractatus, Wittgenstein held that there are null sentences – prominently including logical truths and the truths of mathematics. He says that such sentences are without sense (sinnlos), that they say nothing; he also denies that they are nonsensical (unsinning). Surely it is what a sentence says which is true or false. So if a sentence says nothing, how can it be true or false? The paper discusses the issue.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  34. Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions.Davide Bresolin, Valentin Goranko, Angelo Montanari & Guido Sciavicco - 2010 - Annals of Pure and Applied Logic 161 (3):289-304.
    In this paper, we investigate the expressiveness of the variety of propositional interval neighborhood logics , we establish their decidability on linearly ordered domains and some important subclasses, and we prove the undecidability of a number of extensions of PNL with additional modalities over interval relations. All together, we show that PNL form a quite expressive and nearly maximal decidable fragment of Halpern–Shoham’s interval logic HS.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  35. This sentence does not contain the symbol X.Samuel Alexander - 2013 - The Reasoner 7 (9):108.
    A suprise may occur if we use a similar strategy to the Liar's paradox to mathematically formalize "This sentence does not contain the symbol X".
    Download  
     
    Export citation  
     
    Bookmark  
  36. Other matters: Karen barad’s two materialisms and the science of undecidability.Jonathan Basile - 2020 - Angelaki 25 (5):3-18.
    Karen Barad’s Meeting the Universe Halfway relies on mutually incompatible grounding gestures, one of which describes the relationality of an always already material-discursive reality, while the other seeks to ground this relation one-sidedly in matter. These two materialisms derive from the gesture she borrows from the New Materialist (and other related) fields, which posits her work as an advance over the history of “representationalism” and “social constructivism.” In turn, this one-sided materialism produces a skewed reading of the quantum mechanical phenomena (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  37. On Carnap sentences.P. Raatikainen - 2011 - Analysis 71 (2):245-246.
    The influential proposal that the analytical component of a theory is captured by its ‘Carnap sentence’ is critically scrutinized. A counterexample which makes the suggestion problematic is presented.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  38. Observation Sentences and Enlightened Empiricism in Quine’s philosophy.Ignacio Ávila - 2014 - Ideas Y Valores 63 (154):271-294.
    En este ensayo planteo una dificultad que encuentro en la última propuesta de Quine sobre las oraciones observacionales. Argumento que esta dificultad impide que tales oraciones cumplan el rol que él les asigna en su filosofía y socavan su empirismo ilustrado. Luego exploro tentativamente un resquicio que encuentro en la propia filosofía quineana que eventualmente podría evitar los problemas derivados de dicha dificultad. El precio de seguir el camino apuntado por ese resquicio es, sin embargo, una cierta reinterpretación del espíritu (...)
    Download  
     
    Export citation  
     
    Bookmark  
  39. Aristotle on Sentence and proposition.Mohammad Bagher Ghomi - manuscript
    Contrary to nouns and verbs that either do not include a co-positing of parts, including nouns and some verbs, or if they are, their parts do not significate separately, a sentence (λόγος) is a ‘significant portion of speech by co-positing, its parts signify something separately, though not as a positive or negative judgment but as utterance.’ (OI ., I, 4, 16b26-28). Therefore, every utterance in language that i) includes parts, ii) its signification is based on the co-positing of its parts, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  40. Serious Actualism, Typography, and Incompossible Sentences.Christopher James Masterman - 2025 - Erkenntnis 90 (1): 125-142.
    Serious actualists take it that all properties are existence entailing. I present a simple puzzle about sentence tokens which seems to show that serious actualism is false. I then consider the most promising response to the puzzle. This is the idea that the serious actualist should take ordinary property-talk to contain an implicit existential presupposition. I argue that this approach does not work: it fails to generalise appropriately to all sentence types and tokens. In particular, it fails to capture the (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  41. The Intractable and the Undecidable – Computation and Anticipatory Processes.Mihai Nadin - 2013 - International Journal of Applied Research on Information Technology and Computing 4 (3):99-121.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  42. Sentence-in-noise perception in Monolinguals and Multilinguals: The effect of contextual meaning, and linguistic and cognitive load.Charles Massingham - 2018 - Dissertation, Durham University
    This study proposes a framework by which grammatically and syntactically sound sentences are classified through the perceptual measurement in noise of multilinguals and monolinguals, using an objective measure called SPERI and an interpretivist measure called SPIn, with results evaluated using Shortlist models and the BLINCS model. Hereby filling a knowledge gap on the perception of sentences that combine in varying levels of contextual meaning, linguistic load and cognitive load, this study used sentence clustering methods to find limitations of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  43.  49
    Deciding The Undecidable.Kyle Hinds - manuscript
    This paper presents an exploration into Alan Turing's Halting Problem, providing a solution using ordinal arithmetic and trigonometric recursion. It builds on the principles of Turing machines, proposing a function H that correctly decides the expected behavior of Q at each recursive depth.
    Download  
     
    Export citation  
     
    Bookmark  
  44. Practical Moore Sentences.Matthew Mandelkern - 2019 - Noûs 55 (1):39-61.
    I discuss what I call practical Moore sentences: sentences like ‘You must close your door, but I don’t know whether you will’, which combine an order together with an avowal of agnosticism about whether the order will be obeyed. I show that practical Moore sentences are generally infelicitous. But this infelicity is surprising: it seems like there should be nothing wrong with giving someone an order while acknowledging that you do not know whether it will obeyed. I (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  45. Plural Action Sentences and Logical Form: Reply to Himmelreich.Kirk Ludwig - 2017 - Australasian Journal of Philosophy 95 (4):800-806.
    This paper replies to Himmelreich's ‘The Paraphrase Argument Against Collective Actions’ [2017], which presents three putative counterexamples to the multiple agents analysis of plural action sentences. The paper shows that the argument from the first example, the discursive dilemma, fails because it relies crucially on a simplification of the target analysis, and that the others don't bear on the question because they turn out on examination to be about individual rather than group action sentences.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  46. Non-Declarative Sentences and the Theory of Definite Descriptions.John-Michael Kuczynski - 2004 - Principia: An International Journal of Epistemology 8 (1):119–154.
    This paper shows that Russell’s theory of descriptions gives the wrong se-mantics for definite descriptions occurring in questions and imperatives. Depending on how that theory is applied, it either assigns nonsense to per-fectly meaningful questions and assertions or it assigns meanings that di-verge from the actual semantics of such sentences, even after all pragmatic and contextual variables are allowed for. Given that Russell’s theory is wrong for questions and assertions, it must be wrong for assertoric state-ments; for the semantics (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  47. A pragmatic treatment of simple sentences.Alex Barber - 2000 - Analysis 60 (4):300–308.
    Semanticists face substitution challenges even outside of contexts commonly recognized as opaque. Jennifer M. Saul has drawn attention to pairs of simple sentences - her term for sentences lacking a that-clause operator - of which the following are typical: -/- (1) Clark Kent went into the phone booth, and Superman came out. (1*) Clark Kent went into the phone booth, and Clark Kent came out. -/- (2) Superman is more successful with women than Clark Kent. (2*) Superman is (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  48. Spinoza and Gödel: Causa Sui and Undecidable Truth.Martin Zwick - 2007 - North American Spinoza Society Monograph 13:46-52.
    Spinoza distinguishes between causation that is external, as in A causing B where A is external to B, and causation that is internal, where C causes itself (causa sui), without any involvement of anything external to C. External causation is easy to understand, but self causation is not. This note explores an approach to self-causation based upon Gödelian undecidability and draws upon ideas from an earlier study of Gödel’s proof and the quantum measurement problem (Zwick, 1978).
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  49. Sleeping Beauty Remains Undecided.Marc Burock - manuscript
    The Sleeping Beauty problem remains controversial with disagreement between so-called Halfers and Thirders, although the Thirders appear to be leading these days. I analyze three popular arguments for the Thirder position, including the long-run frequency argument, Egla’s ‘symmetry’ argument, and new-information arguments, and find problems with each. The long-run frequency argument is almost unequivocally thought to strongly support Thirders, but in formalizing the argument for an arbitrary number of repetitions, I show that the expected proportion of Heads-Awakenings for a single-trial (...)
    Download  
     
    Export citation  
     
    Bookmark  
  50.  93
    Nudges for Judges: An Experiment on the Effect of Making Sentencing Costs Explicit.Eyal Aharoni, Heather M. Kleider-Offutt, Sarah F. Brosnan & Morris B. Hoffman - 2022 - Frontiers in Psychology 13.
    Judges are typically tasked to consider sentencing benefits but not costs. Previous research finds that both laypeople and prosecutors discount the costs of incarceration when forming sentencing attitudes, raising important questions about whether professional judges show the same bias during sentencing. To test this, we used a vignette-based experiment in which Minnesota state judges reviewed a case summary about an aggravated robbery and imposed a hypothetical sentence. Using random assignment, half the participants received additional information about plausible negative consequences of (...)
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 974