View topic on PhilPapers for more information
Related categories

12 found
Order:
More results on PhilPapers
  1. Fine on the Possibility of Vagueness.Andreas Ditter - forthcoming - In Federico L. G. Faroldi & Frederik van De Putte (eds.), Outstanding Contributions to Logic: Kit Fine.
    Fine (2017) proposes a new logic of vagueness, CL, that promises to provide both a solution to the sorites paradox and a way to avoid the impossibility result from Fine (2008). The present paper presents a challenge to his new theory of vagueness. I argue that the possibility theorem stated in Fine (2017), as well as his solution to the sorites paradox, fail in certain reasonable extensions of the language of CL. More specifically, I show that if we extend the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. Limits of Abductivism About Logic.Ulf Hlobil - 2021 - Philosophy and Phenomenological Research 103 (2):320-340.
    I argue against abductivism about logic, which is the view that rational theory choice in logic happens by abduction. Abduction cannot serve as a neutral arbiter in many foundational disputes in logic because, in order to use abduction, one must first identify the relevant data. Which data one deems relevant depends on what I call one's conception of logic. One's conception of logic is, however, not independent of one's views regarding many of the foundational disputes that one may hope to (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   10 citations  
  3. Refining Labelled Systems for Modal and Constructive Logics with Applications.Tim Lyon - 2021 - Dissertation, Technischen Universität Wien
    This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic paradigms: labelled and nested sequent calculi. The formalism of labelled sequents has been successful in that cut-free calculi in possession of desirable proof-theoretic properties can be automatically generated for large classes of logics. Despite these qualities, labelled systems make use of a complicated syntax that explicitly incorporates the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. La contrastación de teorías inconsistentes no triviales.Luis Felipe Bartolo Alegre - 2020 - Dissertation, Universidad Nacional Mayor de San Marcos
    This dissertation offers a proof of the logical possibility of testing empirical/factual theories that are inconsistent, but non-trivial. In particular, I discuss whether or not such theories can satisfy Popper's principle of falsifiablility. An inconsistent theory Ƭ closed under a classical consequence relation implies every statement of its language because in classical logic the inconsistency and triviality are coextensive. A theory Ƭ is consistent iff there is not a α such that Ƭ ⊢ α ∧ ¬α, otherwise it is inconsistent. (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  5. Três Vezes Não: Um Estudo Sobre as Negações Clássica, Paraconsistente e Paracompleta.Kherian Gracher - 2020 - Dissertation, Federal University of Santa Catarina
    Could there be a single logical system that would allow us to work simultaneously with classical, paraconsistent, and paracomplete negations? These three negations were separately studied in logics whose negations bear their names. Initially we will restrict our analysis to propositional logics by analyzing classical negation, ¬c, as treated by Classical Propositional Logic (LPC); the paraconsistent negation, ¬p, as treated through the hierarchy of Paraconsistent Propositional Calculi Cn (0 ≤ n ≤ ω); and the paracomplete negation, ¬q, as treated by (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  6. Star Models and the Semantics of Infectiousness.Matthew W. G. McClure - 2020 - Undergraduate Philosophy Journal of Australasia 2 (2):35–57.
    The first degree entailment (FDE) family is a group of logics, a many-valued semantics for each system of which is obtained from classical logic by adding to the classical truth-values true and false any subset of {both, neither, indeterminate}, where indeterminate is an infectious value (any formula containing a subformula with the value indeterminate itself has the value indeterminate). In this paper, we see how to extend a version of star semantics for the logics whose many-valued semantics lack indeterminate to (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. In the Name of Paraconsistency.Francisco Miró Quesada Cantuarias & Luis Felipe Bartolo Alegre - 2020 - South American Journal of Logic 6 (2):163-171.
    Logic systems that can handle contradictions were being used for some time without having a general technical name. One of the main proposers of these systems, Newton da Costa, asked Francisco Miró Quesada to suggest him a name for those systems. In the historical letter that here we translate into English for the first time, Miró Quesada suggests three names to da Costa for this purpose: ‘ultraconsistent’, ‘metaconsistent’, and ‘paraconsistent’; explaining their pros and cons. -/- Paper based on a letter (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  8. Las Lógicas Mixtas como escape al Problema del Colapso y al Desafío de Quine.Joaquín Santiago Toranzo Calderón - 2020 - Análisis Filosófico 40 (2):247-272.
    En este trabajo presentaré una forma de evitar los problemas más recurrentes en cierta versión del pluralismo lógico, aquella que defiende que incluso considerando un lenguaje fijo existen múltiples sistemas lógicos legítimos. Para ello, será necesario considerar los puntos de partida del programa pluralista y explicitar los problemas que de ellos surgen, principalmente el Desafío de Quine y el Problema del Colapso. Luego, propondré una modificación respecto de lo que se entiende por consecuencia lógica, para poder considerar una familia de (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  9. Apontamentos Em Filosofia da Lógica.Gilson Maicá de Oliveira - 2019 - Basilíade - Revista de Filosofia 1 (1):101-120.
    Neste artigo discutimos alguns aspectos da lógica nos dias atuais. O propósito central é mostrar a evolução dessa disciplina. Começamos com uma breve introdução onde especificamos o que queremos dizer com o termo “lógica”. A seguir, exporemos e discutiremos o que consideramos ser algumas das principais áreas de investigação da lógica atual. Concluímos o artigo com algumas observações sobre lógicas não clássicas e seus impactos sobre a filosofia. Ao final do texto se encontram mais detalhes que apontam para um aprofundamento (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  10. A Graph-Theoretic Method to Define Any Boolean Operation on Partitions.David Ellerman - 2019 - The Art of Discrete and Applied Mathematics 2 (2):1-9.
    The lattice operations of join and meet were defined for set partitions in the nineteenth century, but no new logical operations on partitions were defined and studied during the twentieth century. Yet there is a simple and natural graph-theoretic method presented here to define any n-ary Boolean operation on partitions. An equivalent closure-theoretic method is also defined. In closing, the question is addressed of why it took so long for all Boolean operations to be defined for partitions.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  11. Formalizing Kant’s Rules.Richard Evans, Andrew Stephenson & Marek Sergot - 2019 - Journal of Philosophical Logic 48:1-68.
    This paper formalizes part of the cognitive architecture that Kant develops in the Critique of Pure Reason. The central Kantian notion that we formalize is the rule. As we interpret Kant, a rule is not a declarative conditional stating what would be true if such and such conditions hold. Rather, a Kantian rule is a general procedure, represented by a conditional imperative or permissive, indicating which acts must or may be performed, given certain acts that are already being performed. These (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  12. A Neutral Temporal Deontic STIT Logic.Kees van Berkel & Tim Lyon - 2019 - In P. Blackburn, E. Lorini & M. Guo (eds.), Logic, Rationality, and Interaction. Berlin, Heidelberg: pp. 340-354.
    In this work we answer a long standing request for temporal embeddings of deontic STIT logics by introducing the multi-agent STIT logic TDS . The logic is based upon atemporal utilitarian STIT logic. Yet, the logic presented here will be neutral: instead of committing ourselves to utilitarian theories, we prove the logic TDS sound and complete with respect to relational frames not employing any utilitarian function. We demonstrate how these neutral frames can be transformed into utilitarian temporal frames, while preserving (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation