Switch to: References

Add citations

You must login to add citations.
  1. Meaning and identity of proofs in a bilateralist setting: A two-sorted typed lambda-calculus for proofs and refutations.Sara Ayhan - forthcoming - Journal of Logic and Computation.
    In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard correspondence, which has been well-established between the simply typed lambda-calculus and natural deduction systems for intuitionistic logic, and apply it to a bilateralist proof system displaying two derivability relations, one for proving and one for refuting. The basis will be the natural deduction system (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Things May Not Be Simple: On Wittgenstein’s Internal Relations.Fabien Schang - 2022 - Logica Universalis 16 (4):621-641.
    Wittgenstein took the _Tractatus Logico-Philosophicus_ to be eventually invalidated by logical atomism. Our main thesis is that it can be revalidated, provided that we subtract the thesis 2.02 (“The object is simple.”) from it: atoms are not simple objects but, rather, bits of information the objects are made of. Starting from an introductory discussion about what is meant by a ‘logic of colors’, an explanatory framework is then proposed in the form of a partition semantics. The philosophical problem of Wittgenstein’s (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Truth‐value relations and logical relations.Lloyd Humberstone - 2023 - Theoria 89 (1):124-147.
    After some generalities about connections between functions and relations in Sections 1 and 2 recalls the possibility of taking the semantic values of ‐ary Boolean connectives as ‐ary relations among truth‐values rather than as ‐ary truth functions. Section 3, the bulk of the paper, looks at correlates of these truth‐value relations as applied to formulas, and explores in a preliminary way how their properties are related to the properties of “logical relations” among formulas such as equivalence, implication (entailment) and contrariety (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Contrariety re-encountered: nonstandard contraries and internal negation*.Lloyd Humberstone - 2023 - Logic Journal of the IGPL 31 (6):1084-1134.
    This discussion explores the possibility of distinguishing a tighter notion of contrariety evident in the Square of Opposition, especially in its modal incarnations, than as that binary relation holding statements that cannot both be true, with or without the added rider ‘though can both be false’. More than one theorist has voiced the intuition that the paradigmatic contraries of the traditional Square are related in some such tighter way—involving the specific role played by negation in contrasting them—that distinguishes them from (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Sample logic.Matthias Gerner - 2022 - Logic Journal of the IGPL 30 (5):728-776.
    The need for a ‘many-valued logic’ in linguistics has been evident since the 1970s, but there was lack of clarity as to whether it should come from the family of fuzzy logics or from the family of probabilistic logics. In this regard, Fine [14] and Kamp [26] pointed out undesirable effects of fuzzy logic (the failure of idempotency and coherence) which kept two generations of linguists and philosophers at arm’s length. (Another unwanted feature of fuzzy logic is the property of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A Simple Logic of Functional Dependence.Alexandru Baltag & Johan van Benthem - 2021 - Journal of Philosophical Logic 50 (5):939-1005.
    This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized assignment semantics for first order logic. The expressive strength, complete proof calculus and meta-properties of LFD are explored. Various language extensions are presented as well, up to undecidable modal-style logics for independence and dynamic logics of changing dependence models. Finally, more concrete settings for dependence are discussed: continuous (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations