Switch to: References

Add citations

You must login to add citations.
  1. Categoricity Problem for LP and K3.Selcuk Kaan Tabakci - 2024 - Studia Logica 112 (6):1373-1407.
    Even though the strong relationship between proof-theoretic and model-theoretic notions in one’s logical theory can be shown by soundness and completeness proofs, whether we can define the model-theoretic notions by means of the inferences in a proof system is not at all trivial. For instance, provable inferences in a proof system of classical logic in the logical framework do not determine its intended models as shown by Carnap (Formalization of logic, Harvard University Press, Cambridge, 1943), i.e., there are non-Boolean models (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Second-Order Logic of Paradox.Allen P. Hazen & Francis Jeffry Pelletier - 2018 - Notre Dame Journal of Formal Logic 59 (4):547-558.
    The logic of paradox, LP, is a first-order, three-valued logic that has been advocated by Graham Priest as an appropriate way to represent the possibility of acceptable contradictory statements. Second-order LP is that logic augmented with quantification over predicates. As with classical second-order logic, there are different ways to give the semantic interpretation of sentences of the logic. The different ways give rise to different logical advantages and disadvantages, and we canvass several of these, concluding that it will be extremely (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Is strict finitism arbitrary?Nuno Maia - forthcoming - Philosophical Quarterly.
    Strict finitism posits a largest natural number. The view is usually thought to be objectionably arbitrary. After all, there seems to be no apparent reason as to why the natural numbers should ‘stop’ at a specific point and not a bit later on the natural line. Drawing on how arguments from arbitrariness are employed in mereology, I propose several ways of understanding this objection against strict finitism. No matter how it is understood, I argue that it is always found wanting.
    Download  
     
    Export citation  
     
    Bookmark  
  • Is there an inconsistent primitive recursive relation?Seungrak Choi - 2022 - Synthese 200 (5):1-12.
    The present paper focuses on Graham Priest’s claim that even primitive recursive relations may be inconsistent. Although he carefully presented his claim using the expression “may be,” Priest made a definite claim that even numerical equations can be inconsistent. His argument relies heavily on the fact that there is an inconsistent model for arithmetic. After summarizing Priest’s argument for the inconsistent primitive recursive relation, I first discuss the fact that his argument has a weak foundation to explain that the existence (...)
    Download  
     
    Export citation  
     
    Bookmark