• Publications
  • Influence
Natural Deduction for Dual-intuitionistic Logic
  • L. Tranchini
  • Mathematics, Computer Science
  • Stud Logica
  • 1 June 2012
A natural deduction system for dual-intuitionistic logic that is a single-premise multiple-conclusions system and relationships with the natural deduction systems for intuitionistic and classical logic are discussed. Expand
Proof-theoretic harmony: towards an intensional account
  • L. Tranchini
  • Computer Science, Mathematics
  • Synthese
  • 21 September 2016
In this paper we argue that an account of proof-theoretic harmony based on reductions and expansions delivers an inferentialist picture of meaning which should be regarded as intensional, as opposedExpand
The Yoneda Reduction of Polymorphic Types
A family of type isomorphisms in System F whose validity corresponds, semantically, to some form of the Yoneda isomorphism from category theory, which can be used to eliminate quantifiers from a polymorphic type, replacing them with a combination of monomorphic type constructors. Expand
(I can’t get no) antisatisfaction
Substructural approaches to paradoxes have attracted much attention from the philosophical community in the last decade. In this paper we focus on two substructural logics, named $${\mathsf {ST}}$$Expand
The Naturality of Natural Deduction
It is shown that the Russell–Prawitz translation does preserve identity of proof with respect to the enriched system by highlighting the fact that naturality corresponds to a generalized permutation principle. Expand
Proof-theoretic semantics, paradoxes and the distinction between sense and denotation
  • L. Tranchini
  • Mathematics, Computer Science
  • J. Log. Comput.
  • 1 April 2016
In this paper we show how Dummett-Prawitz-style proof-theoretic semantics has to be modified in order to cope with paradoxical phenomena. It will turn out that one of its basic tenets has to be givenExpand
Supervaluationism: Truth, Value and Degree Functionality
This article deals with supervaluationism and the failure of truth-functionality. It draws some distinctions that may contribute to a better understanding of this semantic framework.
Ekman's Paradox
It is argued that reduction steps should not merely remove redundancies, but must respect the identity of proofs, and proposed to modify Tennant’s paradoxicality test by basing it on this refined notion of reduction. Expand
The naturality of natural deduction (II). Some remarks on atomic polymorphism
It is argued that the approach obtained by coupling the original Russell-Prawitz translation with the extended equational theory is more satisfactory for the study of proof identity than the one based on System Fat. Expand