DeepAI AI Chat
Log In Sign Up

Uniqueness of logical connectives in a bilateralist setting

by   Sara Ayhan, et al.

In this paper I will show the problems that are encountered when dealing with uniqueness of connectives in a bilateralist setting within the larger framework of proof-theoretic semantics and suggest a solution. Therefore, the logic 2Int is suitable, for which I introduce a sequent calculus system, displaying - just like the corresponding natural deduction system - a consequence relation for provability as well as one dual to provability. I will propose a modified characterization of uniqueness incorporating such a duality of consequence relations, with which we can maintain uniqueness in a bilateralist setting.


page 1

page 2

page 3

page 4


Uniqueness of Transformation based on Jacobian Determinant and curl-Vector

Numerical examples demonstrated that a prescribed positive Jacobian dete...

Characterization of incentive compatible single-parameter mechanisms revisited

We reexamine the characterization of incentive compatible single-paramet...

A conventional expansion of first-order Belnap-Dunn logic

This paper concerns an expansion of first-order Belnap-Dunn logic named ...

A Symmetric Lambda-Calculus Corresponding to the Negation-Free Bilateral Natural Deduction

Filinski constructed a symmetric lambda-calculus consisting of expressio...

Can Facial Uniqueness be Inferred from Impostor Scores?

In Biometrics, facial uniqueness is commonly inferred from impostor simi...

Coherent Explicit Dictionary Application for Haskell: Formalisation and Coherence Proof

Type classes are one of Haskell's most popular features and extend its t...

Almost Sure Uniqueness of a Global Minimum Without Convexity

This paper provides a theorem for the set of global minimizers, the argm...