Results for ' strict-tolerant logics'

965 found
Order:
  1.  24
    Strict/Tolerant Logics Built Using Generalized Weak Kleene Logics.Melvin Fitting - 2021 - Australasian Journal of Logic 18 (2).
    This paper continues my work of [9], which showed there was a broad family of many valued logics that have a strict/tolerant counterpart. Here we consider a generalization of weak Kleene three valued logic, instead of the strong version that was background for that earlier work. We explain the intuition behind that generalization, then determine a subclass of strict/tolerant structures in which a generalization of weak Kleene logic produces the same results that the strong Kleene (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  2.  57
    A Family of Strict/Tolerant Logics.Melvin Fitting - 2020 - Journal of Philosophical Logic 50 (2):363-394.
    Strict/tolerant logic, ST, evaluates the premises and the consequences of its consequence relation differently, with the premises held to stricter standards while consequences are treated more tolerantly. More specifically, ST is a three-valued logic with left sides of sequents understood as if in Kleene’s Strong Three Valued Logic, and right sides as if in Priest’s Logic of Paradox. Surprisingly, this hybrid validates the same sequents that classical logic does. A version of this result has been extended to meta, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  3. The Logics of Strict-Tolerant Logic.Eduardo Barrio, Lucas Rosenblatt & Diego Tajer - 2015 - Journal of Philosophical Logic 44 (5):551-571.
    Adding a transparent truth predicate to a language completely governed by classical logic is not possible. The trouble, as is well-known, comes from paradoxes such as the Liar and Curry. Recently, Cobreros, Egré, Ripley and van Rooij have put forward an approach based on a non-transitive notion of consequence which is suitable to deal with semantic paradoxes while having a transparent truth predicate together with classical logic. Nevertheless, there are some interesting issues concerning the set of metainferences validated by this (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   61 citations  
  4.  37
    The Strict/Tolerant Idea and Bilattices.Melvin Fitting - 2021 - In Ofer Arieli & Anna Zamansky (eds.), Arnon Avron on Semantics and Proof Theory of Non-Classical Logics. Springer Verlag. pp. 167-191.
    Strict/tolerant logic is a formally defined logic that has the same consequence relation as classical logic, though it differs from classical logic at the metaconsequence level. Specifically, it does not satisfy a cut rule. It has been proposed for use in work on theories of truth because it avoids some objectionable features arising from the use of classical logic. Here we are not interested in applications, but in the formal details themselves. We show that a wide range of (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  5.  91
    Classical Logic and the Strict Tolerant Hierarchy.Chris Scambler - 2020 - Journal of Philosophical Logic 49 (2):351-370.
    In their recent article “A Hierarchy of Classical and Paraconsistent Logics”, Eduardo Barrio, Federico Pailos and Damien Szmuc present novel and striking results about meta-inferential validity in various three valued logics. In the process, they have thrown open the door to a hitherto unrecognized domain of non-classical logics with surprising intrinsic properties, as well as subtle and interesting relations to various familiar logics, including classical logic. One such result is that, for each natural number n, there (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   32 citations  
  6. A truth-maker semantics for ST: refusing to climb the strict/tolerant hierarchy.Ulf Hlobil - 2022 - Synthese 200 (5):1-23.
    The paper presents a truth-maker semantics for Strict/Tolerant Logic (ST), which is the currently most popular logic among advocates of the non-transitive approach to paradoxes. Besides being interesting in itself, the truth-maker presentation of ST offers a new perspective on the recently discovered hierarchy of meta-inferences that, according to some, generalizes the idea behind ST. While fascinating from a mathematical perspective, there is no agreement on the philosophical significance of this hierarchy. I aim to show that there is (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  7.  55
    On the StrictTolerant Conception of Truth.Stefan Wintein - 2014 - Australasian Journal of Philosophy 92 (1):1-20.
    We discuss four distinct semantic consequence relations which are based on Strong Kleene theories of truth and which generalize the notion of classical consequence to 3-valued logics. Then we set up a uniform signed tableau calculus, which we show to be sound and complete with respect to each of the four semantic consequence relations. The signs employed by our calculus are,, and, which indicate a strict assertion, strict denial, tolerant assertion and tolerant denial respectively. Recently, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  80
    Supervaluations and the Strict-Tolerant Hierarchy.Brian Porter - 2021 - Journal of Philosophical Logic 51 (6):1367-1386.
    In a recent paper, Barrio, Pailos and Szmuc (BPS) show that there are logics that have exactly the validities of classical logic up to arbitrarily high levels of inference. They suggest that a logic therefore must be identified by its valid inferences at every inferential level. However, Scambler shows that there are logics with all the validities of classical logic at every inferential level, but with no antivalidities at any inferential level. Scambler concludes that in order to identify (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  9. Tolerant, Classical, Strict.Pablo Cobreros, Paul Egré, David Ripley & Robert van Rooij - 2012 - Journal of Philosophical Logic 41 (2):347-385.
    In this paper we investigate a semantics for first-order logic originally proposed by R. van Rooij to account for the idea that vague predicates are tolerant, that is, for the principle that if x is P, then y should be P whenever y is similar enough to x. The semantics, which makes use of indifference relations to model similarity, rests on the interaction of three notions of truth: the classical notion, and two dual notions simultaneously defined in terms of (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   167 citations  
  10.  63
    ST, LP and Tolerant Metainferences.Bogdan Dicher & Francesco Paoli - 2019 - In Can Başkent & Thomas Macaulay Ferguson (eds.), Graham Priest on Dialetheism and Paraconsistency. Cham, Switzerland: Springer Verlag. pp. 383-407.
    The strict-tolerant approach to paradox promises to erect theories of naïve truth and tolerant vagueness on the firm bedrock of classical logic. We assess the extent to which this claim is founded. Building on some results by Girard we show that the usual proof-theoretic formulation of propositional ST in terms of the classical sequent calculus without primitive Cut is incomplete with respect to ST-valid metainferences, and exhibit a complete calculus for the same class of metainferences. We also (...)
    Direct download  
     
    Export citation  
     
    Bookmark   48 citations  
  11.  22
    Sequent Calculi for First-order $$\textrm{ST}$$.Francesco Paoli & Adam Přenosil - 2024 - Journal of Philosophical Logic 53 (5):1291-1320.
    Strict-Tolerant Logic ($$\textrm{ST}$$ ST ) underpins naïve theories of truth and vagueness (respectively including a fully disquotational truth predicate and an unrestricted tolerance principle) without jettisoning any classically valid laws. The classical sequent calculus without Cut is sometimes advocated as an appropriate proof-theoretic presentation of $$\textrm{ST}$$ ST. Unfortunately, there is only a partial correspondence between its derivability relation and the relation of local metainferential $$\textrm{ST}$$ ST -validity – these relations coincide only upon the addition of elimination rules and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  12.  86
    Toleration and Law: Historical Aspects.Jean Imbert - 1997 - Ratio Juris 10 (1):13-24.
    Strictly speaking the law cannot admit toleration: It cannot tolerate ideas or behaviour which are contrary to its requirements. This logic explains why for centuries civilizations found no place for toleration. Then in the seventeenth and eighteenth centuries, philosophers and thinkers such as Spinoza, Locke, Bayle and later Voltaire or Malesherbes advocated tolerance, certain aspects of which were to be introduced into the legislation of many countries: freedom of opinion, the free movement of persons, freedom of assembly and of religion.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13. Tolerance and Mixed Consequence in the S'valuationist Setting.Pablo Cobreros, Paul Egré, David Ripley & Robert Rooij - 2012 - Studia Logica 100 (4):855-877.
    In a previous paper (see ‘Tolerant, Classical, Strict’, henceforth TCS) we investigated a semantic framework to deal with the idea that vague predicates are tolerant, namely that small changes do not affect the applicability of a vague predicate even if large changes do. Our approach there rests on two main ideas. First, given a classical extension of a predicate, we can define a strict and a tolerant extension depending on an indifference relation associated to that (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  14.  19
    Representation Results for Non-cumulative Logics.Xuefeng Wen & Xincheng Luo - 2021 - In Sujata Ghosh & Thomas Icard (eds.), Logic, Rationality, and Interaction: 8th International Workshop, Lori 2021, Xi’an, China, October 16–18, 2021, Proceedings. Springer Verlag. pp. 259-272.
    Most nonmonotonic logics are assumed to be cumulative, which is often regarded as the minimum requirement for a logic. We argue that cumulativity, in particular, cumulative transitivity can be abandoned, in order to better characterize reasoning in uncertainty. But giving up cumulative transitivity makes it hard to obtain representation results for these logics. Borrowing the idea from strict-tolerant logics, we give some representation results for nonmonotonic logics that are not cumulatively transitive.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  15. Strict Finitism, Feasibility, and the Sorites.Walter Dean - 2018 - Review of Symbolic Logic 11 (2):295-346.
    This article bears on four topics: observational predicates and phenomenal properties, vagueness, strict finitism as a philosophy of mathematics, and the analysis of feasible computability. It is argued that reactions to strict finitism point towards a semantics for vague predicates in the form of nonstandard models of weak arithmetical theories of the sort originally introduced to characterize the notion of feasibility as understood in computational complexity theory. The approach described eschews the use of nonclassical logic and related devices (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  16. On Three-Valued Presentations of Classical Logic.Bruno da Ré, Damian Szmuc, Emmanuel Chemla & Paul Égré - 2024 - Review of Symbolic Logic 17 (3):682-704.
    Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic consequence relations $st$, $ss$, $tt$, $ss\cap tt$, and $ts$, when the connectives are negation, conjunction, and disjunction. For $ts$ and $ss\cap tt$ the answer is trivial (no scheme works), and for $ss$ and $tt$ it is straightforward (they are the collapsible schemes, in which (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  17. A Hierarchy of Classical and Paraconsistent Logics.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - 2020 - Journal of Philosophical Logic 49 (1):93-120.
    In this article, we will present a number of technical results concerning Classical Logic, ST and related systems. Our main contribution consists in offering a novel identity criterion for logics in general and, therefore, for Classical Logic. In particular, we will firstly generalize the ST phenomenon, thereby obtaining a recursively defined hierarchy of strict-tolerant systems. Secondly, we will prove that the logics in this hierarchy are progressively more classical, although not entirely classical. We will claim that (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   48 citations  
  18.  19
    Tolerance and the Bounds.Rohan French - 2021 - Análisis Filosófico 41 (2):303-316.
    The present note investigates the connection between nonreflexive and nontransitive logics from a bounds-theoretic perspective. What will emerge is one way in which, if we focus on the ways in which strict and tolerant acts constrain one another, nonreflexive and nontransitive notions of consequence can be seen as simply reflecting different aspects of the same underlying reality.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  19.  8
    Simple Tableaus for Simple Logics.Melvin Fitting - 2024 - Notre Dame Journal of Formal Logic 65 (3):275-309.
    Consider those many-valued logic models in which the truth values are a lattice that supplies interpretations for the logical connectives of conjunction and disjunction, and which has a De Morgan involution supplying an interpretation for negation. Assume that the set of designated truth values is a prime filter in the lattice. Each of these structures determines a simple many-valued logic. We show that there is a single Smullyan-style signed tableau system appropriate for all of the logics these structures determine. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20.  17
    Gradability in Natural Language: Logical and Grammatical Foundations.Heather Burnett - 2016 - Oxford University Press UK.
    This book presents a new theory of the relationship between vagueness, context-sensitivity, gradability, and scale structure in natural language. Heather Burnett argues that it is possible to distinguish between particular subclasses of adjectival predicatesDLrelative adjectives like tall, total adjectives like dry, partial adjectives like wet, and non-scalar adjectives like hexagonalDLon the basis of how their criteria of application vary depending on the context; how they display the characteristic properties of vague language; and what the properties of their associated orders are. (...)
    Direct download  
     
    Export citation  
     
    Bookmark   16 citations  
  21. Capturing naive validity in the Cut-free approach.Eduardo Barrio, Lucas Rosenblatt & Diego Tajer - 2016 - Synthese 199 (Suppl 3):707-723.
    Rejecting the Cut rule has been proposed as a strategy to avoid both the usual semantic paradoxes and the so-called v-Curry paradox. In this paper we consider if a Cut-free theory is capable of accurately representing its own notion of validity. We claim that the standard rules governing the validity predicate are too weak for this purpose and we show that although it is possible to strengthen these rules, the most obvious way of doing so brings with it a serious (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  22.  63
    Inferences and Metainferences in ST.Pablo Cobreros, Paul Egré, David Ripley & Robert van Rooij - 2020 - Journal of Philosophical Logic 49 (6):1057-1077.
    In a recent paper, Barrio, Tajer and Rosenblatt establish a correspondence between metainferences holding in the strict-tolerant logic of transparent truth ST+ and inferences holding in the logic of paradox LP+. They argue that LP+ is ST+’s external logic and they question whether ST+’s solution to the semantic paradoxes is fundamentally different from LP+’s. Here we establish that by parity of reasoning, ST+ can be related to LP+’s dual logic K3+. We clarify the distinction between internal and external (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  23. Probabilistic Logic Under Coherence, Conditional Interpretations, and Default Reasoning.Angelo Gilio - 2005 - Synthese 146 (1-2):139-152.
    We study a probabilistic logic based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence). We examine probabilistic conditional knowledge bases associated with imprecise probability assessments defined on arbitrary families of conditional events. We introduce a notion of conditional interpretation defined directly in terms of precise probability assessments. We also examine a property of strong satisfiability which is related to the notion of toleration well known in default reasoning. In our framework we give more (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  24. Vagueness and Order Effects in Color Categorization.Paul Egré, Vincent de Gardelle & David Ripley - 2013 - Journal of Logic, Language and Information 22 (4):391-420.
    This paper proposes an experimental investigation of the use of vague predicates in dynamic sorites. We present the results of two studies in which subjects had to categorize colored squares at the borderline between two color categories (Green vs. Blue, Yellow vs. Orange). Our main aim was to probe for hysteresis in the ordered transitions between the respective colors, namely for the longer persistence of the initial category. Our main finding is a reverse phenomenon of enhanced contrast (i.e. negative hysteresis), (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  25.  3
    A cut-free modal theory of consequence.Edson Bezerra - 2025 - Asian Journal of Philosophy 4 (1):1-21.
    The cut-free validity theory $$\textsf{STV}$$ proposed by Barrio, Rosenblatt, and Tajer suffers from incompleteness with respect to its object language validity predicate. The validity predicate of $$\textsf{STV}$$ fails in validating some valid inferences of its underlying logic, the Strict Tolerant logic $$\textsf{ST}$$. In this paper, we will present the non-normal modal logic $$\textsf{ST}^{\Box \Diamond }$$ whose modalities $$\Box $$ and $$\Diamond $$ capture the tautologies/valid inferences and the consistent formulas of the logic $$\textsf{ST}$$, respectively. We show that $$\textsf{ST}^{\Box (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26.  82
    Deep ST.Thomas M. Ferguson & Elisángela Ramírez-Cámara - 2021 - Journal of Philosophical Logic 51 (6):1261-1293.
    Many analyses of notion of _metainferences_ in the non-transitive logic ST have tackled the question of whether ST can be identified with classical logic. In this paper, we argue that the primary analyses are overly restrictive of the notion of metainference. We offer a more elegant and tractable semantics for the strict-tolerant hierarchy based on the three-valued function for the LP material conditional. This semantics can be shown to easily handle the introduction of _mixed_ inferences, _i.e._, inferences involving (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  27.  84
    Vague judgment: a probabilistic account.Paul Égré - 2017 - Synthese 194 (10):3837-3865.
    This paper explores the idea that vague predicates like “tall”, “loud” or “expensive” are applied based on a process of analog magnitude representation, whereby magnitudes are represented with noise. I present a probabilistic account of vague judgment, inspired by early remarks from E. Borel on vagueness, and use it to model judgments about borderline cases. The model involves two main components: probabilistic magnitude representation on the one hand, and a notion of subjective criterion. The framework is used to represent judgments (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  28. Reaching Transparent Truth.Pablo Cobreros, Paul Égré, David Ripley & Robert van Rooij - 2013 - Mind 122 (488):841-866.
    This paper presents and defends a way to add a transparent truth predicate to classical logic, such that and A are everywhere intersubstitutable, where all T-biconditionals hold, and where truth can be made compositional. A key feature of our framework, called STTT (for Strict-Tolerant Transparent Truth), is that it supports a non-transitive relation of consequence. At the same time, it can be seen that the only failures of transitivity STTT allows for arise in paradoxical cases.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   134 citations  
  29.  21
    Respects for Contradictions.Paul Égré - 2019 - In Can Başkent & Thomas Macaulay Ferguson (eds.), Graham Priest on Dialetheism and Paraconsistency. Cham, Switzerland: Springer Verlag. pp. 39-57.
    I discuss the problem of whether true contradictions of the form “x is P and not P” might be the expression of an implicit relativization to distinct respects of application of one and the same predicate P. Priest rightly claims that one should not mistake true contradictions for an expression of lexical ambiguity. However, he primarily targets cases of homophony for which lexical meanings do not overlap. There exist more subtle forms of equivocation, such as the relation of privative opposition (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  30.  44
    Vague connectives.Paula Teijeiro - 2022 - Philosophical Studies 180 (5-6):1559-1578.
    Most literature on vagueness deals with the phenomenon as applied to predicates. On the contrary, even the idea of vague connectives seems to be taken as an oxymoron. The goal of this article is to propose an understanding of vague logical connectives based on vague quantifiers. The main idea is that the phenomenon of vagueness translates to connectives in terms of the property of Abnormality. I also argue that Prior’s Tonk can, according to this approach, be considered a vague connective. (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  31.  40
    Truth and Falsity in Buridan’s Bridge.Paul Égré - 2023 - Synthese 201 (1):1-22.
    This paper revisits Buridan’s Bridge paradox (Sophismata, chapter 8, Sophism 17), itself close kin to the Liar paradox, a version of which also appears in Bradwardine’s Insolubilia. Prompted by the occurrence of the paradox in Cervantes’s Don Quixote, I discuss and compare four distinct solutions to the problem, namely Bradwardine’s “just false” conception, Buridan’s “contingently true/false” theory, Cervantes’s “both true and false” view, and then the “neither true simpliciter nor false simpliciter” account proposed more recently by Jacquette. All have in (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  32. Paradox-tolerant logic.Raymond E. Jennings & D. K. Johnston - 1983 - Logique Et Analyse 26 (3):291-308.
     
    Export citation  
     
    Bookmark   2 citations  
  33. A recovery operator for nontransitive approaches.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - 2020 - Review of Symbolic Logic 13 (1):80-104.
    In some recent articles, Cobreros, Egré, Ripley, & van Rooij have defended the idea that abandoning transitivity may lead to a solution to the trouble caused by semantic paradoxes. For that purpose, they develop the Strict-Tolerant approach, which leads them to entertain a nontransitive theory of truth, where the structural rule of Cut is not generally valid. However, that Cut fails in general in the target theory of truth does not mean that there are not certain safe instances (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  34. Paradox-tolerant logic.R. E. Jennings - 1983 - Logique Et Analyse 26 (3):291.
     
    Export citation  
     
    Bookmark  
  35.  46
    Tolerance logic.Maarten Marx - 2001 - Journal of Logic, Language and Information 10 (3):353-374.
    We expand first order models with a tolerance relation on thedomain. Intuitively, two elements stand in this relation if they arecognitively close for the agent who holds the model. This simplenotion turns out to be very powerful. It leads to a semanticcharacterization of the guarded fragment of Andréka, van Benthemand Németi, and highlights the strong analogies between modallogic and this fragment. Viewing the resulting logic – tolerance logic– dynamically it is a resource-conscious information processingalternative to classical first order logic. The (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  36.  45
    Wright’s Strict Finitistic Logic in the Classical Metatheory: The Propositional Case.Takahiro Yamada - 2023 - Journal of Philosophical Logic 52 (4).
    Crispin Wright in his 1982 paper argues for strict finitism, a constructive standpoint that is more restrictive than intuitionism. In its appendix, he proposes models of strict finitistic arithmetic. They are tree-like structures, formed in his strict finitistic metatheory, of equations between numerals on which concrete arithmetical sentences are evaluated. As a first step towards classical formalisation of strict finitism, we propose their counterparts in the classical metatheory with one additional assumption, and then extract the propositional (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  37. Dialetheism and distributed sorites.Ben Blumson - 2023 - Synthese 202 (4):1-18.
    Noniterative approaches to the sorites paradox accept single steps of soritical reasoning, but deny that these can be combined into valid chains of soritical reasoning. The distributed sorites is a puzzle designed to undermine noniterative approaches to the sorites paradox, by deriving an inconsistent conclusion using only single steps, but not chains, of soritical reasoning. This paper shows how a dialetheist version of the noniterative approach, the strict-tolerant approach, also solves the distributed sorites paradox, at no further cost, (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  38. Minimal inconsistency-tolerant logics: a quantitative approach.Christian Strasser & Sanderson Molick - forthcoming - Australasian Journal of Logic.
    In order to reason in a non-trivializing way with contradictions, para- consistent logics reject some classically valid inferences. As a way of re- covering some of these inferences, Graham Priest ([Priest, 1991]) proposed to nonmonotonically strengthen the Logic of Paradox by allowing the se- lection of “less inconsistent” models via a comparison of their respective inconsistent parts. This move recaptures a good portion of classical logic in that it does not block, e.g., disjunctive syllogism, unless it is applied to (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  39. First-order tolerant logics.E. Zardini - forthcoming - Review of Symbolic Logic.
     
    Export citation  
     
    Bookmark   21 citations  
  40.  78
    A Delineation solution to the puzzles of absolute adjectives.Heather Burnett - 2014 - Linguistics and Philosophy 37 (1):1-39.
    The paper presents both new data and a new analysis of the semantic and pragmatic properties of the class of absolute scalar adjectives within an extension of a well-known logical framework for the analysis of gradable predicates: the delineation semantics framework . It has been long observed that the context-sensitivity, vagueness and gradability features of absolute scalar predicates give rise to certain puzzles for their analysis within most, if not all, modern formal semantic frameworks. While there exist proposals for solving (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  41. The Quantified Argument Calculus with Two- and Three-valued Truth-valuational Semantics.Hongkai Yin & Hanoch Ben-Yami - 2022 - Studia Logica 111 (2):281-320.
    We introduce a two-valued and a three-valued truth-valuational substitutional semantics for the Quantified Argument Calculus (Quarc). We then prove that the 2-valid arguments are identical to the 3-valid ones with strict-to-tolerant validity. Next, we introduce a Lemmon-style Natural Deduction system and prove the completeness of Quarc on both two- and three-valued versions, adapting Lindenbaum’s Lemma to truth-valuational semantics. We proceed to investigate the relations of three-valued Quarc and the Predicate Calculus (PC). Adding a logical predicate T to Quarc, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  42.  25
    Pure strict implication logics.Szymon Frankowski - 2007 - Bulletin of the Section of Logic 36 (1/2):59-65.
    Direct download  
     
    Export citation  
     
    Bookmark  
  43.  26
    (1 other version)Welding Semantics For Weak Strict Modal Logics into the General Framework of Modal Logic Semantics.Richard Routley - 1976 - Mathematical Logic Quarterly 23 (36):497-510.
  44.  45
    Carnap's Theories of Confirmation.Pierre Wagner - 2011 - In Dennis Dieks, Wenceslao Gonzalo, Thomas Uebel, Stephan Hartmann & Marcel Weber (eds.), Explanation, Prediction, and Confirmation. Springer. pp. 477--486.
    The first theory of confirmation that Carnap developed in detail is to be found in "Testability and Meaning". In this paper, he addressed the issue of a definition of empiricism, several years after abandoning the quest for a unique and universal logical framework supposed to be the basis of a clear distinction between the meaningful sentences of science and the pseudo-sentences of metaphysics. The principle of tolerance (according to which everyone is free to build up his own form of language (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  45. The End Times of Philosophy.François Laruelle - 2012 - Continent 2 (3):160-166.
    Translated by Drew S. Burk and Anthony Paul Smith. Excerpted from Struggle and Utopia at the End Times of Philosophy , (Minneapolis: Univocal Publishing, 2012). THE END TIMES OF PHILOSOPHY The phrase “end times of philosophy” is not a new version of the “end of philosophy” or the “end of history,” themes which have become quite vulgar and nourish all hopes of revenge and powerlessness. Moreover, philosophy itself does not stop proclaiming its own death, admitting itself to be half dead (...)
    No categories
     
    Export citation  
     
    Bookmark   1 citation  
  46. Dynamic Logic of Strict Processes.Juraj Podrouzek - 2009 - Filozofia 64 (4):346-350.
    The aim of the paper is to sketch some solutions that arose along the work on Logic of Strict Processes . Three main topics are discussed: negation based on implication constructed in intuitionistic fashion; satisfiability in multimodal contexts and a proposal of a first order semantics for Dynamic Logic of Strict Processes . The system of DLSP differs from the original LSP in using the set of contexts, which are treated as ordered sets of formulas. The interpretation of (...)
     
    Export citation  
     
    Bookmark  
  47.  56
    On Logic of Strictly-Deontic Modalities. A Semantic and Tableau Approach.Tomasz Jarmużek & Mateusz Klonowski - 2020 - Logic and Logical Philosophy 29 (3):335–380.
    Standard deontic logic (SDL) is defined on the basis of possible world semantics and is a logic of alethic-deontic modalities rather than deontic modalities alone. The interpretation of the concepts of obligation and permission comes down exclusively to the logical value that a sentence adopts for the accessible deontic alternatives. Here, we set forth a different approach, this being a logic which additionally takes into consideration whether sentences stand in relation to the normative system or to the system of values (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  48.  28
    Essential hereditary undecidability.Albert Visser - 2024 - Archive for Mathematical Logic 63 (5):529-562.
    In this paper we study essential hereditary undecidability. Theories with this property are a convenient tool to prove undecidability of other theories. The paper develops the basic facts concerning essentially hereditary undecidability and provides salient examples, like a construction of essentially hereditarily undecidable theories due to Hanf and an example of a rather natural essentially hereditarily undecidable theory strictly below. We discuss the (non-)interaction of essential hereditary undecidability with recursive boolean isomorphism. We develop a reduction relation essential tolerance, or, in (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49. Carnap's conventionalism: The problem with p-rules.Thomas Oberdan - 2005 - Grazer Philosophische Studien 68 (1):119-137.
    Rudolf Carnap's 'Principle of Tolerance' was undoubtedly one of the most infl uential precepts in 20th Century philosophy. Introduced in The Logical Syntax of Language, Carnap's Principle suffered from ambiguities which aroused important philosophical questions from Moritz Schlick and Alberto Coffa. Specifi cally, their questions arise from the application of the Principle to the matter of including extra-logical transformation rules in the defi nition of a language, which Carnap regarded as an important difference between his own conventionalist philosophy of logic (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  50. Vagueness, tolerance and contextual logic.Haim Gaifman - 2010 - Synthese 174 (1):5 - 46.
    The goal of this paper is a comprehensive analysis of basic reasoning patterns that are characteristic of vague predicates. The analysis leads to rigorous reconstructions of the phenomena within formal systems. Two basic features are dealt with. One is tolerance: the insensitivity of predicates to small changes in the objects of predication (a one-increment of a walking distance is a walking distance). The other is the existence of borderline cases. The paper shows why these should be treated as different, though (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   31 citations  
1 — 50 / 965